Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)judge pass (z-ai/glm-5.2)audited 2026-07-29
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

The Euclidean inner product x,y=k<nxkyk\langle x,y\rangle = \sum_{k<n} x_k y_k on Rn\mathbb{R}^n

Definition

Let nNn \in \mathbb{N}. A natural number is a von Neumann natural, that is a set, and n={0,1,,n1}n = \{0, 1, \dots, n-1\} (The natural numbers N\mathbb{N} (von Neumann), On N\mathbb{N} the order is membership: m<n    mnm < n \iff m \in n), so

Rn  =  {x  :  x is a function nR}\mathbb{R}^{n} \;=\; \{\, x \;:\; x \text{ is a function } n \to \mathbb{R} \,\}

is the function space of The vector space FXF^{X} of all functions XFX \to F with pointwise operations, and FnF^{n} as the case X=n={0,1,,n1}X = n = \{0, 1, \dots, n-1\} at F=RF = \mathbb{R} and X=nX = n, a vector space over R\mathbb{R} under the pointwise operations (Vector space over a field). We write xk:=x(k)x_k := x(k) for k<nk < n, and two elements of Rn\mathbb{R}^{n} are equal exactly when they agree at every k<nk < n. This is the same set that Rn\mathbb{R}^n as the set of functions nRn \to \mathbb{R}, and d1d_1, d2d_2, dd_\infty are metrics on it calls Rn\mathbb{R}^{n}.

The Euclidean inner product of x,yRnx, y \in \mathbb{R}^{n} is the real number

x,y  :=  k<nxkyk,\langle x, y\rangle \;:=\; \sum_{k<n} x_k\,y_k ,

the finite sum of Finite sums and finite products, by recursion applied to the list kxkykk \mapsto x_k y_k (extended by 00 beyond nn, as every finite list in this library is). The Euclidean norm of xx is

x2  :=  x,x,\lVert x\rVert_2 \;:=\; \sqrt{\langle x, x\rangle},

which is defined because x,x=k<nxk20\langle x,x\rangle = \sum_{k<n} x_k^{2} \ge 0 (a sum of nonnegative terms, Laws of finite sums and finite products clause 4 and Squares of nonzero elements are positive, the case xk=0x_k = 0 giving xk2=0x_k^2 = 0 by Integer powers ama^m) and every nonnegative real has a unique nonnegative square root (Square roots exist: a unique a0\sqrt{a} \ge 0 with (a)2=a(\sqrt{a})^2 = a; the positives are {x2:x0}\{x^2 : x \neq 0\}).

Both are defined for every nn, including n=0n = 0

At n=0n = 0 the set R0\mathbb{R}^{0} has exactly one element, the empty function, and it is the zero vector space (The standard list e:nFne : n \to F^{n} with ei(i)=1Fe_i(i) = 1_F and ei(j)=0Fe_i(j) = 0_F for jij \ne i is an ordered basis of FnF^{n}; hence dimFFn=n\dim_F F^{n} = n, and F0F^{0} is the zero space with basis \varnothing and dimension 00 clause 5); the sum above is the empty sum, so x,y=0\langle x,y\rangle = 0 and x2=0\lVert x\rVert_2 = 0. This is the first place on this page where the two index regimes diverge, and the divergence is deliberate. The published metrics d1d_1, d2d_2, dd_\infty of Rn\mathbb{R}^n as the set of functions nRn \to \mathbb{R}, and d1d_1, d2d_2, dd_\infty are metrics on it are defined only for n1n \ge 1, because dd_\infty would otherwise be a maximum over the empty index set; the algebra above needs no such restriction. The boundary in this page runs between the algebra and the metric, not where a reader would guess, and Conventions of this page, the standing n1n \ge 1 hypothesis, and what is taken up elsewhere in the reading order lists exactly which items inherit n1n \ge 1.

The algebra of the inner product

For all x,y,zRnx, y, z \in \mathbb{R}^{n} and λR\lambda \in \mathbb{R}:

  1. Symmetry. x,y=y,x\langle x,y\rangle = \langle y,x\rangle, since xkyk=ykxkx_ky_k = y_kx_k termwise.
  2. Additivity in the first argument. x+y,z=x,z+y,z\langle x + y, z\rangle = \langle x,z\rangle + \langle y,z\rangle: the list k(xk+yk)zkk \mapsto (x_k+y_k)z_k is the termwise sum of kxkzkk \mapsto x_kz_k and kykzkk \mapsto y_kz_k, so Laws of finite sums and finite products clause 1 applies.
  3. Homogeneity in the first argument. λx,y=λx,y\langle \lambda x, y\rangle = \lambda\langle x,y\rangle, by Laws of finite sums and finite products clause 2.
  4. Bilinearity. Clauses 2 and 3 together with symmetry give the same two laws in the second argument.
  5. Positive definiteness. x,x0\langle x,x\rangle \ge 0, and x,x=0\langle x,x\rangle = 0 if and only if x=0x = 0. Indeed a vanishing sum of nonnegative terms has every term 00 (Laws of finite sums and finite products clause 4), so xk2=0x_k^{2} = 0 for every k<nk < n, and a nonzero real has a positive square (Squares of nonzero elements are positive), whence xk=0x_k = 0 for every k<nk < n and x=0x = 0.
  6. Agreement with the published Euclidean metric. For n1n \ge 1 and x,yRnx, y \in \mathbb{R}^{n}, xy2=k<n(xkyk)2=d2(x,y)\lVert x - y\rVert_2 = \sqrt{\sum_{k<n}(x_k-y_k)^{2}} = d_2(x,y), the two sides being the same expression (Rn\mathbb{R}^n as the set of functions nRn \to \mathbb{R}, and d1d_1, d2d_2, dd_\infty are metrics on it). In particular x2=d2(x,0)\lVert x\rVert_2 = d_2(x, 0).

That 2\lVert\cdot\rVert_2 is a norm in the sense of A norm on a real vector space, the induced metric, and the dictionary with the metric axioms is proved in Cauchy-Schwarz x,yx2y2\lvert\langle x,y\rangle\rvert \le \lVert x\rVert_2\lVert y\rVert_2 with its equality case, the triangle inequality for 2\lVert\cdot\rVert_2, the parallelogram law and polarisation, where the triangle inequality is obtained from the Cauchy-Schwarz inequality; it is not assumed here.

Remarks

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 133 results over 29 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources