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.
Canonical Finite-Mode CAR Inclusions Are Isometric
Statement
For , let be the unique unital -homomorphism sending each of the first annihilation and creation generators to the generator with the same index. Here is the universal finite-mode C*-algebra of The Finite-Mode CAR Algebra Is a Full Matrix Algebra. Then is isometric and injective. Under the occupation-basis identifications , it is represented by .
Facts & Assumptions
Given: An integer and the finite-mode C*-algebras .
The finite-mode C*-algebra is universal for the finite CAR relations and is represented faithfully on as (The Finite-Mode CAR Algebra Is a Full Matrix Algebra).
In the occupation basis, the first annihilation and creation operators act by the toggle formulas in the finite-mode matrix-unit construction (Finite CAR Occupation Operators Give All Matrix Units).
The algebraic finite-mode presentation has the quotient universal property for tuples satisfying the CAR (Finite-Mode Complex CAR Algebra).
Proof
The first generators in satisfy the -mode CAR relations. The quotient universal property in [F3], followed by the finite-mode C*-completion in [F1], therefore gives the unique unital -homomorphism with the stated generator values.
Identify with , where and . For , the number of occupied indices below is unchanged by the last occupation bit. The formulas in [F2] therefore give and . By multiplication and linearity, the representation of is for every .
For any and , , so . Conversely, vectors with give . By [F1] and step 1.2, . Thus is isometric and therefore injective; the argument includes .
Remarks
The embeddings use the fixed ordering in which the new mode is appended last. No choice principle is used.
Depends on
Used by
Dependency tree · two levels
7 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.4 (standard reference, not scraped)
- Jan Dereziński, Introduction to Representations of the Canonical Commutation and Anticommutation Relations, §4.2 (standard reference, not scraped)