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.

Spatial Mean-Information Theorem

Statement

Assume AC. Let d≥1, let P∈Pstat1(Ω), with this class defined in Local-Tame Topology, be ergodic under the full translation group Rd, and suppose its specific relative entropy I(P)=γ relative to the unit-intensity Poisson law Q is finite. Ergodic means that every measurable event invariant modulo P-null sets under each translation has probability 0 or 1. For an integer N≥1, let ΛN=[0,N)d, and let hN=dPΛN/dQΛN, which exists because D(PΛN∥QΛN)<∞. Then 1Ndlog⁡hN⟶γin L1(P). Without the full-translation ergodicity hypothesis the proof yields an invariant L1(P) limit of mean γ; it need not be constant.

Facts & Assumptions

Given: AC, a stationary finite-intensity law P, finite specific relative entropy γ, and ergodicity under every real translation.

[A1]

AC is used by the conditional-density convergence and Hilbert-space mean-ergodic suppliers (The Axiom of Choice, Conditional Log-Density Convergence for the Poisson Reference, Von Neumann mean ergodic theorem in L2).

[F1]

For P∈Pstat1(Ω), every bounded restriction has finite relative entropy when I(P)<∞, the cube entropy ratio converges to γ, and the cube ratios are bounded above by γ (Local-Tame Topology, Specific Relative Entropy Density).

[F2]

The conditional density of a unit cell given its finite past has logarithm with directed L1 limit Z=log⁡k∞, where k∞ is a density relative to R0:=PF+⊗QC and EPZ=γ (Conditional Log-Density Convergence for the Poisson Reference).

[F3]

Finite-region densities factor into successive conditional densities relative to the independent Poisson restrictions; the chain rule identifies the expectation of each conditional log density with its conditional relative entropy. If k is a conditional density relative to a probability reference R, then EP(−log⁡k)+=∫0<k<1k(−log⁡k) dR≤1/e, because u(−log⁡u)≤1/e for 0<u<1 (Poisson Reference Counts and Translation Invariance, Relative Entropy Variational, Chain, and Conditioning Rules).

[F4]

For each measure-preserving transformation, the Cesàro averages on complex L2 converge in norm to the orthogonal projection onto its invariant subspace (Von Neumann mean ergodic theorem in L2).

[F5]

On a probability space L2 convergence implies L1 convergence by Hölder, and dominated convergence passes integrable truncations to the limit (Holder's inequality for integrals, including the endpoint cases, Dominated convergence).

[F6]

Under Qλ, disjoint bounded Borel counts are independent Poisson variables with means λ∣A∣, Qλ is translation invariant, and conditional on the count in a unit cell the point configuration has a law independent of λ (Poisson Configuration Reference, Poisson Reference Counts and Translation Invariance).

[F7]

The variational formula expresses relative entropy as a supremum of functions affine in the first probability law (Relative Entropy Variational, Chain, and Conditioning Rules).

[F8]

For every x>0, log⁡x=∫1xdt/t (The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t).

Proof

Given: The hypotheses and suppliers in Facts & Assumptions.

1.1A1F1F2F3construct

Let SN={0,…,N−1}d be the cell indices in ΛN. For i∈SN, set Ai,N={j−i:j∈SN, j<lexi}; this is a finite subset of the past of the reference cell. Repeated conditional-density factorization from [F3] gives, P-almost surely, log⁡hN(ω)=∑i∈SNlog⁡kAi,N(T−iω). Every finite factor is defined P-almost surely because the corresponding local relative entropy is finite by [F1].

2.1A1F1F2step 1.1algebra

Fix ε>0. By the directed convergence in [F2], choose a finite past A∗ such that every finite B⊇A∗ satisfies EP∣log⁡kB−Z∣<ε. Put R=max⁡{∣aj∣:a∈A∗,1≤j≤d}, with R=0 if A∗=∅. Let SN∘ consist of cells at least R cells from each face of SN. If i∈SN∘, then A∗⊆Ai,N, so by stationarity EP∣log⁡kAi,N(T−iω)−Z(T−iω)∣<ε. The boundary has Nd−(N−2R)d=o(Nd) cells (for N>2R). For every finite past B, EPlog⁡kB=g(B)≤γ and EP(−log⁡kB)+≤1/e, hence EP∣log⁡kB∣≤γ+2/e. For Z=log⁡k∞, EP(−log⁡k∞)+=∫0<k∞<1k∞(−log⁡k∞) dR0≤1/e on its reference probability R0=PF+⊗QC, so [F2] gives EP∣Z∣≤γ+2/e as well. Summing the interior errors and bounding each boundary error by 2(γ+2/e) yields ∥N−dlog⁡hN−N−d∑i∈SNZ(T−i⋅)∥L1(P)⟶0, since ε was arbitrary.

3.1A1F4step 2.1algebra

For j=1,…,d, the shift Ujf=f∘T−ej is a linear isometry on complex L2(P) by stationarity. Apply [F4] to N−1∑n=0N−1Ujn, obtaining strong convergence to the orthogonal projection Pj onto the Uj-invariant subspace. The coordinate shifts commute, so every average for coordinate j commutes with every average for coordinate k; taking strong limits shows that the Pj commute with each other and with the other coordinate averages. Since all these operators have norm at most one, a finite telescoping estimate gives strong convergence of the product of the d averages to P1⋯Pd. This product is the orthogonal projection onto the intersection of the coordinate-invariant subspaces, because the Pj are commuting orthogonal projections. The product averages are exactly the rectangular cube averages N−d∑i∈SNZM(T−i⋅), so these converge in L2 for bounded ZM to a function invariant under every integer shift.

4.1A1F2F5step 3.1construct

Since Z∈L1(P), dominated convergence gives ∥Z−ZM∥1→0. Cube averages are L1 contractions, so the averages of Z are Cauchy in L1: for large M their distance from the convergent averages of ZM is at most ∥Z−ZM∥1. Let their L1 limit be s. Every cube average has mean EPZ=γ, hence EPs=γ. For each coordinate shift ej, the averaging index cube and its translate have symmetric difference of exactly 2Nd−1 indices, so ∥UjANZ−ANZ∥1≤2∥Z∥1/N. Passing to the L1 limit gives Ujs=s. These generators imply invariance under every integer translation.

5.1A1F1F3step 4.1construct

Fix r∈Rd, put G=ΛN, G′=G+r, and B=G∩G′. For N>2∥r∥∞, B contains a cube J of side N−2∥r∥∞. By [F1] and restriction monotonicity, D(PG∥QG)≤γNd and D(PB∥QB)≥D(PJ∥QJ); the latter divided by Nd tends to γ. Therefore N−d(D(PG∥QG)−D(PB∥QB))→0. The conditional chain rule [F3] identifies log⁡hG−log⁡hB with a conditional log density. Its mean is this entropy difference, and [F3] bounds its negative-part expectation by 1/e; thus its L1(P) norm is at most the entropy difference plus 2/e. The same bound applies to G′. Translation covariance gives log⁡hG′=(log⁡hG)∘T−r; thus the normalized information in G and G′ have the same L1 limit. Since N−dlog⁡hG→s, it follows that s∘T−r=s P-almost surely for this r.

6.1A1step 2.1step 4.1step 5.1

Step 5.1 applies to every fixed r∈Rd. For each rational q, the event {s≤q} is therefore invariant modulo null sets under every translation. Full-translation ergodicity makes each such event have probability 0 or 1. If s were not almost surely constant, some rational sublevel set would have probability strictly between 0 and 1; hence s is constant. Its mean from step 4.1 is γ, so s=γ. Combining with step 2.1 proves the asserted L1(P) limit.

7.1A1F1F6F7F8step 4.1step 5.1algebra∎

To see that the invariant limit need not be constant, fix z>0 with z≠1 and put P∗=(Q+Qz)/2. It is stationary and has finite cell intensity by [F6]. Let V=Nd. Since ΛN is the union of V unit cells, the common conditional position laws and independent cell configurations in [F6] give rN:=d(Qz)ΛNdQΛN=e(1−z)VzNΛN,hN∗:=d(P∗)ΛNdQΛN=1+rN2. Thus D((Qz)ΛN∥QΛN)=EQzlog⁡rN=Vcz, where cz:=1−z+zlog⁡z; the expectation uses EQzNΛN=zV. By [F8], x−1−log⁡x=∫1x(1−1/t) dt>0 for x>0, x≠1: the integrand is positive for t>1, negative for t<1, and the orientation reverses in the latter case. Applying this at x=1/z gives cz=z(1/z−1−log⁡(1/z))>0. By [F7], relative entropy is convex in its first argument, so D((P∗)ΛN∥QΛN)≤Vcz/2. The specific-entropy formula [F1] therefore gives I(P∗)≤cz/2<∞, and steps 1.1–5.1 yield an invariant limit s∗∈L1(P∗). Under Qλ, put K=NΛN and θ=λV. Its Poisson mass formula gives E[K(K−1)]=e−θθ2∑n≥2θn−2/(n−2)!=θ2, hence E[(K−θ)2]=θ. For ε>0, the pointwise bound ε2V21{∣K−θ∣>εV}≤(K−θ)2 yields Qλ(∣K/V−λ∣>ε)≤λ/(ε2V)→0. Consequently V−1log⁡rN→1−z+λlog⁡z in Qλ-probability. For every real u, 0≤V−1log⁡(1+eVu)−max⁡{0,u}≤log⁡2V, so V−1log⁡hN∗→0 in Q-probability and V−1log⁡hN∗→cz in Qz-probability: 1−z+log⁡z<0 by log⁡z<z−1, and cz>0 for z≠1. Since P∗≥Q/2 and P∗≥Qz/2, convergence in P∗-probability to s∗ also holds under each component. Uniqueness of limits in probability forces s∗=0 Q-almost surely and s∗=cz Qz-almost surely. These distinct values on positive-weight components show that s∗ is not constant P∗-almost surely.

Depends on

Dependency tree · 2 levels

Sources