Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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 Configuration Reference

Definition

Assume the Axiom of Choice and fix an integer dimension d≥1. For i∈Zd, let Ci=i+[0,1)d. These are left-closed, right-open cells. For every x∈Rd, Integer part: for every real x there is exactly one integer m with m≤x<m+1 supplies the unique integers ij with ij≤xj<ij+1, so x belongs to exactly one Ci. The cells are Borel products of closed/open ray intersections and have volume one by A box in Rn with parameters ai≤bi is Lebesgue measurable of measure ∏i<n(bi−ai), whichever of its faces are included, whose statement covers this face convention. A finite configuration in Ci is a finite subset of distinct points. Encode it by its cardinality n∈N0 and its uniquely lexicographically increasing list of local coordinates (x1−i,…,xn−i)∈([0,1)d)n. Pad the code after its first n coordinates with the zero vector. For fixed n, the strictly increasing lists form a Borel subset of ([0,1]d)n, since lexicographic strict order is a finite union of coordinate-equality and coordinate-inequality conditions. Thus all codes form a Borel subset of N0×([0,1]d)N. Each factor [0,1]d is Polish as a closed subspace of complete Rd with a countable dense rational grid; N0 with its discrete metric is Polish. The ambient space is Polish by Under the Axiom of Countable Choice, countable products and Gδ subspaces of Polish spaces are Polish (and is completely metrized by The standard weighted metric on a countable product of bounded complete metric spaces is complete), so Borel subspaces admit polish presentations makes the cell space Ei standard Borel. By Counts Generate the Sigma-Algebra of Finite Configurations, its sigma-algebra is generated by the counts NB for Borel B⊆Ci.

Use et:=exp⁡(t) for real t, with exp⁡ defined by The real exponential function and the number e by a power series; for a real measurable function f, ef means the pointwise composition exp⁡∘f. For λ>0, give a cell configuration with n points probability exp⁡(−λ)λn/n! for its count. The probabilities sum to exp⁡(−λ)exp⁡(λ)=exp⁡(0)=1 by the exponential power series and The exponential addition formula exp⁡(x+y)=exp⁡(x)exp⁡(y). Conditional on count n, take the n-fold product of normalized Lebesgue measure on Ci, restrict it to the complement of the collision diagonals, and push it forward by lexicographic sorting. The product exists by the finite product-measure theorem; each collision diagonal is null by Tonelli and the fact that Lebesgue measure gives every singleton measure zero, so the restricted measure still has mass one. Sorting is Borel on the finitely many permutation regions of the no-collision set. This defines a law πi,λ on Ei; for n=0, use the empty product and the empty configuration. Let Ω=∏i∈ZdEi with its product cylinder sigma-algebra. The product sigma-algebra is generated by the cell-coordinate sigma-algebras, each generated by counts on Borel subsets of its bounded cell by Counts Generate the Sigma-Algebra of Finite Configurations. Conversely every bounded-region count is a finite sum of these cell counts, since a bounded set meets finitely many cells. Thus the product cylinder sigma-algebra is exactly the sigma-algebra generated by all bounded-Borel count maps. For each λ>0, Qλ denotes the unique probability on Ω whose finite cell marginals are the products of the corresponding πi,λ. Existence and uniqueness follow from Assuming the Axiom of Choice, Kolmogorov extension for arbitrary families of standard Borel coordinate spaces. In particular every translation Tx is measurable since NA(Txω)=NA−x(ω). The unit-intensity reference is Q:=Q1.

Identify each ω∈Ω with the simple locally finite counting measure obtained by uniting its finite cell configurations. For a bounded Borel set A⊆Rd, write NA(ω)=ω(A) and ∣A∣ for its Lebesgue measure. Define translation by Txω(A)=ω(A−x) for x∈Rd. The next item proves that under Qλ, counts in disjoint bounded Borel sets are independent Poisson random variables with means λ∣A∣ and that Qλ is translation invariant. This item is a mathematical reference construction and makes no physical claim.

Depends on

Dependency tree · 2 levels

Sources