Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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 n≥0, let ιn:CARn→CARn+1 be the unique unital ∗-homomorphism sending each of the first n annihilation and creation generators to the generator with the same index. Here CARn is the universal finite-mode C*-algebra of The Finite-Mode CAR Algebra Is a Full Matrix Algebra. Then ιn is isometric and injective. Under the occupation-basis identifications Fn+1≅Fn⊗C2, it is represented by A↦A⊗I2.

Facts & Assumptions

Given: An integer n≥0 and the finite-mode C*-algebras CARn,CARn+1.

[F1]

The finite-mode C*-algebra is universal for the finite CAR relations and is represented faithfully on Fn as M2n(C) (The Finite-Mode CAR Algebra Is a Full Matrix Algebra).

[F2]

In the occupation basis, the first n annihilation and creation operators act by the toggle formulas in the finite-mode matrix-unit construction (Finite CAR Occupation Operators Give All Matrix Units).

[F3]

The algebraic finite-mode presentation has the quotient universal property for tuples satisfying the CAR (Finite-Mode Complex CAR Algebra).

Proof

1.1givenF1F3construct

The first n generators in CARn+1 satisfy the n-mode CAR relations. The quotient universal property in [F3], followed by the finite-mode C*-completion in [F1], therefore gives the unique unital ∗-homomorphism ιn with the stated generator values.

1.2givenF2algebra

Identify eS⊗eε with eS∪({n+1} if ε=1), where S⊆{1,…,n} and ε∈{0,1}. For j≤n, the number of occupied indices below j is unchanged by the last occupation bit. The formulas in [F2] therefore give cj(n+1)=cj(n)⊗I2 and (cj†)(n+1)=(cj†)(n)⊗I2. By multiplication and linearity, the representation of ιn(x) is πn(x)⊗I2 for every x∈CARn.

2.1givenF1step 1.2algebra∎

For any A∈M2n(C) and (x0,x1)∈C2n⊕C2n, ∥(A⊗I2)(x0,x1)∥22=∥Ax0∥22+∥Ax1∥22≤∥A∥2(∥x0∥22+∥x1∥22), so ∥A⊗I2∥≤∥A∥. Conversely, vectors (x,0) with ∥x∥2≤1 give ∥A⊗I2∥≥∥A∥. By [F1] and step 1.2, ∥ιn(x)∥=∥πn(x)⊗I2∥=∥πn(x)∥=∥x∥. Thus ιn is isometric and therefore injective; the argument includes n=0.

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