Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedverified 2026-09-23 (gpt-6-sol)
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.

Weighted counting in dimension zero

Example

A Hausdorff second-countable zero-manifold M is countable and discrete. For any weights w(p)∈[0,∞] its density measure is μw(A)=∑p∈Aw(p)(A⊆M). Finite positive weights give a Radon measure. On N={0,1,…}, weights 2−k−1 give total mass one, while weights one give infinite total mass.

Facts & Assumptions

Given: Manifolds are Hausdorff, second countable and smooth; n=0, with every singleton an open chart of coordinate mass one. Densities are pointwise Borel, with 0⋅∞=0. Zero-dimensional weighted counting with two explicit total-mass series.

[F1]

In dimension zero, each point is its own coordinate chart. The transition determinant is the empty determinant 1, and the zero-dimensional coordinate measure gives a singleton mass 1. On a discrete space every function to [0,∞] is Borel, so assigning the coefficient w(p) directly satisfies the pointwise density transformation law without a global atlas construction.

[F2]

Measures on sigma-algebras: A nonnegative set function vanishing at the empty set and countably additive on disjoint sequences is a measure.

[F3]

Radon measure on an LCH space: Radon requires compact-finiteness, outer regularity on Borel sets, and compact-inner-regularity on open sets.

Verification

1.1F1given

Each point has an open singleton chart, so M is discrete and every subset is Borel. Fix a countable base (Bj). For each p the base contains {p}; assigning the least such index injects M into N. Thus M is countable without selecting a chart for each point. Singleton indicators form a locally finite smooth partition in dimension zero.

2.1F1F2step 1.1

Define μw(A)=sup⁡{∑p∈Fw(p):F⊆A finite} for every A⊆M; the empty sum is zero. This is the displayed nonnegative sum because step 1.1 gives a fixed injection of M into N. If (Aj) is a disjoint sequence, both μw(⋃jAj) and ∑jμw(Aj) are the supremum of the same finite weighted subsums: each finite subset of the union meets only finitely many Aj, and a finite choice of finite subsets of those Aj has finite union. Hence μw is countably additive, so it is a Borel measure by [F2]. Its singleton mass is w(p)λ0(R0)=w(p), the required chart coefficient integral. Conversely, countable additivity forces any Borel measure with these singleton chart masses to equal μw on every subset. No choice of charts or global partition is needed.

3.1F3step 1.1step 2.1

A compact subset of a discrete space is finite, since its singleton cover has a finite subcover. Every scalar function here is smooth in local zero-dimensional coordinates. If all weights are finite and positive, compact masses are finite sums. Every subset is open, so it is its own outer-regular open superset. Its measure is the supremum of the masses of its finite subsets by the nonnegative-sum formula, and finite subsets are compact; this proves inner regularity on open sets. Thus the weighted measure is Radon directly, without the general regularity theorem.

4.1step 2.1step 3.1∎

For M=N and w(k)=2−k−1, the partial sum through k=N−1 is 1−2−N, which tends to one. For w(k)=1 the same partial sum is N, hence the total mass is infinite. In the one-point case the formula gives precisely its weight.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

7 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