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 on
Definition
Let . A natural number is a von Neumann natural, that is a set, and (The natural numbers (von Neumann), On the order is membership: ), so
is the function space of The vector space of all functions with pointwise operations, and as the case at and , a vector space over under the pointwise operations (Vector space over a field). We write for , and two elements of are equal exactly when they agree at every . This is the same set that as the set of functions , and , , are metrics on it calls .
The Euclidean inner product of is the real number
the finite sum of Finite sums and finite products, by recursion applied to the list (extended by beyond , as every finite list in this library is). The Euclidean norm of is
which is defined because (a sum of nonnegative terms, Laws of finite sums and finite products clause 4 and Squares of nonzero elements are positive, the case giving by Integer powers ) and every nonnegative real has a unique nonnegative square root (Square roots exist: a unique with ; the positives are ).
Both are defined for every , including
At the set has exactly one element, the empty function, and it is the zero vector space (The standard list with and for is an ordered basis of ; hence , and is the zero space with basis and dimension clause 5); the sum above is the empty sum, so and . This is the first place on this page where the two index regimes diverge, and the divergence is deliberate. The published metrics , , of as the set of functions , and , , are metrics on it are defined only for , because 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 hypothesis, and what is taken up elsewhere in the reading order lists exactly which items inherit .
The algebra of the inner product
For all and :
- Symmetry. , since termwise.
- Additivity in the first argument. : the list is the termwise sum of and , so Laws of finite sums and finite products clause 1 applies.
- Homogeneity in the first argument. , by Laws of finite sums and finite products clause 2.
- Bilinearity. Clauses 2 and 3 together with symmetry give the same two laws in the second argument.
- Positive definiteness. , and if and only if . Indeed a vanishing sum of nonnegative terms has every term (Laws of finite sums and finite products clause 4), so for every , and a nonzero real has a positive square (Squares of nonzero elements are positive), whence for every and .
- Agreement with the published Euclidean metric. For and , , the two sides being the same expression ( as the set of functions , and , , are metrics on it). In particular .
That 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 with its equality case, the triangle inequality for , the parallelogram law and polarisation, where the triangle inequality is obtained from the Cauchy-Schwarz inequality; it is not assumed here.
Remarks
-
Scope: the concrete form only. What is defined above is the Euclidean inner product on and nothing more. The general theory of inner product spaces — abstract inner products, orthonormal bases, Gram-Schmidt, orthogonal projection and orthogonal complements of arbitrary subspaces — is planned for a page of this library that comes earlier in the plan order and is not yet built. No item on this page claims anything about abstract inner product spaces, and no item on this page introduces the general notion.
-
The standard basis and coordinates. For the standard unit vector has and for (The standard list with and for is an ordered basis of ; hence , and is the zero space with basis and dimension ). Then : the list vanishes except at , where its value is , and a list vanishing off one index sums to its value there (Laws of finite sums and finite products clause 3, splitting the range at ). So the coordinates of are recovered by testing against the standard basis, which is the form used repeatedly below.
-
Powers here are integer powers. means the integer power of Integer powers , and by Square roots exist: a unique with ; the positives are and Laws of integer exponents.
Depends on
- A norm on a real vector space, the induced metric, and the dictionary with the metric axioms
- The vector space $F^{X}$ of all functions $X \to F$ with pointwise operations, and $F^{n}$ as the case $X = n = \{0, 1, \dots, n-1\}$
- Vector space over a field
- The standard list $e : n \to F^{n}$ with $e_i(i) = 1_F$ and $e_i(j) = 0_F$ for $j \ne i$ is an ordered basis of $F^{n}$; hence $\dim_F F^{n} = n$, and $F^{0}$ is the zero space with basis $\varnothing$ and dimension $0$
- Finite sums and finite products, by recursion
- Laws of finite sums and finite products
- $\mathbb{R}^n$ as the set of functions $n \to \mathbb{R}$, and $d_1$, $d_2$, $d_\infty$ are metrics on it
- Squares of nonzero elements are positive
- Square roots exist: a unique $\sqrt{a} \ge 0$ with $(\sqrt{a})^2 = a$; the positives are $\{x^2 : x \neq 0\}$
- The natural numbers $\mathbb{N}$ (von Neumann)
- On $\mathbb{N}$ the order is membership: $m < n \iff m \in n$
- Integer powers $a^m$
- Laws of integer exponents
Used by
- Second-order Taylor expansion f(a+h)=f(a)+∇ f(a)· h+tfrac12h^TH_f(a)h+o(‖h‖²) Corollary
- ‖·‖₁ on ℝ² violates the parallelogram law, so no symmetric bilinear form induces it Counterexample
- A curve for which the mean value inequality is an equality, showing the constant cannot be improved Counterexample
- f(t) = (t², t³) on [0,1]: no ξ satisfies f(1)-f(0) = f'(ξ) Counterexample
- g(x,y) = xy/(x²+y²), extended by g(0,0)=0, is continuous in each variable separately and not continuous at the origin Counterexample
- A convex subset of ℝᵐ contains every line segment between two of its points Definition
- A linear map L:ℝᵐ→ℝⁿ in Euclidean coordinates Definition
- Positive definite, negative definite, semidefinite, and indefinite quadratic forms Definition
- Series of vectors in ℝⁿ, absolute convergence, rearrangement, and the set of rearrangement sums Definition
- The derivative and the Riemann integral of a vector-valued function: an intrinsic derivative and a componentwise integral Definition
- The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case Definition
- The p-norms ‖ x‖ₚ for rational p ≥ 1, and ‖ x‖_∞ Definition
- The subspace Γ of directions along which a series converges absolutely, and its orthogonal complement Γ^⊥ Definition
- Vector-valued functions f : A → ℝᵐ, their limits and continuity, with the dictionary to the metric notions Definition
- A convergent sequence in ℝ³ and the integral ∫₀¹ (1, t, t²), computed componentwise Example
- A convergent series in ℝ² with Γ a line and Γ^⊥ a line, computed from the definition Example
- Steinitz's confinement bound realised on an explicit list of six unit vectors in ℝ² summing to zero Example
- FALSE: every connected subset of ℝⁿ is polygonally connected False statement
- FALSE: if a convergent series in ℝⁿ does not converge absolutely, then every point of ℝⁿ is the sum of some rearrangement of it False statement
- A definite quadratic form has a uniform signed bound on the Euclidean unit sphere Lemma
- Each ‖·‖ₚ is a norm on ℝⁿ, and the induced metrics are exactly d₁, d₂ and d_∞ of the published metric-spaces page Lemma
- Every Euclidean linear map has a unique matrix and satisfies ‖Lh‖₂≤ K‖h‖₂ for some K≥0 Lemma
- Small coordinate-by-coordinate increments stay inside a Euclidean ball and telescope the total increment Lemma
- Conventions of this page, the standing n ≥ 1 hypothesis, and what is taken up elsewhere in the reading order Remark
- A vector-valued function has a limit, or is continuous, if and only if each of its components does; with the algebra of continuous vector-valued functions Theorem
- Cauchy-Schwarz |⟨ x,y⟩| ≤ ‖ x‖₂‖ y‖₂ with its equality case, the triangle inequality for ‖·‖₂, the parallelogram law and polarisation Theorem
- For a ≤ b and f : [a,b] → ℝᵐ integrable when a<b, ‖∫ₐᵇ f‖₂ ≤ ∫ₐᵇ ‖ f‖₂; for a<b, ‖ f‖₂ is integrable Theorem
- Steinitz's polygonal confinement theorem: finitely many vectors of norm at most 1 summing to 0 can be ordered so that every partial sum has norm at most n Theorem
- The mean value inequality: if f : [a,b] → ℝᵐ is continuous and differentiable on (a,b) with ‖ f'‖₂ ≤ M, then ‖ f(b)-f(a)‖₂ ≤ M(b-a) Theorem
- The set of rearrangement sums of a convergent series in ℝⁿ is a nonempty subset of the affine subspace s + Γ^⊥ Theorem
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
- Dot product (Wikipedia) (standard reference, not scraped)
- Euclidean space (Wikipedia) (standard reference, not scraped)
- J. Demmel, MA221 Lecture 3: Vector Norms (standard reference, not scraped)
- G. Zitelli, Math 641 Functional Analysis, Part I (standard reference, not scraped)