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.

Contractive local expectations and their commutator bound

Statement

For every finite X⊂Zd, the map EX of the normalized-trace-expectation definition is a unital positive contraction on Aloc and has a unique contractive extension EX:A→AX. For B∈AY, Y finite,

∥B−EX(B)∥≤∑z∈Y∖X sup⁡V∈A{z}V∗V=VV∗=I∥[B,V]∥.

Facts & Assumptions

Given: d≥1, a fixed finite spin dimension q≥1, finite regions X,Y⊂Zd, the local algebras AΛ, and B∈AY.

[F1]

Normalized-trace expectation onto a finite spin region: EX is normalized partial trace over the factors in Y∖X, followed by identity inclusion into X.

[F2]

Local spin matrix algebras and their factor inclusions: AY≅⨂z∈YMq(C), with the ordinary operator norm, normalized trace, and consistent factor inclusions.

Proof

technique · direct

Given: [F1], [F2], and B∈AY.

1.1givenF1F2algebra

On Cq in the standard basis ej, 0≤j<q, define Sej=ej+1 mod q and Dej=e2πij/qej. The q2 unitaries SaDb, 0≤a,b<q, satisfy q−2∑a,b=0q−1(SaDb)∗R(SaDb)=q−1Tr⁡(R)Iq(R∈Mq(C)). Indeed, averaging over b cancels each off-diagonal matrix unit because its phase is a nontrivial q-th root sum, and averaging the surviving diagonal units over a gives their arithmetic mean times Iq; for q=1 the formula is the identity. Applying this one-site twirl on each factor in Y∖X yields the normalized partial trace of [F1]. Each twirl is an average of unitary conjugations, so it is unital, positive, and contractive. The formula is unchanged when an extra identity factor is added, since its normalized trace is 1; hence EX is consistent on Aloc. Contractivity extends it uniquely to the completion, and its range remains in the closed finite-dimensional subalgebra AX.

2.1step 1.1F1F2algebra∎

Enumerate Y∖X={z1,…,zk} and write Ezj for the one-site twirl. The commuting twirls satisfy B−EX(B)=∑j=1kEz1⋯Ezj−1(B−Ezj(B)). For any C∈AY, the average formula gives ∥C−Ezj(C)∥≤sup⁡Vz∥C−Vz∗CVz∥=sup⁡Vz∥[C,Vz]∥, where Vz ranges over the one-site unitaries. Each preceding twirl is contractive and commutes with conjugation by Vz, so its term in the displayed sum is at most sup⁡Vz∥[B,Vz]∥. The triangle inequality and the finite sum over sites give the stated bound.

Depends on

Dependency tree · 2 levels

Sources