Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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.

Finite-window spatial observations and configurations

Definition

Fix an integer d≥1 and a bounded Borel set W⊂Rd. Under Countable Choice every Borel subset of Rd is Lebesgue measurable (Assuming countable choice, every Borel subset of Rn is Lebesgue measurable), so Lebesgue measure ℓd is defined on each such set. Write ∣A∣:=ℓd(A) for Borel A, and BW:={W∩A:A∈B(Rd)} for the trace Borel sigma-algebra on W. Every member of BW is Borel in Rd because W is Borel. Define ℓW:BW→[0,+∞] by ℓW(A):=ℓd(A). If (Ak) is pairwise disjoint in BW, then each Ak and their union are Borel in Rd, so countable additivity of ℓd gives ℓW ⁣(⋃kAk)=ℓd ⁣(⋃kAk)=∑kℓd(Ak)=∑kℓW(Ak), and ℓW(∅)=0. Thus ℓW is a measure on the trace sigma- algebra. Since W is bounded, ℓW(W)<∞ (Lebesgue measure is sigma-finite, and every metrically bounded subset of Rn has finite outer measure). The only choice axiom used to regard ℓd as a measure in this library is Countable Choice, as recorded in Assuming countable choice, L(Rn) is a sigma-algebra containing every elementary set and λn is a complete measure extending elementary volume.

The finite configuration space on W, denoted C(W), is the measurable subspace of locally finite counting measures on Rd consisting of those η with η(Wc)=0 and η(Rd)<∞. It is measurable in the ambient evaluation sigma-algebra because both η↦η(Wc) and η↦η(Rd) are evaluation maps for Borel sets. Thus each η∈C(W) has a representation η=∑i=1nδxi for a finite n≥0 and xi∈W; repeated locations are allowed and represent multiplicity. Its sigma-algebra is the trace of the evaluation sigma-algebra: it is generated by η↦η(B) for Borel B⊆W.

For a finite ambient configuration η~, its observation in W is η=η~∣W, where η(B)=η~(B∩W). The observation includes precisely the locations belonging to W: a boundary location is included when and only when it belongs to W. This convention does not replace W by its interior or its closure.

Remarks

This definition allows multiplicities and makes no simplicity claim. The separate finite-intensity Poisson simplicity argument is in A finite Poisson process with atomless intensity is simple.

Depends on

Used by

Dependency tree · two levels

65 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources