Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generated
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 H be a nonzero closed complex L2 subspace and S:HH a nonzero bounded positive self-adjoint compact operator. Then α=S>0 is an eigenvalue, and ker(SαI) is nonzero, closed and finite-dimensional.

Facts & Assumptions

[F1]

Operator norms, positivity, self-adjointness and sequential compactness have the local conventions L two operator conventions for weak mixing.

[F3]

The complex pairing is positive definite and satisfies Cauchy–Schwarz The complex L2 pairing is well-defined and satisfies Cauchy–Schwarz.

[F4]

Proof

Given: H,S as stated and AC.

1.1

Write B(x,y)=Sx,y and q(x)=B(x,x). Self-adjointness makes B Hermitian and positivity gives q0. For q(y)>0, expand q(xty) with t=B(x,y)/q(y) to obtain 0q(x)B(x,y)2/q(y). If q(y)=0 and B(x,y)0, taking t=RB(x,y) with arbitrarily large positive real R makes q(xty)=q(x)2RB(x,y)2<0, a contradiction. Thus in all cases B(x,y)2q(x)q(y).

F1F3
2.1

Put a=supx=1q(x). This is finite and nonnegative, since q(x)S on the nonempty unit sphere. For any z, the norm formula z=supy=1z,y follows from Cauchy–Schwarz and testing y=z/z when z0; when z=0 both sides vanish. Step 1.1 consequently gives Sx2aq(x) for all x. On unit vectors this is at most a2, hence Sa. The reverse inequality follows from the definition of a, so a=S=α. If a=0, the displayed bound would force S=0, contrary to the hypothesis; thus α>0.

F1F3step 1.1
3.1

By AC choose unit vectors xn for every nN with q(xn)>α1/(n+1). Expansion, step 2.1, and self-adjointness yield Sxnαxn2=Sxn22αq(xn)+α2α(αq(xn))<α/(n+1). Compactness gives a subsequence SxnjyH. Thus xnjx=y/α, and x=1. Boundedness gives SxnjSx, while Sxnjαxnj0; uniqueness of limits gives Sx=αx.

F1F3F4step 2.1
4.1

Let E=ker(SαI). It is a linear subspace and is closed by continuity of SαI. It contains the unit vector from step 3.1. Suppose it has no finite spanning set. A choice function on the nonempty subsets of E 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 (en) is orthonormal and lies in E. Then for nm, SenSem=αenem=α2. No subsequence of these images is Cauchy, contradicting compactness. Therefore E 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.

F1F3F4step 3.1

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