Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-09
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.

Countable partition construction of the Borel set function

Definition

For a density r as in Pointwise Borel nonnegative densities, choose a countable locally finite chart cover (Ui,xi) and a subordinate smooth partition of unity (φi) with φi0, suppφiUi and iφi=1. Define the proposed set function on B(M) by μr,(xi,φi)(E)=ixi(EUi)(φixi1)rxidλn. Each term is the nonnegative integral of The nonnegative Lebesgue integral, with 0=0. Its coefficient, extended by zero outside the chart image, is Borel; smoothness of that zero extension is not required. Empty sums and the empty-set value are zero. For n=0 use singleton charts and the mass-one coordinate convention.

Here is why the choices exist under countable choice, including at a boundary. From a countable base select a chart and a relatively compact ball or half-ball for each basis member whose closure fits inside such a chart; these members cover M. Their finite unions of compact closures give compact sets whose interiors cover M. Passing recursively to the least sufficiently large index gives an exhaustion KmIntKm+1. Cover each compact annulus KmIntKm1 by finitely many chart balls or half-balls whose closures lie in IntKm+1Km2 (take K0=K1=). Such small coordinate neighborhoods exist at every point of the annulus. Countable choice selects one finite cover per annulus. The resulting countable chart cover is locally finite: IntKj misses all families indexed mj+2, and only finitely many sets come from each remaining annulus. Apply Smooth partitions of unity exist on manifolds with boundary to this cover; the boundaryless specialization is also Smooth partitions subordinate to a countable coordinate cover. If the subordinate partition has several terms per chart, aggregate those terms; local finiteness makes each sum smooth, and its support remains in the assigned chart.

Countable additivity is discharged by The glued set function is a Borel measure . Independence of both choices and the intrinsic notation μr are discharged by Intrinsic density measure and its chart restriction .

Depends on

Used by

Dependency tree · two levels

15 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