Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedverified 2026-10-22 (gpt-6.1-sol)
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.

Hermiticity and CAR of the ordered Ising Majoranas

Statement

For every integer N≥1 and real h,J, let HN, Xj,Yj,Zj, and γ1,…,γ2N be the matrices defined for the open transverse Ising chain. Then each γa is Hermitian and γaγb+γbγa=2δabIHN(1≤a,b≤2N).

Facts & Assumptions

Given: The finite tensor-product space and ordered operators of Open transverse Ising chain and ordered Majorana operators.

[F1]

Open transverse Ising chain and ordered Majorana operators: γ2j−1=(Z1⋯Zj−1)Xj and γ2j=(Z1⋯Zj−1)Yj, with the empty string equal to the identity.

[F2]

Pauli matrices and the two-qubit exchange operator: the matrices X,Y,Z are explicitly displayed; conjugate-transpose gives X∗=X, Y∗=Y, Z∗=Z, and direct multiplication of those displayed matrices gives the pairwise relations used below.

Proof

1.1givenF1F2algebra

The string Sj−1=Z1⋯Zj−1 is Hermitian, has square I, and commutes with Xj and Yj because it acts on different tensor factors. Hence γ2j−1 and γ2j are Hermitian, and each squares to I.

2.1F1F2step 1.1algebra

On one site, γ2j−1γ2j=Sj−12XjYj=iZj and γ2jγ2j−1=Sj−12YjXj=−iZj. Their sum is zero, so the two distinct operators at the same site anticommute.

3.1givenF1F2step 1.1step 2.1algebra∎

Let j<ℓ and choose either Xj or Yj at site j and either Xℓ or Yℓ at site ℓ. The string in the later operator contains exactly one Zj; all other factors commute across distinct sites, while both Xj and Yj anticommute with Zj by [F2]. Moving the earlier site matrix past the later string therefore contributes exactly one minus sign. Thus every pair of operators at distinct sites anticommutes. Together with the squares from step 1.1 and the same-site computation in step 2.1, this gives the stated CAR for all indices.

Depends on

Dependency tree · 2 levels

Sources