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 positive norm eigenvalue of a nonzero positive compact self-adjoint operator has a nonzero finite-dimensional eigenspace
Statement
Assume AC. Let be a nonzero closed complex subspace and a nonzero bounded positive self-adjoint compact operator. Then is an eigenvalue, and is nonzero, closed and finite-dimensional.
Facts & Assumptions
Operator norms, positivity, self-adjointness and sequential compactness have the local conventions L two operator conventions for weak mixing.
The complex pairing is positive definite and satisfies Cauchy–Schwarz The complex pairing is well-defined and satisfies Cauchy–Schwarz.
Assume AC The Axiom of Choice.
Proof
Given: as stated and AC.
Write and . Self-adjointness makes Hermitian and positivity gives . For , expand with to obtain . If and , taking with arbitrarily large positive real makes , a contradiction. Thus in all cases .
Put . This is finite and nonnegative, since on the nonempty unit sphere. For any , the norm formula follows from Cauchy–Schwarz and testing when ; when both sides vanish. Step 1.1 consequently gives for all . On unit vectors this is at most , hence . The reverse inequality follows from the definition of , so . If , the displayed bound would force , contrary to the hypothesis; thus .
By AC choose unit vectors for every with . Expansion, step 2.1, and self-adjointness yield . Compactness gives a subsequence . Thus , and . Boundedness gives , while ; uniqueness of limits gives .
Let . It is a linear subspace and is closed by continuity of . It contains the unit vector from step 3.1. Suppose it has no finite spanning set. A choice function on the nonempty subsets of permits the following recursive selection: choose its value on the complement of the span of the finitely many previously obtained orthonormal vectors, subtract its projections onto them and normalize. The residual is nonzero because the chosen vector is not in that span. Pairing expansion shows that the resulting sequence is orthonormal and lies in . Then for , . No subsequence of these images is Cauchy, contradicting compactness. Therefore has a finite spanning set and is finite-dimensional. The only infinite selections were the maximizing sequence and this hypothetical orthonormal recursion, both under AC.
Depends on
Used by
Dependency tree · two levels
13 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
- Axler 10.96–10.99 p.326, with local positive quadratic argument replacing Fredholm theory (standard reference, not scraped)