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 ()) for the countable union of finite regions and the finite-dimensional state/density interface explicitly stated in Facts [F3]. Let , , and be as in Local spin matrix algebras and their factor inclusions. For every sequence of algebraic states on the quasi-local spin algebra , there is a subsequence and an algebraic state such that for every . 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 on .
Countable Choice: every countable family of nonempty sets has a choice function (The Axiom of Countable Choice ()).
is at most countable; its finite powers are at most countable; countable unions of at most countable sets are at most countable under [A1] (Local spin matrix algebras and their factor inclusions, Countability of every finite-dimensional integer lattice, Every finite power of an at most countable set is at most countable, Countable unions of at most countable sets, assuming ).
Every nonempty at most countable set is a surjective image of ; finite powers of are at most countable, and is at most countable (A nonempty set is at most countable iff it is a surjective image of , Every finite power of an at most countable set is at most countable, is countably infinite).
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 for arbitrary complex matrices .
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 , A nonempty set is at most countable iff it is a surjective image of ).
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 ); recursion on defines a sequence from a deterministic rule (The recursion theorem).
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
Given: Countable Choice [A1], facts [F1]–[F6], and the sequence .
For each , let be the set of ranges of all -tuples in , including tuples with repeated entries. Since is at most countable by [F1], a surjection composed with the range map shows 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 -tuple. Thus all finite regions form the countable union , which is at most countable by [F1] and [A1]. For each region , rational real and imaginary matrix entries give a countable subset of : it is a finite Cartesian power of , so [F1]–[F2] apply. These matrices are norm dense: for a error matrix whose entries have modulus at most , Cauchy–Schwarz gives , so . A second countable union, using [A1], therefore gives a countable norm-dense set in , hence in its completion .
By [F2], choose a surjection and enumerate its values as . For each fixed , the scalar sequence is bounded: is local, and the finite-dimensional state/density interface [F3] gives . The same estimate extends each from the dense local algebra to all of , so by normalization.
We specify a deterministic convergent-subsequence rule for any bounded complex sequence . Choose with under . 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 , their closed coordinate intervals are nested and have lengths tending to zero. [F5] gives unique and , so is the unique common point of the squares. The subsequence terms after stage lie in the th square, whose diameter tends to zero, hence converge to . Every choice in this rule is determined by a finite ordering or a least natural index; it uses no additional choice axiom.
Apply the deterministic rule of step 1.3 recursively to the coordinate sequences along nested subsequences for . More precisely, start with ; at stage , write the resulting subsequence as with strictly increasing, so . By [F5] and recursion, these maps are defined for every positive . Put for . For , , so is increasing. For fixed and , nestedness gives where ; hence these are tails of the convergent coordinate subsequence selected at stage , and converges.
For any and , choose with by density. Since each has norm one, The last term tends to zero as by step 2.1. Thus is Cauchy and converges for every local . Define on . For local and , the equalities pass to the limit, and . For every local , . Finally . Thus is a bounded normalized positive functional on .
On each finite region , write for the density of . For each matrix unit , its entries are rational, so ; the trace-pairing formula gives . 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 , , 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.
By [F6], the consistent family of step 4.1 extends to a unique state on , and . For any and , choose local with . Then whose right side is eventually less than by step 3.1. Therefore for every , proving sequential compactness in the pointwise topology.
Depends on
Consistent local densities extend to an algebraic state
Local spin matrix algebras and their factor inclusions
Norm-completed quasi-local quantum spin algebra
Quasi-local algebra completion and locality
Finite matrix spectral and state calculus
The Axiom of Countable Choice ()
Finite, countably infinite, countable, uncountable
A nonempty set is at most countable iff it is a surjective image of
Every finite power of an at most countable set is at most countable
Countable unions of at most countable sets, assuming
is countably infinite
A nested sequence of nonempty closed bounded intervals has nonempty intersection, and the intersection is a single point exactly when the lengths tend to
The recursion theorem
Countability of every finite-dimensional integer lattice
Infinite algebraic state and finite-region restrictions
Finite matrix C-star algebra and density-state duality