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.

Local-Tame Topology

Definition

Let Pstat1(Ω) be the probability laws P on the configuration space of Poisson Configuration Reference that are invariant under every Tx and satisfy EPNC0<∞. Stationarity then makes every bounded-region count integrable, because a bounded set meets finitely many unit cells.

A real measurable function f on Ω is local if there is a bounded Borel set A such that f is measurable with respect to the restriction ω↦ω∣A. It is tame if there is a finite b≥0 such that ∣f(ω)∣≤b(1+NA(ω)) for every ω and one such bounded A. Write T for the family of all local tame functions. Each f∈T is integrable under every P∈Pstat1(Ω).

The local-tame topology τL on Pstat1(Ω) is the initial topology generated by all maps P↦EPf, f∈T. Equivalently, a net (Pα) converges to P in τL exactly when EPαf→EPf for every measurable local f with at most linear growth in the count of a bounded support. Bounded local indicators are among these tests, so this topology separates distinct probability laws. The domain restriction to finite-intensity stationary laws ensures every displayed expectation is a finite real number.

Depends on

Dependency tree · 2 levels

Sources