Alphabeta Math
LemmaStatement: 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.

Conditional Log-Density Convergence for the Poisson Reference

Statement

Assume AC. Let P∈Pstat1(Ω), as defined in Local-Tame Topology, have finite specific relative entropy I(P)=γ<∞ relative to the unit-intensity reference Q of Poisson Configuration Reference. Let C=[0,1)d be the reference cell and order the other unit cells lexicographically; F+ is the set of cells preceding C. For each finite A⊂F+ let kA be the conditional density of the configuration in C given the configuration in A, relative to QC, as supplied by Conditional density formula. Then g(A):=EP[log⁡kA]=D(PA∪C∥QA∪C)−D(PA∥QA) is finite, nonnegative, and increasing with finite A, with sup⁡{g(A):A⊂F+ finite}=γ. For any increasing finite exhaustion Am↑F+, the densities kAm converge in L1(PF+⊗QC) to a density k∞ of PF+∪C relative to PF+⊗QC, and log⁡kAm⟶log⁡k∞in L1(P). The logarithmic convergence is directed: for every ε>0 some finite Am satisfies sup⁡B⊇Am, B⊂F+ finiteEP∣log⁡kB−log⁡k∞∣<ε.

Facts & Assumptions

Given: AC, dimension d≥1, a stationary law P with I(P)=γ<∞, the cell partition and its lexicographic order.

[A1]

AC is inherited from the Poisson reference construction and used by the conditional density and uniformly integrable martingale suppliers (The Axiom of Choice, Poisson Configuration Reference, Conditional density formula, Uniformly integrable martingale convergence).

[F1]

For P∈Pstat1(Ω), finite specific entropy implies every bounded-region restriction has finite relative entropy; its normalized cube entropies converge to γ (Local-Tame Topology, Specific Relative Entropy Density).

[F2]

Independent Poisson reference increments, the conditional entropy chain rule, its variational form, and monotonicity under added conditioning (Poisson Reference Counts and Translation Invariance, Relative Entropy Variational, Chain, and Conditioning Rules).

[F3]

A nonnegative uniformly integrable martingale converges almost surely and in L1 (Uniformly integrable martingale convergence).

[F4]

On a probability space, uniform integrability plus convergence in probability implies L1 convergence (Uniform integrability plus convergence in probability implies L1 convergence).

[F5]

Monotone convergence and Fatou apply to the nonnegative truncations and entropy densities used below (Monotone convergence for the integral, Fatou's lemma).

[F6]

Agreement of finite measures on a generating pi-system implies agreement on the generated sigma-algebra (Dynkin's pi-lambda theorem).

Proof

Given: The hypotheses and suppliers in Facts & Assumptions.

1.1A1F1F2construct

Let A⊂F+ be finite. By [F1], D(PA∪C∥QA∪C) is finite, so the joint density hA,C relative to QA⊗QC exists. The marginal density hA is its QC integral. On 0<hA<∞, [F2] gives the conditional density kA=hA,C/hA relative to QC; the exceptional fibers have PA-measure zero. The chain rule in [F2] gives g(A)=EPD(PC∣A∥QC)=D(PA∪C∥QA∪C)−D(PA∥QA), so g(A) is finite and nonnegative.

2.1F2step 1.1

If A⊆B⊂F+ are finite, apply the conditional-increment monotonicity in [F2] to observation of the cell configuration on A and then on B. It yields g(A)≤g(B).

3.1A1F1F2step 1.1step 2.1construct

To identify the supremum, let ΛN=[0,N)d, the union of Nd unit cells, and order those cells lexicographically. Repeated use of the conditional chain rule decomposes D(PΛN∥QΛN) as the sum of g(Bi) over its cells i, where Bi is the finite set of earlier cells in ΛN. Each Bi is a finite subset of F+ after translating cell i to C, so g(Bi)≤sup⁡Ag(A) by stationarity and step 2.1. Hence D(PΛN∥QΛN)/Nd≤sup⁡Ag(A). Conversely, fix finite A⊂F+. For every cell i in the inner cube whose distance from the boundary exceeds the largest coordinate magnitude in A, the translated set i+A lies in Bi. By step 2.1 and stationarity, g(Bi)≥g(A). The proportion of these interior cells tends to one, and all other increments are nonnegative by step 1.1. Taking N→∞ and applying [F1] gives γ≥g(A). Taking the supremum over A proves sup⁡Ag(A)=γ.

4.1A1F3F5step 3.1algebra

Choose an increasing sequence of finite pasts Am exhausting F+ and set R=PF+⊗QC. Lift each kAm to the common space (ΩF+×EC,R). Consistency of the conditional densities shows ER[kAm+1∣Gm]=kAm, where Gm is generated by Am and C; also ERkAm=1. By step 3.1, ER[kAmlog⁡kAm]=g(Am)≤γ. For K>1, splitting at kAm=1 and using −ulog⁡u≤1/e gives ∫{kAm>K}kAm dR≤γ+1/elog⁡K. Thus these martingale densities are uniformly integrable. By [F3] they converge almost surely and in L1(R) to k∞≥0 with ERk∞=1.

5.1A1F2F5F6step 3.1step 4.1

For any finite-past cylinder event and any event in C, integrate k∞ over their product. L1(R) convergence makes this equal the limit of the same integral against kAm, which is the corresponding joint probability under P. These rectangles form a generating pi-system, so [F6] identifies k∞R with PF+∪C. Therefore kA=ER[k∞∣GA] for every finite A⊂F+. Fatou applied to ulog⁡u+1/e≥0 gives D(PF+∪C∥PF+⊗QC)≤lim inf⁡mg(Am)=γ. Conversely, its variational supremum contains all finite-past tests, so step 3.1 gives the reverse inequality. Hence EPlog⁡k∞=γ.

6.1A1F4step 4.1step 5.1algebra

The L1(R) convergence of kAm implies convergence in R-probability. Since the full joint law has density k∞ relative to R, absolute continuity transfers this to convergence in P-probability. Also k∞>0 P-almost surely, so continuity of log⁡ on (0,∞) gives log⁡kAm→log⁡k∞ in P-probability. For t≥1, EP ⁣[(−log⁡kA)+1{(−log⁡kA)+>t}]=∫{0<kA<e−t}kA(−log⁡kA) dR≤te−t. Thus the negative parts are uniformly integrable; [F4] gives their L1(P) convergence.

7.1A1F4F5step 6.1algebra

Since EPlog⁡kAm=g(Am)→γ=EPlog⁡k∞ and the negative parts converge in L1, the expectations of the positive parts converge as well. These positive parts converge in probability. For nonnegative variables Ym→Y in probability with EYm→EY<∞, bounded truncations satisfy E(Ym∧K)→E(Y∧K): for any η>0 the difference is at most η+K P(∣Ym−Y∣>η). Consequently E(Ym−K)+→E(Y−K)+; choosing K large and then bounding Ym1Ym>2K≤2(Ym−K)+ proves uniform integrability, including the finite initial segment. Applying [F4] gives L1 convergence of the positive parts. Together with the negative parts this proves log⁡kAm→log⁡k∞ in L1(P).

8.1A1F2F4step 2.1step 3.1step 5.1step 6.1step 7.1∎

For any finite B⊇Am, the tower property gives kB=ER[k∞∣GB] and kAm=ER[k∞∣Gm]. Conditional expectation is an L1 contraction, so sup⁡B⊇Am∥kB−k∞∥L1(R)≤2∥kAm−k∞∥L1(R)⟶0. Absolute continuity of P=k∞R transfers this uniform probability convergence to P. The negative-part tail bound in step 6.1 is uniform over all finite B, while g(Am)≤g(B)≤γ by steps 2.1–3.1. The truncation argument in step 7.1 therefore applies to every sequence Bm⊇Am with m→∞; if the asserted directed L1 convergence were not uniform, choosing a contradicting sequence Bm would violate that argument. This proves the directed form.

Depends on

Dependency tree · 2 levels

Sources