Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge 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.

Faithful irreducible finite-excitation representation

Statement

Assume Countable Choice, Γ=Zd with d≥1, and finite on-site dimension q≥1. Let Hvac and π:A→B(Hvac) be the finite-excitation representation of Finite-excitation vacuum spin representation and normality. Then π is faithful and irreducible: π(A)′=CI,π(A)′′=B(Hvac).

Here irreducible means precisely that the commutant consists only of scalar multiples of the identity. No classification of other representations is claimed.

Facts & Assumptions

Given: Countable Choice; the local spin algebras of Local spin matrix algebras and their factor inclusions; the configuration basis and isometric representation of Finite-excitation vacuum spin representation and normality.

[A1]

Assume ACω, the exact countable-choice principle used to form the norm completion in the preceding definition; no stronger choice principle is used (The Axiom of Countable Choice (ACω)).

[F1]

Finite-excitation vacuum spin representation and normality: Hvac=ℓ2(Sfin) has basis (es), and every finite local matrix acts on exactly its finite tensor factors in π.

[F2]

Local spin matrix algebras and their factor inclusions: for each site x and labels a,b∈{0,…,q−1} after the fixed basis relabeling, the local matrix unit Exab maps a configuration with label b at x to the configuration with label a there and leaves every other site unchanged.

Proof

technique · show that an operator commuting with the local algebra is diagonal in the configuration basis, then use local matrix units to equate its diagonal entries

Given: T∈π(A)′, the basis (es)s∈Sfin, and [F1]–[F2].

1.1givenA1F1F2construct

Let s≠t in Sfin. They differ at some site x; set a=sx and Q:=π(Exaa). Then Qes=es and Qet=0. Since TQ=QT, self-adjointness of Q gives ⟨Tes,et⟩=⟨QTes,et⟩=⟨Tes,Qet⟩=0. Thus every off-diagonal coefficient of Tes vanishes, so completeness of the specified orthonormal basis implies Tes=cses for some scalar cs. The representation and completion are under the exact Countable Choice hypothesis A1.

2.1F1F2step 1.1construct

If two configurations s,t differ at only one site x, choose the matrix unit Extxsx. By [F2], π(Extxsx)es=et. Commuting this operator through T gives ctet=Tet=Tπ(Extxsx)es=π(Extxsx)Tes=cset, hence ct=cs. Any s,t∈Sfin differ on a finite set, and changing those finitely many labels one site at a time connects them; therefore all cs equal a single scalar c.

3.1step 2.1F1algebra∎

Step 2.1 proves every T in the commutant is cI, while scalars commute with all operators, so π(A)′=CI. The definition of bicommutant then gives π(A)′′=(CI)′=B(Hvac). Faithfulness follows from the isometry established in Finite-excitation vacuum spin representation and normality.

Depends on

Dependency tree · 2 levels

Sources