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

Sequential compactness of the quasi-local spin state space

Statement

Assume Countable Choice (The Axiom of Countable Choice (ACω)) for the countable union of finite regions and the finite-dimensional state/density interface explicitly stated in Facts [F3]. Let Γ=Zd, d≥1, and q≥1 be as in Local spin matrix algebras and their factor inclusions. For every sequence of algebraic states ωn on the quasi-local spin algebra A, there is a subsequence ωnk and an algebraic state ω such that ωnk(A)→ω(A) for every A∈A. Thus the state space is sequentially compact in the pointwise topology, meaning convergence on every fixed observable. The conclusion concerns functional values; it does not assert convergence of global density matrices or a global trace-class representation.

Facts & Assumptions

Given: Countable Choice, the finite local algebras and norm completion of Local spin matrix algebras and their factor inclusions and Norm-completed quasi-local quantum spin algebra, and a sequence of algebraic states ωn on A.

[A1]

Countable Choice: every countable family of nonempty sets has a choice function (The Axiom of Countable Choice (ACω)).

[F1]
[F2]

Every nonempty at most countable set is a surjective image of N; finite powers of Q are at most countable, and Q is at most countable (A nonempty set is at most countable iff it is a surjective image of N, Every finite power of an at most countable set is at most countable, Q is countably infinite).

[F3]

Finite matrix C-star algebra and density-state duality gives every positive normalized functional on a finite local algebra a unique positive trace-one density matrix and norm one; in particular ∣ω(A)∣≤∥A∥ for arbitrary complex matrices A.

[F4]

Countable Choice is the exact hypothesis of the countable-union result used in [F1]; the other countability and enumeration results in [F1]–[F2] are choice-free (Countable unions of at most countable sets, assuming ACω, A nonempty set is at most countable iff it is a surjective image of N).

[F5]

Nested closed real intervals with lengths tending to zero have a unique common point (A nested sequence of nonempty closed bounded intervals has nonempty intersection, and the intersection is a single point exactly when the lengths tend to 0); recursion on N defines a sequence from a deterministic rule (The recursion theorem).

[F6]

A state is a normalized positive functional, its finite restrictions are consistent, and a consistent family of local densities extends uniquely to a state on the norm completion (Infinite algebraic state and finite-region restrictions, Consistent local densities extend to an algebraic state).

Proof

technique · direct

Given: Countable Choice [A1], facts [F1]–[F6], and the sequence ωn.

1.1A1F1F2construct

For each m∈N, let Rm be the set of ranges of all m-tuples in Γm, including tuples with repeated entries. Since Γm is at most countable by [F1], a surjection N→Γm composed with the range map shows Rm is at most countable by [F2]. Every finite region is the range of a tuple of its cardinality, with the empty region the range of the unique 0-tuple. Thus all finite regions form the countable union ⋃mRm, which is at most countable by [F1] and [A1]. For each region Λ, rational real and imaginary matrix entries give a countable subset of AΛ: it is a finite Cartesian power of Q, so [F1]–[F2] apply. These matrices are norm dense: for a DΛ×DΛ error matrix E whose entries have modulus at most δ, Cauchy–Schwarz gives ∥Ev∥22≤∑i,j∣Eij∣2∥v∥22≤DΛ2δ2∥v∥22, so ∥E∥op≤DΛδ. A second countable union, using [A1], therefore gives a countable norm-dense set D in Aloc, hence in its completion A.

1.2givenF2F3

By [F2], choose a surjection s:N→D and enumerate its values as D1,D2,…. For each fixed j≥1, the scalar sequence zn(j):=ωn(Dj) is bounded: Dj is local, and the finite-dimensional state/density interface [F3] gives ∣ωn(Dj)∣≤∥Dj∥. The same estimate extends each ωn from the dense local algebra to all of A, so ∥ωn∥=1 by normalization.

1.3givenF5construct

We specify a deterministic convergent-subsequence rule for any bounded complex sequence zn. Choose M>0 with zn∈[−M,M]2 under C≅R2. Subdivide the current closed square into its four closed equal subsquares in fixed lexicographic order; at least one contains infinitely many terms, and the rule takes the first such square. At the first stage choose the least index whose term lies in that square; at every later stage choose the least index exceeding the previous one whose term lies in the selected square. Writing the nested squares as Ij×Jj, their closed coordinate intervals are nested and have lengths tending to zero. [F5] gives unique x∈⋂jIj and y∈⋂jJj, so (x,y) is the unique common point of the squares. The subsequence terms after stage j lie in the jth square, whose diameter tends to zero, hence converge to (x,y). Every choice in this rule is determined by a finite ordering or a least natural index; it uses no additional choice axiom.

2.1step 1.3F4F5construct

Apply the deterministic rule of step 1.3 recursively to the coordinate sequences zn(j) along nested subsequences for j≥1. More precisely, start with i0(n)=n; at stage j, write the resulting subsequence as ij(n)=ij−1(sj(n)) with sj strictly increasing, so sj(j)≥j. By [F5] and recursion, these maps are defined for every positive j. Put rj=ij(j) for j≥1. For j≥2, rj=ij−1(sj(j))≥ij−1(j)>ij−1(j−1)=rj−1, so (rj)j≥1 is increasing. For fixed m≥1 and j≥m, nestedness gives rj=im(tm,j) where tm,j≥j; hence these are tails of the convergent coordinate subsequence selected at stage m, and ωrj(Dm) converges.

3.1step 2.1F3algebra

For any A∈Aloc and ε>0, choose Dm with ∥A−Dm∥<ε/4 by density. Since each ωrj has norm one, ∣ωrj(A)−ωrk(A)∣≤2∥A−Dm∥+∣ωrj(Dm)−ωrk(Dm)∣. The last term tends to zero as j,k→∞ by step 2.1. Thus ωrj(A) is Cauchy and converges for every local A. Define ω0(A):=lim⁡jωrj(A) on Aloc. For local A,B and λ∈C, the equalities ωrj(A+λB)=ωrj(A)+λωrj(B) pass to the limit, and ω0(I)=1. For every local X, ω0(X∗X)=lim⁡jωrj(X∗X)≥0. Finally ∣ω0(A)∣=lim⁡j∣ωrj(A)∣≤∥A∥. Thus ω0 is a bounded normalized positive functional on Aloc.

4.1F3step 2.1step 3.1

On each finite region Λ, write ρΛ(j) for the density of ωrj∣AΛ. For each matrix unit Eab, its entries are rational, so Eba∈D; the trace-pairing formula gives (ρΛ(j))ab=ωrj(Eba). Thus every matrix coefficient converges by step 2.1. The entrywise limit ρΛ is Hermitian and trace one because these are finite linear equalities; for every vector v, ⟨ρΛv,v⟩=lim⁡j⟨ρΛ(j)v,v⟩≥0, so it is positive. Every partial-trace consistency equation is a finite linear equation in these entries and therefore passes to the limit. Hence {ρΛ} is a consistent family.

5.1F1F6step 3.1step 4.1∎

By [F6], the consistent family of step 4.1 extends to a unique state ω on A, and ω∣Aloc=ω0. For any A∈A and ε>0, choose local B with ∥A−B∥<ε/4. Then ∣ωrj(A)−ω(A)∣≤2∥A−B∥+∣ωrj(B)−ω(B)∣, whose right side is eventually less than ε by step 3.1. Therefore ωrj(A)→ω(A) for every A∈A, proving sequential compactness in the pointwise topology.

Depends on

Dependency tree · 2 levels

Sources