Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck passjudge 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.

Local spin factor inclusions preserve the operator norm

Statement

Fix d≥1, q≥1, and finite regions Λ⊆Λ′⊆Zd as in Local spin matrix algebras and their factor inclusions. Then the factor inclusion ιΛ,Λ′(T)=T⊗I is an isometric unital ∗-homomorphism:

∥ιΛ,Λ′(T)∥=∥T∥(T∈AΛ).

For nested finite regions Λ⊆Λ′⊆Λ′′, the inclusions compose: ιΛ′,Λ′′∘ιΛ,Λ′=ιΛ,Λ′′.

Facts & Assumptions

Given: d≥1, q≥1, finite Λ⊆Λ′⊆Λ′′⊆Zd, and the configuration Hilbert spaces and inclusions of Local spin matrix algebras and their factor inclusions.

[F1]

For finite Λ, HΛ=ℓ2({1,…,q}Λ); for Λ⊆Λ′, restriction of configurations identifies HΛ′ with HΛ⊗HΛ′∖Λ, and ιΛ,Λ′(T)=T⊗I (Local spin matrix algebras and their factor inclusions).

[F2]

Each finite configuration Hilbert space has a finite orthonormal configuration basis, and ∥T∥=sup⁡∥u∥=1∥Tu∥ is its induced operator norm (Local spin matrix algebras and their factor inclusions).

Proof

technique · direct

Given: d≥1, q≥1, the finite regions and configuration Hilbert spaces of the Statement.

1.1givenF1algebra

Under [F1], T↦T⊗I preserves products and adjoints because (T⊗I)(S⊗I)=TS⊗I and (T⊗I)∗=T∗⊗I; it sends IΛ to IΛ′. The configuration-basis factorization is associative, so for nested regions the two successive inclusions and the direct inclusion act identically on every configuration basis vector and hence are equal operators.

1.2givenF1F2algebra

Let K=HΛ′∖Λ, and choose its finite orthonormal configuration basis e1,…,es. Every ξ∈HΛ⊗K has a unique expansion ξ=∑j=1sξj⊗ej, with ∥ξ∥2=∑j∥ξj∥2. Therefore ∥(T⊗I)ξ∥2=∑j∥Tξj∥2≤∥T∥2∥ξ∥2, so ∥T⊗I∥≤∥T∥.

1.3givenF1F2constructalgebra

If T=0, both norms are zero. Otherwise, for every ε>0 the supremum definition in [F2] gives a unit vector u∈HΛ with ∥Tu∥>∥T∥−ε. Since q≥1, K is nonzero; choose a unit configuration vector v∈K. Then ∥(T⊗I)(u⊗v)∥=∥Tu∥∥v∥>∥T∥−ε, so ∥T⊗I∥≥∥T∥−ε for every ε>0.

2.1step 1.1step 1.2step 1.3∎

Letting ε↓0 in step 1.3 and combining with step 1.2 gives ∥ιΛ,Λ′(T)∥=∥T∥. Step 1.1 supplies the unital ∗-homomorphism and composition identities, completing the claim.

Depends on

Dependency tree · 2 levels

Sources