Alphabeta Math
ExampleConstruction: AI-generatedVerification: 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.

Local spectrum and noncommuting terms

Example

Fix Q∈{2,3,4} and the two-site open chain L=2. Let κ,λ∈R with κ≠0 and finite β∈R∖{0}, and set H=−κe1−λe2=−Q(κP1+λD12). A classical diagonal replacement here means a density matrix diagonal in the computational basis ∣ab⟩. The exact finite Gibbs density ρβ of this matrix is not diagonal in that basis. Moreover P1,D12 are nontrivial projections with spectrum {0,1}, satisfy P1D12P1=Q−1P1, and do not commute.

Facts & Assumptions

Given: Q∈{2,3,4}, L=2, κ,λ∈R, κ≠0, and β∈R∖{0}.

[A1]

These parameter and boundary hypotheses are exactly those in the Example.

[F1]

Finite Hermitian Potts-clock chain: the inner product is linear in its first argument; P1=∣+⟩⟨+∣⊗I, D12=∑a∣aa⟩⟨aa∣, e1=QP1, e2=QD12, and H=−Q(κP1+λD12); the spectral projections Πμ are self-adjoint idempotents summing to I. A self-adjoint A is positive definite if ⟨Av,v⟩>0 for every nonzero v.

[F2]

The finite Potts Gibbs matrix is well-defined at every finite inverse temperature: H is self-adjoint, Zβ>0, and ρβ=Zβ−1∑μ∈Λ(H)e−βμΠμ.

[F3]

The exponential is a continuous bijection from R onto (0,∞): exp⁡:R→(0,∞) is bijective, so it is injective and has strictly positive values on real inputs.

[F4]

Potts local algebra and braid quotient: the operators e2j−1=QPj and e2j=QDj,j+1 are the adjacent local Potts Temperley-Lieb generators at loop weight Q.

Proof

1.1A1F1F4algebra

By [F4], P1 and D12 are the odd and even adjacent local generators in the stated Potts Temperley-Lieb representation. Since P:=∣+⟩⟨+∣, P∣a⟩=Q−1/2∣+⟩. Therefore P1D12P1=∑a=0Q−1(P∣a⟩⟨a∣P)⊗∣a⟩⟨a∣=Q−1P1. Both P1 and D12 are orthogonal projections. Their ranks are Q in the Q2-dimensional two-site space; for Q≥2 each has spectrum {0,1}.

1.2A1F1algebra

The matrix entry from ∣00⟩ to ∣10⟩ is ⟨10∣H∣00⟩=−κQ ⟨10∣P1∣00⟩=−κ/Q≠0, because D12 is diagonal in this basis. Hence H is not diagonal.

2.1A1F1step 1.1

Acting on ∣00⟩ gives P1D12∣00⟩=Q−1/2∣+⟩∣0⟩ and D12P1∣00⟩=Q−1∣00⟩. These vectors differ for every Q≥2, so P1D12≠D12P1.

2.2A1F1F2F3step 1.2algebra

Each eigenvalue μ of H has a unit eigenvector v. By [F2], H is self-adjoint; using the linear-first inner product from [F1], μ=⟨Hv,v⟩=⟨v,Hv⟩=μ‾, so μ∈R. Since β≠0, multiplication μ↦−βμ is injective, and [F3] makes μ↦e−βμ injective; [F3] also gives positive weights. The projections in [F1] sum to the identity, so Bβ=∑μe−βμΠμ is positive definite: for nonzero w, ⟨Bβw,w⟩=∑μe−βμ∥Πμw∥2>0. Now suppose ρβ were diagonal in the computational basis. By [F2], Zβ>0 and Bβ=Zβρβ, so Bβ would be diagonal. On the μ-eigenspace of H, Bβ acts by e−βμ; these scalars are distinct for distinct real μ, hence the eigenspaces of Bβ are exactly those of H. Every computational basis vector is an eigenvector of a diagonal Bβ, and therefore would be an H-eigenvector. This contradicts the nonzero off-diagonal entry in step 1.2, so ρβ is not diagonal.

3.1F1F2step 1.1algebra∎

At β=0, the spectral definition in [F1] gives B0=∑μΠμ=I, so [F2] gives ρ0=I/Q2, which is diagonal. If κ=0, [F1] gives H=−λQ D12, a diagonal matrix, so its spectral Gibbs density is diagonal as well. These boundary cases show why the nonzero assumptions are required.

Remarks

This is an exact finite-matrix example. It records no observation and establishes no claim about phase transitions, thermalization, or a material realization.

Depends on

Dependency tree · 2 levels

Sources