Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Finite Hermitian Potts-clock chain

Definition

Let Q∈{2,3,4} and let L≥1 be an integer. The finite Potts-clock space is HQ,L:=(CQ)⊗L of dimension QL, with the tensor-product Hermitian inner product taken linear in its first argument and computational orthonormal basis ∣a1,…,aL⟩:=∣a1⟩⊗⋯⊗∣aL⟩,aj∈{0,…,Q−1}. On CQ, this inner product is ⟨x,y⟩=∑a=0Q−1xaya‾, and on elementary tensors it is ⟨u1⊗⋯⊗uL,v1⊗⋯⊗vL⟩=∏j=1L⟨uj,vj⟩. For a unit vector u, the notation ∣u⟩⟨u∣ denotes the endomorphism v↦⟨v,u⟩u. On one site use the clock and shift convention RQ∣a⟩=e2πia/Q∣a⟩,MQ∣a⟩=∣a−1 ⁣ ⁣(modQ)⟩. Set ∣+⟩:=Q−1/2∑a=0Q−1∣a⟩. For 1≤j≤L, let Pj be ∣+⟩⟨+∣ on factor j and identity on every other factor. For 1≤j<L, let Dj,j+1:=∑a=0Q−1∣aa⟩⟨aa∣ act on factors j,j+1 and as identity on the others. The open-chain local operators are e2j−1:=Q Pj(1≤j≤L),e2j:=Q Dj,j+1(1≤j<L). Equivalently, these are the exact clock-shift operators of the open Potts representation: e2j−1=Q−1/2∑r=0Q−1MQ,j r and e2j=Q−1/2∑r=0Q−1RQ,j rRQ,j+1−r. Thus there are 2L−1 operators and no bond from site L back to site 1.

For real coefficients J1,…,J2L−1, define the weighted open-chain matrix HQ,L(J):=−∑i=12L−1Jiei. It is an endomorphism of HQ,L. For an endomorphism T of this inner-product space, T∗ is its adjoint, characterized by ⟨Tv,w⟩=⟨v,T∗w⟩; T is self-adjoint (Hermitian) exactly when T=T∗. An endomorphism is normal exactly when TT∗=T∗T, so every self-adjoint endomorphism is normal. For a subspace W⊆HQ,L, the orthogonal projection onto W sends w+z to w in the unique decomposition HQ,L=W⊕W⊥, with w∈W and z∈W⊥. Viewed as an endomorphism, it satisfies ΠW2=ΠW=ΠW∗; the adjoint identity follows from the orthogonality of the two summands. A self-adjoint endomorphism A is positive definite if ⟨Av,v⟩>0 for every nonzero v, and is positive semidefinite exactly when ⟨Av,v⟩≥0 for every v; these quadratic forms are real because A=A∗. The trace tr⁡(T) of a finite-dimensional endomorphism is the basis-independent sum of diagonal entries of its matrix.

For self-adjoint HQ,L and real β, a scalar λ is an eigenvalue of HQ,L when ker⁡(HQ,L−λI)≠{0}, and this kernel is its eigenspace. Let Λ(HQ,L) be the finite set of distinct eigenvalues. Every λ∈Λ(HQ,L) is real: for a unit eigenvector v, λ=⟨HQ,Lv,v⟩=⟨v,HQ,Lv⟩=λ‾. Let Πλ be the orthogonal projection onto the λ-eigenspace as defined above. A self-adjoint endomorphism is normal, and every normal endomorphism of a finite-dimensional complex inner-product space has an orthonormal eigenbasis; therefore ∑λ∈Λ(HQ,L)Πλ=I. Define Bβ(HQ,L):=∑λ∈Λ(HQ,L)e−βλΠλ,Zβ:=tr⁡Bβ(HQ,L),ρβ:=Zβ−1Bβ(HQ,L) whenever Zβ>0. Here a density matrix means a self-adjoint positive semidefinite endomorphism of trace one. The A-page Gibbs lemma establishes that the displayed HQ,L is self-adjoint and that Zβ>0 for every finite real β.

Depends on

Dependency tree · 2 levels

Sources