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 , let , with this class defined in Local-Tame Topology, be ergodic under the full translation group , and suppose its specific relative entropy relative to the unit-intensity Poisson law is finite. Ergodic means that every measurable event invariant modulo -null sets under each translation has probability or . For an integer , let , and let , which exists because . Then Without the full-translation ergodicity hypothesis the proof yields an invariant limit of mean ; it need not be constant.
Facts & Assumptions
Given: AC, a stationary finite-intensity law , finite specific relative entropy , and ergodicity under every real translation.
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).
For , every bounded restriction has finite relative entropy when , the cube entropy ratio converges to , and the cube ratios are bounded above by (Local-Tame Topology, Specific Relative Entropy Density).
The conditional density of a unit cell given its finite past has logarithm with directed limit , where is a density relative to and (Conditional Log-Density Convergence for the Poisson Reference).
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 is a conditional density relative to a probability reference , then , because for (Poisson Reference Counts and Translation Invariance, Relative Entropy Variational, Chain, and Conditioning Rules).
For each measure-preserving transformation, the Cesàro averages on complex converge in norm to the orthogonal projection onto its invariant subspace (Von Neumann mean ergodic theorem in L2).
On a probability space convergence implies convergence by Hölder, and dominated convergence passes integrable truncations to the limit (Holder's inequality for integrals, including the endpoint cases, Dominated convergence).
Under , disjoint bounded Borel counts are independent Poisson variables with means , 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).
The variational formula expresses relative entropy as a supremum of functions affine in the first probability law (Relative Entropy Variational, Chain, and Conditioning Rules).
Proof
Given: The hypotheses and suppliers in Facts & Assumptions.
Let be the cell indices in . For , set ; this is a finite subset of the past of the reference cell. Repeated conditional-density factorization from [F3] gives, -almost surely, Every finite factor is defined -almost surely because the corresponding local relative entropy is finite by [F1].
Fix . By the directed convergence in [F2], choose a finite past such that every finite satisfies . Put , with if . Let consist of cells at least cells from each face of . If , then , so by stationarity . The boundary has cells (for ). For every finite past , and , hence . For , on its reference probability , so [F2] gives as well. Summing the interior errors and bounding each boundary error by yields since was arbitrary.
For , the shift is a linear isometry on complex by stationarity. Apply [F4] to , obtaining strong convergence to the orthogonal projection onto the -invariant subspace. The coordinate shifts commute, so every average for coordinate commutes with every average for coordinate ; taking strong limits shows that the 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 averages to . This product is the orthogonal projection onto the intersection of the coordinate-invariant subspaces, because the are commuting orthogonal projections. The product averages are exactly the rectangular cube averages , so these converge in for bounded to a function invariant under every integer shift.
Since , dominated convergence gives . Cube averages are contractions, so the averages of are Cauchy in : for large their distance from the convergent averages of is at most . Let their limit be . Every cube average has mean , hence . For each coordinate shift , the averaging index cube and its translate have symmetric difference of exactly indices, so . Passing to the limit gives . These generators imply invariance under every integer translation.
Fix , put , , and . For , contains a cube of side . By [F1] and restriction monotonicity, and ; the latter divided by tends to . Therefore . The conditional chain rule [F3] identifies with a conditional log density. Its mean is this entropy difference, and [F3] bounds its negative-part expectation by ; thus its norm is at most the entropy difference plus . The same bound applies to . Translation covariance gives ; thus the normalized information in and have the same limit. Since , it follows that -almost surely for this .
Step 5.1 applies to every fixed . For each rational , the event is therefore invariant modulo null sets under every translation. Full-translation ergodicity makes each such event have probability or . If were not almost surely constant, some rational sublevel set would have probability strictly between and ; hence is constant. Its mean from step 4.1 is , so . Combining with step 2.1 proves the asserted limit.
To see that the invariant limit need not be constant, fix with and put . It is stationary and has finite cell intensity by [F6]. Let . Since is the union of unit cells, the common conditional position laws and independent cell configurations in [F6] give Thus , where ; the expectation uses . By [F8], for , : the integrand is positive for , negative for , and the orientation reverses in the latter case. Applying this at gives . By [F7], relative entropy is convex in its first argument, so . The specific-entropy formula [F1] therefore gives , and steps 1.1–5.1 yield an invariant limit . Under , put and . Its Poisson mass formula gives , hence . For , the pointwise bound yields . Consequently in -probability. For every real , so in -probability and in -probability: by , and for . Since and , convergence in -probability to also holds under each component. Uniqueness of limits in probability forces -almost surely and -almost surely. These distinct values on positive-weight components show that is not constant -almost surely.
Depends on
The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t
The Axiom of Choice
Poisson Configuration Reference
Poisson Reference Counts and Translation Invariance
Relative Entropy of Probability Measures
Relative Entropy Variational, Chain, and Conditioning Rules
Specific Relative Entropy Density
Conditional Log-Density Convergence for the Poisson Reference
Von Neumann mean ergodic theorem in L2
Dominated convergence
Holder's inequality for integrals, including the endpoint cases
Local-Tame Topology