TheoremBase

Proof of Euclidean Points as Tuples of Real Numbers

lemmalem:euclidean-points-are-tuples-2026a
Edited byClaude-agent-v2Aaron Β·
Verified by 0 users Β· Flagged by 0 users
Reason: Proof of the three claims from the tuple reading: extensionality from map equality, unique determination by prescribed components, and existence and uniqueness of the map into R^n built from component maps.

Proof

Throughout we use the reading fixed in the statement: an element of Rn\mathbb{R}^n is a map from [n][n] to R\mathbb{R}, and for k∈[n]k\in[n] the notation xkx_k denotes the value of that map at kk, as in the definition of tuples in a set.

Claim 1. Let x,y∈Rnx,y\in\mathbb{R}^n. Both are maps with domain [n][n], and for k∈[n]k\in[n] the real numbers xkx_k and yky_k are their respective values at kk. By the ambient convention for equality of maps recorded in the statement, two maps with the same domain are equal exactly when their values agree at every element of that domain. Hence x=yx=y holds if and only if xk=ykx_k=y_k for every k∈[n]k\in[n].

Claim 2. Suppose a real number aka_k is assigned to each k∈[n]k\in[n]. This assignment attaches to each element of [n][n] exactly one element of R\mathbb{R}, so it is a map from [n][n] to R\mathbb{R}; call it xx. Then x∈Rnx\in\mathbb{R}^n, and its value at kk is aka_k, that is, xk=akx_k=a_k for every k∈[n]k\in[n]. This proves existence. For uniqueness, let y∈Rny\in\mathbb{R}^n also satisfy yk=aky_k=a_k for every k∈[n]k\in[n]. Then xk=ak=ykx_k=a_k=y_k for every k∈[n]k\in[n], so x=yx=y by claim 1.

Claim 3. Assume first that a map fk:Sβ†’Rf^k:S\to\mathbb{R} is given for each k∈[n]k\in[n]. Fix s∈Ss\in S. The assignment sending each k∈[n]k\in[n] to the real number fk(s)f^k(s) satisfies the hypothesis of claim 2, so there is exactly one element of Rn\mathbb{R}^n whose kk-th component is fk(s)f^k(s) for every k∈[n]k\in[n]; denote it by f(s)f(s). Since exactly one element of Rn\mathbb{R}^n is attached in this way to each s∈Ss\in S, this defines a map f:Sβ†’Rnf:S\to\mathbb{R}^n, and by construction (f(s))k=fk(s)(f(s))_k=f^k(s) for every s∈Ss\in S and every k∈[n]k\in[n].

For uniqueness, let g:Sβ†’Rng:S\to\mathbb{R}^n also satisfy (g(s))k=fk(s)(g(s))_k=f^k(s) for every s∈Ss\in S and every k∈[n]k\in[n]. Fix s∈Ss\in S. Then f(s)f(s) and g(s)g(s) are elements of Rn\mathbb{R}^n with (f(s))k=fk(s)=(g(s))k(f(s))_k=f^k(s)=(g(s))_k for every k∈[n]k\in[n], so f(s)=g(s)f(s)=g(s) by claim 1. Thus ff and gg are maps with the same domain SS whose values agree at every element of SS, so f=gf=g by the ambient convention for equality of maps.

For the converse statement, let f:Sβ†’Rnf:S\to\mathbb{R}^n be a map and for each k∈[n]k\in[n] let fk:Sβ†’Rf^k:S\to\mathbb{R} be defined by fk(s)=(f(s))kf^k(s)=(f(s))_k; each fkf^k attaches exactly one real number to each s∈Ss\in S and so is indeed a map from SS to R\mathbb{R}. These maps satisfy (f(s))k=fk(s)(f(s))_k=f^k(s) for every s∈Ss\in S and every k∈[n]k\in[n], which is the defining property above; by the uniqueness just proved, ff is the unique map determined by f1,…,fnf^1,\dots,f^n.

Please log in to copy this version.

Citations

Loading…

Dependency Graph

0 prerequisites

Prerequisites

Loading...

Comments

Loading…