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.
Every measure on a countable discrete space is its weighted sum of Dirac measures
Statement
Let be at most countable and equip it with . Every measure on this discrete measurable space is determined by the weights and satisfies
For finite this is a finite sum over a bijective finite listing; for countably infinite it is a series over a bijection . No point is repeated. Each coefficient, including , is uniquely forced by .
Facts & Assumptions
Given: An at most countable set and a measure on .
An at most countable set is finite or is in bijection with (Finite, countably infinite, countable, uncountable).
A measure vanishes at the empty set and is countably additive on disjoint measurable sequences (Measures on sigma-algebras).
The Dirac set function has value on sets containing and otherwise (The Dirac set function at a point); Dirac set functions are probability measures (A Dirac set function is a probability measure); and nonnegative finite and countable weighted sums of measures are measures (Nonnegative scalar multiples and countable weighted sums of measures, Nonnegative scalar multiples and countable weighted sums of measures are measures).
Proof
If , then is the zero measure and the asserted expression is the empty weighted sum.
If is finite and nonempty, choose a bijection for some . Every is the finite disjoint union of the singletons with , so .
If is countably infinite, choose a bijection . Every is the disjoint union of the sequence whose -th term is when and otherwise, so .
Evaluating any asserted representation at the singleton leaves only the Dirac term at , so its coefficient must be .
In the finite case, the weighted Dirac sum with coefficients has the value computed in step 1.2 on every ; the explicit positive-infinity branch gives off and on sets containing it.
In the countably infinite case, the countable weighted Dirac sum has the value computed in step 1.3 on every , with the same interpretation of infinite coefficients.
Steps 1.1, 2.1 and 2.2 prove the representation in the empty, finite nonempty, and countably infinite cases, and step 1.4 proves uniqueness of every coefficient.
Depends on
- Nonnegative scalar multiples and countable weighted sums of measures are measures
- Nonnegative scalar multiples and countable weighted sums of measures
- The Dirac set function at a point
- A Dirac set function is a probability measure
- Finite, countably infinite, countable, uncountable
- Measures on sigma-algebras
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
16 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
- T. Tao, An Introduction to Measure Theory, Exercise 1.4.25 (standard reference, not scraped)