Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge 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 matrix algebras and their factor inclusions

Definition

Fix an integer dimension d≥1, the countable site set Γ=Zd of Countability of every finite-dimensional integer lattice, and one finite spin dimension q≥1, where q is a positive integer (so q∈N and 1≤q, by The natural numbers N (von Neumann) and Order on the natural numbers). For n∈Z, define ∣n∣=n if 0≤n and ∣n∣=−n if n<0, using the integer order and additive inverse of Order on the integers and Arithmetic on the integers. Totality and compatibility of the integer order with addition (The integers form a totally ordered ring) give 0≤∣n∣ and −∣n∣≤n≤∣n∣. Adding these bounds for m,n∈Z gives ∣m+n∣≤∣m∣+∣n∣. Equip Γ with the max-coordinate metric d∞(x,y)=max⁡1≤r≤d∣xr−yr∣; the maximum exists because the coordinate set is finite and nonempty, symmetry and separation hold coordinatewise, and the absolute-value triangle inequality gives ∣xr−zr∣≤∣xr−yr∣+∣yr−zr∣ for every coordinate, hence the triangle inequality for d∞. A finite region is a finite subset Λ⊆Γ; its cardinality is ∣Λ∣ (The cardinality ∣A∣ of a finite set).

For a finite region Λ, let SΛ={1,…,q}Λ be the set of spin configurations on Λ. Induction on ∣Λ∣ gives ∣SΛ∣=q∣Λ∣: the empty region has one configuration, and for x∈Λ the restriction map s↦(s∣Λ∖{x},s(x)) is a bijection SΛ→SΛ∖{x}×{1,…,q}, so adjoining one site multiplies the number of configurations by q, according to the recursion defining natural-number powers in Exponentiation of natural numbers, mn, and its agreement with the integer power in R. Let HΛ be the vector space of functions f:SΛ→C with inner product ⟨f,g⟩=∑s∈SΛf(s)g(s)‾. For each s∈SΛ, let es be the indicator function of {s}; these vectors form an orthonormal basis. For Λ=∅, SΛ is a singleton and HΛ≅C. The local spin matrix algebra is

AΛ:=B(HΛ)≅Mq∣Λ∣(C),

Here B(HΛ) denotes all complex-linear endomorphisms of the finite-dimensional Hilbert space; they are bounded. The algebra has composition, Hilbert adjoint, identity IΛ, and induced operator norm

∥T∥:=sup⁡∥ξ∥=1∥Tξ∥.

The finite local trace is Tr⁡Λ(T):=∑s∈SΛ⟨Tes,es⟩ in the displayed configuration basis (es). This is the usual finite-matrix trace; basis independence and its cyclic/unitary identities are supplied by Finite matrix spectral and state calculus.

If Λ⊆Λ′, restriction of configurations gives the canonical factorization HΛ′≅HΛ⊗HΛ′∖Λ, with sites ordered lexicographically. The factor inclusion is the unital ∗-homomorphism ιΛ,Λ′:AΛ→AΛ′ given by T↦T⊗IΛ′∖Λ. A localization region for T is any finite Λ for which T∈AΛ under these inclusions; a localization region need not be minimal.

The ordinary operator norm makes each local matrix algebra a nonzero unital complete C*-algebra, and every positive normalized complex-linear functional is uniquely a trace pairing with a density matrix, by Finite matrix C-star algebra and density-state duality. This includes the empty region, whose Hilbert space is C. This definition does not posit an infinite-dimensional tensor-product Hilbert space.

Depends on

Dependency tree · 2 levels

Sources