Alphabeta Math
LemmaStatement: AI-adaptedProof: 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.

Finite-window pair counts are measurable

Statement

Let W and C(W) be as in Finite-window spatial observations and configurations. For R≥0, put DR:={(x,y)∈W×W:∥x−y∥2≤R}. For a finite configuration η, define SR(η):=12((η⊗η)(DR)−η(W)). Here η⊗η is the product measure and the subtraction removes the n ordered self-pairs from a representation with n=η(W) occurrences. Thus SR counts unordered pairs of distinct occurrences at distance at most R, including co-located distinct occurrences when multiplicity is present. Then SR:C(W)→[0,∞) is measurable.

Facts & Assumptions

Given: W, its finite-configuration space, and R≥0.

[F1]

The evaluation maps generate the sigma-algebra on C(W) and each η is a finite measure. (Finite-window spatial observations and configurations)

[F2]

For a finite measure η, the product measure η⊗η exists and satisfies (η⊗η)(B×C)=η(B)η(C) on measurable rectangles. (For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique)

[F3]

A lambda-system containing a pi-system contains its generated sigma-algebra. (Dynkin's pi-lambda theorem)

[F4]

Sums, real scalar multiples, and hence differences of finite-valued measurable functions are measurable. (Closure properties of measurable functions used by the integral)

[F5]

Countable suprema and pointwise limits of measurable functions are measurable. (Sequential suprema, infima, limsup, liminf, and pointwise limits of measurable functions are measurable)

[F6]

Rational open boxes form a countable basis for Rd; their intersections with W form a countable basis for its subspace topology. (Qn is a countable dense subset of Rn, and rational open boxes form a countable basis)

[F7]

For second-countable spaces, the Borel sigma-algebra of the product equals the product of the Borel sigma-algebras. (Borel sigma-algebra of a product of second-countable spaces)

Proof

Given: The finite configuration η and the radius R.

1.1givenF1F2F4F5construct

For a measurable rectangle B×C, the map η↦(η⊗η)(B×C)=η(B)η(C) is measurable by [F1]. Let D:={A∈BW⊗2:η↦(η⊗η)(A) is measurable}. The whole space belongs to D because its value is η(W)2: for each integer k≥0, the level set {η(W)2≥k} is a countable union of evaluation level sets {η(W)=n}. The total product mass is finite. For A∈D, finite additivity gives (η⊗η)((W×W)∖A)=η(W)2−(η⊗η)(A); this finite-valued measurable difference is measurable by [F4], so complements belong. Countable disjoint unions belong by countable additivity, since the partial sums are measurable by [F4] and their pointwise limit is measurable by [F5]. Thus D is a lambda-system containing the rectangles.

2.1step 1.1F3F6F7

Rectangles form a pi-system and generate the product Borel sigma-algebra by [F6] and [F7]. Dynkin's theorem [F3] applied to step 1.1 therefore gives that η↦(η⊗η)(A) is measurable for every Borel A⊆W×W. The set DR is closed, so its product-measure evaluation is measurable.

3.1givenstep 2.1F1algebra∎

If η=∑i=1nδxi, then (η⊗η)(DR)=∑i,j=1n1{∥xi−xj∥2≤R}. The n terms with i=j all occur since R≥0; every remaining unordered pair of distinct occurrences contributes exactly two terms. Hence the displayed formula for SR is a finite nonnegative integer and is measurable by step 2.1 and [F1].

Depends on

Used by

Dependency tree · two levels

51 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