Alphabeta Math
TheoremStatement: AI-adaptedProof: 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.

Poisson Reference Counts and Translation Invariance

Statement

Assume AC, fix d≥1 and λ>0, and let Qλ be the configuration law of Poisson Configuration Reference. Define the intensity measure on Borel sets by ΛQλ(A):=EQλNA, where NA=ω(A) and the nonnegative expectation may be infinite. For pairwise disjoint bounded Borel sets A1,…,Ar⊆Rd, the restrictions ω∣A1,…,ω∣Ar are independent, each count NAj has Poisson law with mean λ∣Aj∣, and the joint law of counts on any finite disjoint family is the product of those Poisson laws. In particular, Qλ is invariant under every translation Tx, and ΛQλ(A)=λ∣A∣ for every Borel A. For every bounded Borel A and real a, its count also has the exact exponential moment EQλeaNA=exp⁡ ⁣(λ∣A∣(ea−1)).

Facts & Assumptions

Given: AC, dimension d≥1, λ>0, the cell-product law Qλ, and pairwise disjoint bounded Borel sets Aj.

[A1]

AC is part of the Poisson reference construction and of its countable product existence (The Axiom of Choice, Poisson Configuration Reference).

[F1]

On each unit cell, the count has law e−λλn/n! and, conditional on n, the points are independent uniform points subsequently sorted. Finite cell families are independent (Poisson Configuration Reference).

[F4]

The configuration sigma-algebra is generated by bounded-Borel count maps, finite count cylinders form a generating pi-system, and agreement there determines probability laws (Counts Generate the Sigma-Algebra of Finite Configurations, Dynkin's pi-lambda theorem).

[F5]

The real exponential function and the number e by a power series: the real exponential is its everywhere convergent factorial power series. Monotone convergence for the integral permits expectations of increasing nonnegative partial sums and countable sums.

Proof

Given: The hypotheses and suppliers in Facts & Assumptions.

1.1A1F1F2F3algebra

Fix one unit cell Ci and a finite Borel partition B0,…,Bs of it. Put vj=∣Bj∣, so ∑jvj=1. Conditional on the cell count N=n, the n independent uniform points give category-count probability n!∏jvjnj/∏jnj! for ∑jnj=n. Multiplying by the Poisson count probability e−λλn/n! gives e−λ∏j(λvj)nj/nj!=∏je−λvj(λvj)nj/nj!, by [F3]. This factors into the Poisson probabilities of the disjoint cell pieces, including the complement B0; hence their counts are independent Poisson variables with respective means λvj. Zero-volume pieces have count zero almost surely by the same formula.

2.1A1step 1.1F1construct

Each bounded Aj intersects only finitely many unit cells. Apply step 1.1 to the partition formed by the sets Aj∩Ci and their complement in each such cell. Independence within each cell and independence between cell configurations show that all component counts, indexed by both j and i, are independent Poisson variables.

3.1A1step 2.1F2F3algebra

For fixed j, sum the component counts over its finitely many cells. The sum of independent Poisson variables of means μ1,…,μq has mass at n equal to e−∑μi(∑μi)n/n!: expand (∑iμi)n by [F2], then use the product of the component masses. Thus NAj is Poisson with mean λ∑i∣Aj∩Ci∣=λ∣Aj∣. The groups of components for different j are disjoint independent families, so their sums remain independent.

4.1A1F3F5step 3.1algebra

Put θ=λ∣A∣. The count mass in step 3.1 gives, by nonnegative partial sums and [F5], EQλeaNA=∑n=0∞eane−θθnn!=e−θ∑n=0∞(θea)nn!=exp⁡ ⁣(θ(ea−1)). For θ=0, the count is zero almost surely and both sides are one, so no ambiguous zero power is needed. This establishes the exponential-moment interface before entropy estimates use it.

4.2A1step 3.1F4

Let A1,…,Ar be pairwise disjoint and, for each j, consider a finite count-cylinder event in the restriction to Aj. Refine the finitely many counting sets in each event into their disjoint atoms inside Aj. Step 3.1 gives independent Poisson counts on all these atoms across every j; the event for each restricted configuration is a measurable function only of its own atom counts. Thus finite cylinder events factor across j. The restriction sigma-fields are generated by these cylinders, so repeated pi-lambda extension proves independence of the restrictions themselves.

5.1A1step 3.1F4F5∎

For a finite family of bounded Borel sets A1,…,As, partition their union into the finitely many disjoint Boolean atoms formed by the sets and their complements. Every NAj is a sum of the counts on these atoms. Translation preserves each atom's volume, so step 3.1 gives the same joint distribution of this whole count vector under Qλ and its translate. Thus the laws agree on every finite count cylinder. These cylinders generate the configuration sigma-algebra by [F4], and pi-lambda uniqueness identifies the laws. The one-set count law gives EQλNA=λ∣A∣ for bounded A. For arbitrary Borel A, increase bounded cubes to all space and apply [F5] to the counting measures and Lebesgue measure to obtain the same extended identity. For disjoint Borel An, the pointwise counting identity N∪nAn=∑nNAn and [F5] show countable additivity of ΛQλ, while the empty set has expectation zero. Thus the defined intensity functional is a measure and equals λ times Lebesgue measure.

Depends on

Dependency tree · 2 levels

Sources