Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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 W∈Rn×n satisfy W1n=1n, put M=(In−W)T(In−W), and assume ker⁡(In−W)=span⁡{1n}. Let 0<μ1≤⋯≤μn−1 be the eigenvalues of M restricted to the zero-sum subspace 1n⊥. For 1≤q<n, the minimum of tr⁡(YTMY) over Y∈Rn×q with YT1n=0 and YTY=Iq is ∑j=1qμj. The minimum is attained by taking the columns of Y to be orthonormal eigenvectors for the q smallest positive eigenvalues; when eigenvalues tie, the minimizing subspace may vary inside the tied eigenspace. The trace is the sum of diagonal entries.

Facts & Assumptions

Given: A real matrix W with row sums one, so W1n=1n, the matrix M=(In−W)T(In−W), the simple-kernel hypothesis ker⁡(In−W)=span⁡{1n}, and 1≤q<n.

[F1]

LLE forms M=(In−W)T(In−W) from a matrix W whose rows sum to one and minimizes tr⁡(YTMY) subject to YT1n=0 and YTY=Iq (Finite locally linear embedding with minimum-norm weights and a simple constant kernel).

[F2]

The standard real coordinate inner product is ⟨a,b⟩=∑i<naibi (The standard formulas ⟨x,y⟩=∑k<nxkyk on Rn and ∑k<nxkyk‾ on Cn are inner products).

[F3]
[F4]

The space decomposes as Rn=span⁡{1n}⊕1n⊥ (For a subspace W of a finite-dimensional inner product space, V=W⊕W⊥).

[F5]

For a real symmetric matrix, maximizing tr⁡(QTAQ) 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).

[F6]

The trace of a square matrix is the sum of its diagonal entries (The trace tr⁡(A) as the sum of the diagonal entries).

[F7]

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

1.1givenF1F2algebra

Put A=In−W. Then A1n=0 by [F1], and M=ATA is symmetric with M1n=0. For every v, vTMv=(Av)T(Av)=∑r(Av)r2≥0 by [F2]. Also Mv=0 implies 0=vTMv=∑r(Av)r2, hence Av=0; conversely Av=0 implies Mv=0. Therefore ker⁡M=ker⁡A=span⁡{1n}.

2.1step 1.1F2F3F4F7algebra

By [F4], Rn=span⁡{1n}⊕S for S=1n⊥, and [F3] gives an orthonormal basis matrix E∈Rn×(n−1) for S. Symmetry and M1n=0 imply M(S)⊆S, because 1nTMv=(M1n)Tv=0 for v∈S. The restriction is self-adjoint and has matrix R=ETME, which is symmetric and positive definite: if c≠0, then Ec∈S∖{0}, so Ec∉ker⁡M by step 1.1 and cTRc=(Ec)TM(Ec)=∑r(AEc)r2>0. By [F7], the restriction has an orthonormal eigenbasis; for each unit eigenvector with eigenvalue μ, positive definiteness gives μ>0. List its eigenvalues as 0<μ1≤⋯≤μn−1.

3.1step 2.1F5F6algebra

For every feasible Y, its columns lie in S, so Y=EQ with Q=ETY and QTQ=Iq. Substitution gives YTMY=QTRQ, hence tr⁡(YTMY)=tr⁡(QTRQ) by [F6]. Apply [F5] to −R, whose eigenvalues in descending order are −μ1≥⋯≥−μn−1. It follows that tr⁡(QTRQ)≥∑j=1qμj, with equality exactly for the q-dimensional bottom eigenspaces, including arbitrary choices inside a tie.

4.1step 2.1step 3.1F3F5∎

Taking Q to have orthonormal columns spanning q bottom eigendirections of R and setting Y=EQ satisfies both constraints and attains the bound in step 3.1. This proves the minimum and its equality cases.

Depends on

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