Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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 Countable-Mode CAR Fock Representation Is Irreducible

Statement

Throughout this item, use the positive mode set N={1,2,…}.

Let πF be the countable-mode occupation representation of CARN on F∞=ℓ2(Pfin(N)) constructed in The Countable CAR Algebra Has the Universal Inductive-Limit Norm. Then πF is irreducible: its only closed invariant subspaces are {0} and F∞. In addition, the common kernel of all annihilators cj is the vacuum line Ce∅, whereas the common kernel of all creators cj† is {0}.

Facts & Assumptions

Given: The countable-mode CAR algebra, its occupation representation πF, and the orthonormal basis (eS)S∈Pfin(N).

[F1]

The operators cj,cj† toggle membership of j in S with sign (−1)∣{s∈S:s<j}∣, are adjoints, satisfy the CAR, and extend to πF (The Countable CAR Algebra Has the Universal Inductive-Limit Norm).

[F2]

The coordinate vectors eS form an orthonormal basis of F∞, and their finite span is dense (The Countable CAR Algebra Has the Universal Inductive-Limit Norm).

Proof

1.1givenF1F2algebra

Write ξ=∑SξSeS∈F∞ and suppose cjξ=0 for every j. For any nonempty finite S, take its least element j. The coefficient of eS∖{j} in cjξ is (−1)∣{s∈S:s<j}∣ξS=ξS, and no other input subset maps to this output under cj. Hence ξS=0 for every nonempty S, so ξ=ξ∅e∅. Conversely every annihilator kills e∅.

1.2givenF1F2choose

If ξ≠0, choose a finite subset S with ξS≠0 and let j be the least positive integer not in S. The coefficient of eS∪{j} in cj†ξ is (−1)∣{s∈S:s<j}∣ξS≠0, and this output has the unique input S. Thus cj†ξ≠0, proving that no nonzero vector is killed by every creator.

1.3givenF1F2choose

Let K⊆F∞ be a nonzero closed subspace invariant under πF(CARN). Choose 0≠ξ∈K and, by [F2], a finite subset S={j1<⋯<jq} with ξS≠0. If q=0, put η=ξ; otherwise put η=cjq⋯cj1ξ. In either case η∈K. The operator used is the identity when q=0 and the displayed annihilator product otherwise. On basis vectors it vanishes unless S⊆U, and then gives a sign times eU∖S; hence only U=S contributes to its empty-set coefficient, so η∅=±ξS≠0.

2.1givenF1F2step 1.3choosealgebra

Given ε>0, use [F2] to choose a finite-support vector ζ with ∥η−ζ∥<ε/2. For each n, put Nj=cj†cj and Qn=∏j=1n(I−Nj). By [F1], NjeT=1j∈TeT, so the factors commute and Qn is the diagonal projection that kills eT when T∩{1,…,n}≠∅; it belongs to πF(CARN) and has norm at most one. Choose n at least every element of every nonempty set in the finite support of ζ (take n=1 if there are none), so Qnζ=ζ∅e∅. Then ∥Qnη−η∅e∅∥≤∥Qn(η−ζ)∥+∣ζ∅−η∅∣<ε: the first term is bounded by ∥η−ζ∥ since Qn is a contraction, and the second by the same norm since a coordinate functional on an orthonormal basis has norm one. Thus for every ε>0 there is Qnη∈K within ε of η∅e∅. Closedness and η∅≠0 give e∅∈K.

3.1F1F2step 2.1algebra∎

For every finite S, a finite creator product sends e∅ to eS up to a sign by [F1]. Invariance gives every basis vector in K, and their finite span is dense by [F2]; hence K=F∞. This proves there is no nonzero proper closed invariant subspace, so πF is irreducible.

Remarks

The mode choices are explicit (a nonzero coordinate in step 1.3 and least-index choices in steps 1.1–1.2). Step 2.1 uses finite-support density to approximate one vector at a time; it does not select projections onto arbitrary closed subspaces or invoke Riesz representation, orthogonal-projection existence, or a choice axiom.

Depends on

Used by

Dependency tree · two levels

17 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