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.
Under the simple constant-kernel condition, LLE trace minimizers are bottom positive eigenvectors
Statement
Let satisfy , put , and assume . Let be the eigenvalues of restricted to the zero-sum subspace . For , the minimum of over with and is . The minimum is attained by taking the columns of to be orthonormal eigenvectors for the smallest positive eigenvalues; when eigenvalues tie, the minimizing subspace may vary inside the tied eigenspace. The trace is the sum of diagonal entries.
Statement references
Facts & Assumptions
Given: A real matrix with row sums one, so , the matrix , the simple-kernel hypothesis , and .
LLE forms from a matrix whose rows sum to one and minimizes subject to and (Finite locally linear embedding with minimum-norm weights and a simple constant kernel).
The standard real coordinate inner product is (The standard formulas on and on are inner products).
The subspace has an orthonormal basis (Every finite-dimensional real or complex inner product space has an orthonormal basis).
The space decomposes as (For a subspace of a finite-dimensional inner product space, ).
For a real symmetric matrix, maximizing over orthonormal q-frames gives the sum of its q largest eigenvalues, with the stated tie-space equality cases (The maximum trace over q-dimensional orthonormal frames is the sum of the top q eigenvalues).
The trace of a square matrix is the sum of its diagonal entries (The trace as the sum of the diagonal entries).
A self-adjoint endomorphism of a finite-dimensional real inner-product space has an orthonormal eigenbasis (Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis).
Proof
Put . Then by [F1], and is symmetric with . For every , by [F2]. Also implies , hence ; conversely implies . Therefore .
By [F4], for , and [F3] gives an orthonormal basis matrix for . Symmetry and imply , because for . The restriction is self-adjoint and has matrix , which is symmetric and positive definite: if , then , so by step 1.1 and . By [F7], the restriction has an orthonormal eigenbasis; for each unit eigenvector with eigenvalue , positive definiteness gives . List its eigenvalues as .
For every feasible , its columns lie in , so with and . Substitution gives , hence by [F6]. Apply [F5] to , whose eigenvalues in descending order are . It follows that , with equality exactly for the q-dimensional bottom eigenspaces, including arbitrary choices inside a tie.
Taking to have orthonormal columns spanning q bottom eigendirections of and setting satisfies both constraints and attains the bound in step 3.1. This proves the minimum and its equality cases.
Depends on
- Finite locally linear embedding with minimum-norm weights and a simple constant kernel
- The maximum trace over q-dimensional orthonormal frames is the sum of the top q eigenvalues
- The standard formulas $\langle x,y\rangle=\sum_{k<n}x_k y_k$ on $\mathbb R^n$ and $\sum_{k<n}x_k\overline{y_k}$ on $\mathbb C^n$ are inner products
- The trace $\operatorname{tr}(A)$ as the sum of the diagonal entries
- Every finite-dimensional real or complex inner product space has an orthonormal basis
- For a subspace $W$ of a finite-dimensional inner product space, $V=W\oplus W^\perp$
- Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis
Used by
Cited to discharge well-definedness by Finite locally linear embedding with minimum-norm weights and a simple constant kernel.
Dependency tree · two levels
27 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- The Elements of Statistical Learning, second edition, corrected 12th printing (standard reference, not scraped)
- Maria Cameron, Linear and Nonlinear Dimensionality Reduction, lecture notes (standard reference, not scraped)
- Ulrike von Luxburg, A Tutorial on Spectral Clustering (standard reference, not scraped)