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.

Particle-Hole Exchange Is an Automorphism of Countable-Mode CAR

Statement

There is a unique ∗-automorphism α of CARN satisfying

α(aj)=aj†,α(aj†)=aj(j∈N).

It is involutive: α2=I.

Facts & Assumptions

Given: The countable-mode CAR C*-algebra as the completion of its finite-mode stages and the canonical generators aj,aj†.

[F1]

Each finite stage is the universal finite-mode C*-algebra with the CAR relations and its algebraic quotient presentation (Finite-Mode Complex CAR Algebra, The Finite-Mode CAR Algebra Is a Full Matrix Algebra).

[F2]

The finite stages embed isometrically and compatibly, and their union is dense in CARN (Countably Infinite-Mode CAR C*-Algebra, Canonical Finite-Mode CAR Inclusions Are Isometric).

Proof

1.1givenF1construct

On a finite stage, exchange aj with aj†. The first two CAR families are exchanged, while {ai†,aj}−δij1 is the same relation as {aj,ai†}−δji1 because δij=δji. The exchange also respects ∗, since (aj†)∗=aj. The quotient universal property in [F1] therefore gives a unital ∗-homomorphism αn:CARn→CARn. Applying it twice fixes every generator, so αn2=I and αn is an automorphism.

2.1givenF1F2step 1.1algebra∎

For m≤n, the maps αn∘ιm,n and ιm,n∘αm agree on every generator of CARm, hence agree on that stage by its universal property. The compatible automorphisms therefore define an automorphism α0 of the algebraic union. For x in a finite stage, the universal norm there is the supremum of ∥ρ(x)∥ over its unital representations; precomposition by the bijection αn permutes those representations, so ∥αn(x)∥=∥x∥. Thus α0 is isometric and extends continuously to the completion in [F2]. Its inverse extends from the compatible maps αn−1=αn, and α2=I because this holds on the dense union.

Remarks

This exchange is a ∗-algebra automorphism. It makes no statement about implementation by a unitary in the Fock representation.

Depends on

Used by

Dependency tree · two levels

12 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