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 .
Let be the countable-mode occupation representation of on constructed in The Countable CAR Algebra Has the Universal Inductive-Limit Norm. Then is irreducible: its only closed invariant subspaces are and . In addition, the common kernel of all annihilators is the vacuum line , whereas the common kernel of all creators is .
Facts & Assumptions
Given: The countable-mode CAR algebra, its occupation representation , and the orthonormal basis .
The operators toggle membership of in with sign , are adjoints, satisfy the CAR, and extend to (The Countable CAR Algebra Has the Universal Inductive-Limit Norm).
The coordinate vectors form an orthonormal basis of , and their finite span is dense (The Countable CAR Algebra Has the Universal Inductive-Limit Norm).
Proof
Write and suppose for every . For any nonempty finite , take its least element . The coefficient of in is , and no other input subset maps to this output under . Hence for every nonempty , so . Conversely every annihilator kills .
If , choose a finite subset with and let be the least positive integer not in . The coefficient of in is , and this output has the unique input . Thus , proving that no nonzero vector is killed by every creator.
Let be a nonzero closed subspace invariant under . Choose and, by [F2], a finite subset with . If , put ; otherwise put . In either case . The operator used is the identity when and the displayed annihilator product otherwise. On basis vectors it vanishes unless , and then gives a sign times ; hence only contributes to its empty-set coefficient, so .
Given , use [F2] to choose a finite-support vector with . For each , put and . By [F1], , so the factors commute and is the diagonal projection that kills when ; it belongs to and has norm at most one. Choose at least every element of every nonempty set in the finite support of (take if there are none), so . Then : the first term is bounded by since is a contraction, and the second by the same norm since a coordinate functional on an orthonormal basis has norm one. Thus for every there is within of . Closedness and give .
For every finite , a finite creator product sends to up to a sign by [F1]. Invariance gives every basis vector in , and their finite span is dense by [F2]; hence . This proves there is no nonzero proper closed invariant subspace, so 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
- Günther Hörmann, C*-Algebras with Aspects of Quantum Physics, Chapter 6, §§6.1 and 6.7 (standard reference, not scraped)
- Jan Dereziński, Introduction to Representations of the Canonical Commutation and Anticommutation Relations, §5.7 (standard reference, not scraped)