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

Counts Generate the Sigma-Algebra of Finite Configurations

Statement

Let C=[0,1)d for an integer d≥1. Let Cf(C) be the set of finite subsets of C, represented by their cardinality n and their uniquely lexicographically increasing list (x1,…,xn). Give this set the Borel structure of the countable disjoint union of the Borel subspaces of Cn consisting of strictly increasing lists. For each Borel B⊆C, let NB(η)=#(η∩B). Then B(Cf(C))=σ{NB:B∈B(C)}.

Facts & Assumptions

Given: The finite simple configurations and sorted-list Borel structure in the Statement.

[F1]

Finite products carry the product sigma-algebra generated by measurable rectangles, and finite products of standard Borel spaces are standard Borel (The product sigma-algebra and its finite iterates, The Borel sigma-algebra of a topological space, Standard Borel spaces, Finite products of standard Borel spaces are standard Borel).

[F2]

A pi-system generating a sigma-algebra determines every lambda-system containing it (Dynkin's pi-lambda theorem).

[F3]

Use the left-closed, right-open dyadic intervals Im,k=[k2−m,(k+1)2−m), 0≤k<2m. The natural/integer indices and integer powers are those of The natural numbers N (von Neumann), The integers as equivalence classes of pairs of naturals, and Integer powers am; their Borel and partition properties are proved locally below, rather than attributed to a supplier with the opposite face convention.

Proof

Given: d≥1 and the finite configurations in the Statement.

1.1F1algebra

On the component of configurations with exactly n points, NB(x1,…,xn)=∑j=1n1B(xj) is Borel for every Borel B⊆C. The count of C identifies the component n, so every count map is Borel on the full disjoint union. Thus the count-generated sigma-algebra is contained in the sorted-list Borel sigma-algebra.

1.2F1F3algebra

Each Im,k is Borel as the intersection of a closed ray and an open ray. Distinct interval interiors are disjoint and an adjacent endpoint belongs only to the interval beginning there. Induction on the number of adjacent intervals gives ⋃k<jIm,k=[0,j2−m); at j=2m this is [0,1). Thus they partition the reference interval. Each interval is the union of its two intervals at the next level, so the partition refines and its mesh tends to zero. Cartesian products give the corresponding Borel partitions of C.

2.1F1F2step 1.1

Let (T,T) be any measurable space. For H∈B(C)⊗T, define MH(η,t)=∑x∈η1H(x,t). The class of such H for which MH is measurable with respect to the count sigma-algebra times T contains every rectangle A×D, since MA×D(η,t)=NA(η)1D(t). It is closed under relative complements because M(C×T)∖H=NC−MH, and under disjoint countable unions by pointwise convergence of finite partial sums. Rectangles form a generating pi-system, so [F2] proves measurability for every product-measurable H.

3.1F3step 1.2step 2.1construct

Fix a component with n distinct points and an index k≤n. Recover the coordinates of the kth lexicographic point recursively. Initially the selected prefix is empty and its rank is r=k. At coordinate j, with measurable prefix p=(a1,…,aj−1), use step 2.1 on the Borel set Hj={(x,p,t):xℓ=pℓ (ℓ<j), xj<t}, where t∈[0,1]. For each dyadic interval I=[u,v) in coordinate j, the number of points matching the prefix and having xj∈I is MHj(η,p,v)−MHj(η,p,u), hence is measurable. The interval containing the rth such coordinate is the first whose cumulative count reaches r; the nested interval closures have diameters tending to zero, so their left endpoints converge to that coordinate aj. The count of matching points with xj<aj is MHj(η,p,aj), measurable by step 2.1 after composition with the measurable prefix and aj. Subtracting it from r gives the positive rank among points with the extended prefix.

4.1step 3.1F1

The recursive choice in step 3.1 is the usual lexicographic ordering rule: among points with a fixed prefix, sort by the next coordinate, retain the value at the current rank, then subtract the points strictly below it to obtain the rank among ties. After coordinate d, distinctness leaves exactly one point, namely xk. Thus all coordinate functions of every sorted point are count-measurable. The Borel sigma-algebra on the sorted-list component is generated by its coordinate maps, so it is contained in the count-generated sigma-algebra there.

5.1step 1.1step 4.1F1∎

The count NC partitions the full configuration space into its countable components. Applying step 4.1 on each component shows that every sorted-list Borel set is count-measurable; step 1.1 proves the reverse inclusion. The displayed sigma-algebra equality follows.

Depends on

Dependency tree · 2 levels

Sources