Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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.

Deleting one occurrence from a locally finite counting measure is measurable

Statement

Let D:={(x,μ)∈S×Nlf(S):μ({x})≥1}. Then D is measurable in the product evaluation sigma-algebra, and the map R:D→Nlf(S) defined by R(x,μ)=μ−δx is measurable. The subtraction removes one occurrence, so any other occurrences at x remain.

Facts & Assumptions

Given: The topological and measurable structures of S and Nlf(S) from Random measures and locally finite point processes.

[F1]

There is an increasing compact exhaustion (Kn) such that every compact subset of S is contained in some Kn. (Second-countable locally compact Hausdorff spaces admit compact exhaustions)

[F2]

Evaluation maps μ↦μ(B) generate the sigma-algebra on Nlf(S), and each μ is a locally finite measure. (Random measures and locally finite point processes)

[F3]

A measure kernel has measurable evaluations, and integration of a product-measurable nonnegative function against a uniformly sigma-finite kernel is measurable. (Measure kernel and probability kernel, Measurability of integration against a kernel)

[F4]

The product sigma-algebra is generated by measurable rectangles, and B(S) is generated by the open sets. (The product sigma-algebra and its finite iterates, The Borel sigma-algebra of a topological space)

Proof

technique · direct
1.1givenF1F2construct

On the parameter space S×Nlf(S) define Q((x,μ),B):=μ(B). For each parameter this is a measure, its evaluations are measurable by [F2], and (Kn) is a common finite-mass exhaustion because μ(Kn)<∞ for every locally finite μ. Thus Q is a uniformly sigma-finite kernel.

1.2givenF4algebra

The diagonal Δ={(x,y):x=y} is closed in S×S because S is Hausdorff. The product topology has the countable basis consisting of rectangles from countable bases of the two copies of S; every open set is a countable union of these rectangles. Hence the product Borel sigma-algebra equals B(S)⊗B(S), so 1Δ is product measurable by [F4].

2.1step 1.1step 1.2F3

For (x,μ), μ({x})=∫1Δ(x,y) Q((x,μ),dy). The measurability theorem in [F3] makes (x,μ)↦μ({x}) measurable; therefore its inverse image D of [1,∞] is measurable.

3.1givenF2step 2.1construct

On D, μ−δx is again a locally finite counting measure: in a representation of μ as a countable sum of point masses, remove one occurrence at x; no compact-set count increases. For every Borel B, R(x,μ)(B)=μ(B)−1B(x), where ∞−1 is interpreted as ∞. This evaluation is measurable on D, since both terms are measurable and on D the subtraction is nonnegative. The evaluations generate the target sigma-algebra [F2], so R is measurable.

4.1step 2.1step 3.1∎

Steps 2.1-3.1 prove measurability of the domain and deletion map, including the multiplicity convention.

Depends on

Used by

Dependency tree · two levels

33 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