Alphabeta Math
TheoremStatement: 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.

Finite-Mode CAR and the Complex Clifford Algebra via Majorana Generators

Statement

Let n≥0, let V=C2n with ordered basis e1,…,e2n, and put Q(∑rzrer)=∑rzr2. Use the plus-Q convention of Universal Clifford algebra of a quadratic space. Give Cl+(V,Q) the conjugate-linear anti-involution that fixes each er; it is defined by conjugating coefficients, reversing words, and fixing the basis generators. Then there is a ∗-isomorphism

Cl+(V,Q)≅CARnalg

specified by

e2j−1⟼γ2j−1=aj+aj†,e2j⟼γ2j=i(aj†−aj).

The inverse sends aj to (e2j−1+ie2j)/2 and aj† to (e2j−1−ie2j)/2. These are finite-mode algebra maps; they assert no relation between CAR and CCR.

Facts & Assumptions

Given: An integer n≥0, the finite-mode CAR ∗-algebra, and the complex quadratic space (V,Q) with its ordered basis and plus-Q convention.

[F1]

In CARnalg, {ai,aj}=0, {ai†,aj†}=0, and {ai,aj†}=δij1; its quotient presentation gives the unique ∗-homomorphism for every tuple satisfying these relations (Finite-Mode Complex CAR Algebra).

[F2]

The plus-Q Clifford algebra is the quotient with canonical generators satisfying vˉ 2=Q(v)1 (Universal Clifford algebra of a quadratic space).

[F3]

Its polarized relation is vˉwˉ+wˉvˉ=2B(v,w)1 (Polarized relations in a Clifford algebra).

[F4]

Every linear map into a unital associative k-algebra satisfying f(v)2=Q(v)1 extends uniquely to a unital algebra map from Cl(V,Q) (Universal property of the Clifford algebra).

Proof

1.1givenF2constructalgebra

On TC(V) define er∗=er, conjugate scalars, and reverse each tensor word. For v=∑rzrer, let v‾=∑rzr‾er. Then the adjoint of the defining relation j(v)2−Q(v)1 is j(v‾)2−Q(v)‾1=j(v‾)2−Q(v‾)1, another defining relation. The generated two-sided ideal is therefore ∗-stable, so this operation descends to the stated anti-involution on the Clifford quotient.

1.2F1algebra

By [F1], γ2j−1∗=γ2j−1 and γ2j∗=γ2j. The same-mode relations give γ2j−12=ajaj†+aj†aj=1 and γ2j2=−(aj†−aj)2=aj†aj+ajaj†=1. Also {γ2j−1,γ2j}=i{aj+aj†,aj†−aj}=0. For distinct modes every term in the expanded anticommutator vanishes by [F1]. Thus {γr,γs}=2δrs1.

2.1givenF4step 1.2construct

For v=∑rzrer, linearity and step 1.2 give (∑rzrγr)2=∑rzr2 1+∑r<szrzs{γr,γs}=∑rzr2 1=Q(v)1. Consequently [F4] gives a unique unital algebra map Φ:Cl+(V,Q)→CARnalg with Φ(er)=γr. Since each γr is self-adjoint, Φ preserves ∗.

2.2givenF1F3step 1.1construct

Put bj=(e2j−1+ie2j)/2 and bj†=(e2j−1−ie2j)/2 in the Clifford algebra. By [F3], {er,es}=2δrs1. Expanding the three CAR anticommutators for the bj,bj† therefore gives {bi,bj}=0, {bi†,bj†}=0, and {bi,bj†}=δij1. The anti-involution from step 1.1 gives bj∗=bj†. The quotient definition in [F1] now yields a unique ∗-homomorphism Ψ:CARnalg→Cl+(V,Q) with these generator images.

3.1step 2.1step 2.2algebra∎

On each generator, ΦΨ(aj)=(γ2j−1+iγ2j)/2=aj and ΦΨ(aj†)=(γ2j−1−iγ2j)/2=aj†; likewise ΨΦ(e2j−1)=e2j−1 and ΨΦ(e2j)=e2j. The two composites are identities because each algebra is generated by the displayed generators and both maps preserve its operations. Thus Φ and Ψ are inverse ∗-isomorphisms.

Remarks

The scalar-product pairing convention is irrelevant to these generator relations: the modes are indexed by an orthonormal basis and the CAR use only δij. The sign is fixed by er2=+1.

Depends on

Used by

Dependency tree · two levels

9 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