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.

Random measures and locally finite point processes

Definition

Fix a locally compact, second-countable Hausdorff topological space S (Locally compact topological space: every point has a compact neighbourhood; and what this says in a metric space, Second countability: an at most countable basis for the topology, Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not). Here locally compact means that every point has a compact neighbourhood; second countable means that the topology has an at most countable basis; and Hausdorff means that distinct points have disjoint open neighbourhoods. Let B(S) be the Borel sigma-algebra generated by the open sets (The Borel sigma-algebra of a topological space).

A counting measure on S is a Borel measure of the form μ=∑j∈Jδxj for a finite or countable index set J and points xj∈S, where repetitions are allowed and the empty sum is zero. Each δx is the unit point mass at x (The Dirac set function at a point, A Dirac set function is a probability measure), and the countable sum is a measure by Nonnegative scalar multiples and countable weighted sums of measures are measures. The multiplicity at x is μ({x}). The counting measure is locally finite if μ(K)<∞ for every compact subset K⊆S (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right).

Let Nlf(S) be the set of locally finite counting measures, equipped with the sigma-algebra generated by the evaluation maps μ↦μ(B) for B∈B(S). A point process on S is a measurable map η:(Ω,F,P)→(Nlf(S),E) from a probability space (Probability measures and probability spaces), with measurability in the sense of A measurable function between measurable spaces. Equivalently, every count η(B) is a measurable random variable, because the evaluation maps generate E. Its law is the probability measure Pη(A)=P(η−1(A)) on (Nlf(S),E) (Law or distribution of a random element, The law of a random element is a probability measure). The process is classified by its realized configurations: a configuration μ is simple if μ({x})≤1 for every x, and is multiplicity-bearing if some singleton has mass greater than one. This is a pointwise distinction; no almost-sure simplicity assertion is part of this definition.

Let Mlf(S) be the set of all locally finite Borel measures on S, with the sigma-algebra generated by their evaluation maps. A random locally finite measure ξ is a measurable map into this space.

For a nonnegative Borel function f, write η(f):=∫Sf dη. Define the expected measure, or intensity measure, by ν(B):=E[η(B)]. The expected-measure and random-integral measurability assertions are justified by Mean measures and measurable nonnegative integrals of random measures ↗. The measure ν need not be locally finite; it is locally finite exactly when E[η(K)]<∞ for each compact K.

The mean measure of a random locally finite measure is likewise ν(B)=E[ξ(B)], covered by the same expected-measure lemma. Local finiteness of each realization does not by itself assert local finiteness of ν.

Depends on

Used by

Dependency tree · two levels

45 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