Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)
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.

Compactness of Finite-Specific-Entropy Levels in the Local-Tame Topology

Statement

Assume AC, the ultrafilter extension principle, DC, and HB. Let Hc:={P∈Pstat1(Ω):I(P)≤c},c∈[0,∞), where I and the local-tame topology τL are defined by Specific Relative Entropy Density and Local-Tame Topology. Then Hc is compact and sequentially compact in τL. This is a pure measure-theoretic compactness theorem for simple locally finite configurations relative to the independent unit-intensity Poisson reference; it makes no thermodynamic-limit or physical claim.

Facts & Assumptions

Given: AC, the ultrafilter extension principle, DC, HB, dimension d≥1, and a finite c≥0.

[A1]

AC supplies the standard-Borel extension and the choice principles required by the local standard-Borel and Dunford–Pettis suppliers (The Axiom of Choice).

[A2]

The ultrafilter extension principle gives Tychonoff compactness for arbitrary products of compact Hausdorff spaces. Together with DC and HB it supplies the weak Eberlein–Šmulian equivalence: these are all three hypotheses of Eberlein–Šmulian theorem (The ultrafilter extension principle (UL/BPI), The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain, The real dominated-extension principle as an additional hypothesis over ZF).

[F1]

For every integer m≥1, I(P)=sup⁡m≥1m−dD(PΛm∥QΛm) (Specific Relative Entropy Density).

[F2]

Relative entropy is nonnegative, decreases under restriction, and obeys its variational formula (Relative Entropy of Probability Measures, Relative Entropy Variational, Chain, and Conditioning Rules).

[F3]

On a finite measure space, a uniformly integrable family in real L1 is relatively weakly compact, and relative weak compactness is equivalent to relative weak sequential compactness under the named choice hypotheses (Dunford--Pettis for real L1 on a finite measure space, Eberlein–Šmulian theorem).

[F4]

A product of compact Hausdorff spaces is compact under the ultrafilter extension principle, and consistent finite-dimensional laws on standard-Borel coordinate spaces extend to a unique probability law under AC (Assuming the ultrafilter lemma, an arbitrary product of compact Hausdorff spaces is compact, Standard Borel spaces, Assuming the Axiom of Choice, Kolmogorov extension for arbitrary families of standard Borel coordinate spaces).

[F5]

Under Q, a bounded-region count is Poisson and has finite exponential moment EQeaNA=exp⁡(∣A∣(ea−1)) for every a>0 (Poisson Reference Counts and Translation Invariance, Poisson Configuration Reference).

[F6]

A bounded measurable test defines a bounded linear functional on real L1(QW) by integration, using Hölder; it is therefore weakly continuous by the definition of the weak topology. Such tests separate distinct L1 classes (test a nonzero difference against its measurable sign), so the weak topology is Hausdorff (Holder's inequality for integrals, including the endpoint cases, Weak topology on a normed space).

[F7]

Monotone and dominated convergence justify the nonnegative count truncations and the exponential-moment limit used below (Monotone convergence for the integral, Dominated convergence).

Proof

Given: The hypotheses and suppliers in Facts & Assumptions.

1.1A1F1F2construct

Let W=a+[0,m)d be any integer cube, with a∈Zd and integer m≥1. Translation invariance and [F1] give D(PW∥QW)≤c∣W∣. If A is any bounded Borel set, choose one such cube W containing it; by restriction monotonicity [F2], every P∈Hc satisfies D(PA∥QA)≤CA:=c∣W∣.

1.2F1F2algebra

For any probability density h relative to a probability Q with D(hQ∥Q)≤C, and any K>1, ∫{h>K}h dQ≤C+1/elog⁡K. Indeed, −ulog⁡u≤1/e on [0,1], while hlog⁡h≥hlog⁡K on {h>K}. Split the entropy integral at h=1 and combine these bounds. Thus, for each fixed cube W, the densities dPW/dQW with P∈Hc have L1(QW) norm one and are uniformly integrable.

2.1A1F2F3F6step 1.2

Fix W. By [F3], the weak closure KW of these densities in real L1(QW) is weakly compact. It is Hausdorff by [F6]. Every h∈KW remains nonnegative and has integral one: testing against each indicator and against 1 gives weakly closed conditions by [F6]. Also D(hQW∥QW)≤c∣W∣, because [F2] expresses D as the supremum of weakly continuous affine functions of h, with continuity given by [F6]. Hence all entropy sublevels used below are closed in their local weak topologies.

3.1A2F6step 2.1construct

Index all integer cubes W=a+[0,m)d with a∈Zd and integer m≥1 by their countable set of pairs (a,m), and form the product K∗:=∏WKW. It is compact by [A2] and Hausdorff because each weak L1 topology is Hausdorff by [F6]. Impose the following closed conditions on its tuples: whenever W⊆V, the W-marginal of hVQV equals hWQW; and, for every real translation x and bounded local measurable test f, the two marginals containing the supports of f and f∘Tx satisfy EPf=EP(f∘Tx). Each equality is closed because it tests weak convergence against bounded measurable functions on a containing cube, which are continuous by [F6]. The intersection Kstat of these closed conditions is compact.

4.1A1F4step 2.1step 3.1construct

A tuple in Kstat defines consistent finite-dimensional laws on the countable standard-Borel cell spaces: for a finite set of cells, choose any integer cube containing it and take that marginal. If two cubes contain the same finite set, a larger integer cube contains both; the imposed nested consistency makes their induced laws agree. By [F4] there is a unique law P on Ω with those marginals. The imposed equalities make P stationary. For each integer cube W, consistency identifies PW=hWQW for its coordinate hW∈KW, so step 2.1 gives D(PW∥QW)≤c∣W∣. In particular, these local entropy bounds hold for every law constructed from Kstat before its finite intensity has been established.

5.1A1F2F5F7step 2.1step 4.1algebra

The same variational inequality controls particle-count tails uniformly on the whole family of laws constructed from Kstat. Fix bounded A and an integer cube W⊇A. For every such law P, its W marginal is hWQW with hW∈KW, so step 2.1 gives D(PW∥QW)≤CA:=c∣W∣. Let K≥0, a>0, and M∈N. The bounded local test ϕM=amin⁡(NA1{NA>K},M) in [F2] gives aEPmin⁡(NA1{NA>K},M)≤CA+log⁡EQexp⁡(ϕM). As M→∞, monotone convergence yields aEP[NA1{NA>K}]≤CA+log⁡EQeaNA1{NA>K}. By [F5] and dominated convergence the logarithmic term tends to zero as K→∞. First choose a large and then K large; this proves uniform integrability of the counts NA over all laws constructed from Kstat. Taking A=C0 gives finite cell intensity for each such P. Since step 4.1 gives stationarity, P∈Pstat1(Ω); its origin-anchored cube bounds from step 4.1 and [F1] now give I(P)≤c.

6.1F6step 3.1step 4.1step 5.1

The product compactness in step 3.1 first gives compactness for all bounded local tests. For any tame f supported in A with ∣f∣≤b(1+NA), set fK=f1{NA≤K}. Then fK is bounded and local, and its expectation is weakly continuous by [F6], while sup⁡P∈Hc∣EP(f−fK)∣≤bsup⁡P∈HcEP[(1+NA)1{NA>K}]⟶0 by step 5.1. Thus on the entropy level the tame expectation maps are uniform limits of bounded-local continuous maps. Every P∈Hc supplies its cube densities and gives a tuple in Kstat, so the extension map from Kstat is onto; the local expectations just shown make it continuous. Its image Hc is compact in τL.

7.1A1A2F3step 3.1step 4.1step 5.1step 6.1∎

Each KW is weakly compact in real L1(QW) and hence weakly sequentially compact by [F3]. Given a sequence in Kstat, successively take subsequences converging in the first, second, and later cube coordinates and diagonalize; AC supplies the countable choices. The limit tuple preserves all closed consistency, stationarity, and entropy constraints from step 3.1, so steps 4.1–5.1 give a law in Hc. Count-tail uniformity from step 5.1 upgrades coordinate convergence on bounded local tests to convergence for every tame test by the same truncation estimate in step 6.1. Hence Hc is sequentially compact in τL.

Depends on

Dependency tree · 2 levels

Sources