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.
Measures and Their Basic Properties — Examples
1 · Prerequisites
- Cardinal Arithmetic, Cofinality and the Alephs
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Countability and Uncountability
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Measures and Their Basic Properties
- Metric Spaces
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Order, Zorn's Lemma, and the Axiom of Choice
- Ordinal Arithmetic and the First Uncountable Ordinal
- Ordinals, Cardinals, and Transfinite Recursion
- Relations, Functions, and Quotients
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Series: Convergence and the Nonnegative Tests
- Set Theory Beyond Choice: Recorded, Not Proved Here
- Sigma Algebras and Borel Sets
- Subspaces, Products, and Quotients
- Suprema and Infima
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Topology of Euclidean Space
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
2 · Summary
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Assuming countable choice, counting measure is sigma-finite exactly on countable sets
Example
Assume the Axiom of Countable Choice. For a set , counting measure on is sigma-finite if and only if is at most countable. In particular, counting measure on is not sigma-finite.
Facts & Assumptions
Given: A set , its counting measure , and the Axiom of Countable Choice.
Counting measure assigns finite measure exactly to finite sets (Counting measure on an arbitrary set) and is a measure (Counting measure is a measure).
Sigma-finiteness means that the whole space is a countable union of measurable finite-measure sets (Finite, sigma-finite, and semifinite measures).
Under countable choice, a countable union of at most countable sets is at most countable (The Axiom of Countable Choice (), Countable unions of at most countable sets, assuming ).
The real line is uncountable ( is uncountable (Cantor's nested intervals, 1874)).
Verification
For the forward implication, suppose counting measure on is sigma-finite. By [L2], with , so every is finite by [L1] and is at most countable by [L3].
For the reverse implication when is finite, the constant cover has finite counting measure; when is countably infinite, a bijection gives finite initial sets with union . The empty set is covered by the constant empty sequence.
Steps 1.1 and 1.2 prove the equivalence. Since is uncountable by [L4], the forward implication shows that its counting measure is not sigma-finite.
A Dirac probability measure concentrates all mass at one point
Example
Let . The Dirac probability measure satisfies exactly when and otherwise has value . For measurable , its same-ambient restriction satisfies
Facts & Assumptions
Given: A measurable space , a point , and a measurable set .
The Dirac set function at is a probability measure and has value exactly on sets containing (A Dirac set function is a probability measure).
Restriction to is the measure on the original sigma-algebra (The restriction of a measure to a measurable set is a measure).
Verification
For every measurable , [L1] gives if and otherwise; in particular its values on and are and .
By [L2], . If , this equals exactly when , so it is ; if , it is always .
Steps 1.1 and 1.2 verify the concentration and both restriction cases, including and .
The weights define a probability measure on
Example
For , define
Then is a probability measure on . The shift by is essential: because , the unshifted weights have total mass , not .
Facts & Assumptions
Given: The Dirac measures on and the weights .
Nonnegative countable weighted sums of measures are measures (Nonnegative scalar multiples and countable weighted sums of measures are measures); is exactly when and is otherwise (The Dirac set function at a point); and every is a probability measure (A Dirac set function is a probability measure).
A probability measure is a measure of total mass (Probability measures and probability spaces).
Natural powers have initial value (Integer powers ), and for , (For , , and for the series diverges).
Verification
By [L1], is a measure, and evaluating it on gives exactly the displayed subseries because is for and otherwise.
The geometric-series formula with gives .
The unshifted total is , whose first term at is ; thus those weights do not define a probability measure.
Steps 1.1 and 1.2 make a probability measure by [L2], and step 1.3 verifies the index-zero boundary and rules out the unshifted construction.
Assuming countable choice, zero on countable sets and infinity on cocountable sets is a non-semifinite measure
Example
Assume the Axiom of Countable Choice and let be uncountable. On the sigma-algebra of countable and cocountable subsets of , define
Then is a measure, but it is not semifinite.
Facts & Assumptions
Given: An uncountable set and the Axiom of Countable Choice.
A sigma-algebra is closed under complements and countable unions (Sigma-algebras), and a measure is countably additive on disjoint measurable sequences (Measures on sigma-algebras).
Countable means finite or countably infinite (Finite, countably infinite, countable, uncountable), and under countable choice a countable union of at most countable sets is at most countable (The Axiom of Countable Choice (), Countable unions of at most countable sets, assuming ).
Semifiniteness requires every positive-measure measurable set to contain a positive finite-measure measurable subset (Finite, sigma-finite, and semifinite measures).
Verification
The countable-cocountable family is a sigma-algebra: complements exchange its two classes, a countable union of countable members is countable by [L2], and a union containing a cocountable member is cocountable.
The whole space has measure , while every measurable set of finite measure has measure ; hence contains no measurable subset of positive finite measure.
In a pairwise disjoint sequence from , at most one member is cocountable. If all members are countable, their union is countable by [L2] and both sides of countable additivity are ; if one is cocountable, the union is cocountable and both sides are .
Steps 1.1 and 2.1 prove that is a measure, and step 1.2 violates the semifiniteness condition [L3].
Assuming choice, the completion of the Borel Dirac measure at zero is defined on every subset of the real line
Example
Assume the Axiom of Choice. On , let be the Borel Dirac measure at . Its completion has domain and satisfies
The original Borel measure space is therefore not complete.
Facts & Assumptions
Given: The real line, its Borel sigma-algebra, the point , and the Axiom of Choice.
Every measure space has a unique complete extension to its completion construction under countable choice (Assuming countable choice, every measure space has a unique complete extension to its completion), and the Axiom of Choice supplies every choice function required by countable choice (The Axiom of Choice).
The Dirac set function at assigns value exactly to measurable sets containing and value otherwise (The Dirac set function at a point); it is a probability measure (A Dirac set function is a probability measure).
A set lies in the completion domain exactly when it is a measurable core union a subset of a measurable null set, and its completed value is the measure of that core (The completion domain and proposed completed set function of a measure space).
The Borel sigma-algebra is generated by the open sets (The Borel sigma-algebra of a topological space), and open rays are open while their complements are closed (Open subset of (every point has a neighbourhood inside it), closed subset (complement open), and clopen).
Under choice, (Assuming the Axiom of Choice, the Borel sigma-algebra on R^n has cardinality continuum for n at least one) and every power set has strictly larger cardinality than its underlying set (Assuming the Axiom of Choice, , and Cantor's theorem in cardinal form: ).
Binary sequences inject into the Cantor set and hence into (The Cantor set is exactly the set of with every , and this gives a bijection with ).
Verification
The singleton is Borel because its complement is the union of the open rays and ; hence is Borel and .
The binary-sequence injection [L5] gives an injection from a set of cardinality into ; the map then injects its power set into . Hence [L4] gives , so some subset of is not Borel.
If , then with is a completed representation and has completed value by [L6]; if , then with the second part contained in , so [L2] and [L6] give completed value .
Thus every subset of lies in the completion and the displayed formula holds.
For the non-Borel set from step 1.2, the set is still non-Borel, since otherwise adjoining the Borel singleton when necessary would make Borel; it is a subset of the Borel null set from step 1.1. Thus the original Borel Dirac space is not complete, while step 3.1 shows that its completion is the full power set.
Borel-Cantelli for the shrinking intervals under a dyadic atomic measure
Example
On the Borel subsets of , define
Then , so and the first Borel-Cantelli lemma gives . In fact .
Facts & Assumptions
Given: The dyadic atomic set function and intervals displayed above.
Dirac set functions are probability measures (A Dirac set function is a probability measure), and nonnegative countable weighted sums of measures are measures (Nonnegative scalar multiples and countable weighted sums of measures are measures).
The geometric series with ratio sums to , and the sequence tends to (For , , and for the series diverges, For the sequence is null, and for the sequence diverges to ).
If the sum of the measures is finite, the first Borel-Cantelli lemma makes the set limsup null (The first Borel-Cantelli lemma for measures).
The set limsup is the intersection of the tail unions (Limit superior and limit inferior of a sequence of sets), and (Intervals of : the nine order-convex forms, nondegeneracy, and length).
Verification
By [L1], is a measure. For fixed , the atom lies in exactly when , so .
The intervals decrease. No belongs to any of them, and for , convergence supplies with , so ; hence their intersection, and therefore their limsup, is empty.
The tail geometric sum in step 1.1 is , and therefore . At , this gives .
Borel-Cantelli applied using step 2.1 gives , while step 1.2 independently identifies that limsup as .
Counting-measure tails decrease to the empty set while every term has infinite measure
Statement refuted
The finiteness hypothesis in continuity from above cannot be deleted: a decreasing sequence may have empty intersection while all its measures remain .
Facts & Assumptions
Given: Counting measure on and .
Counting measure gives every infinite set value (Counting measure on an arbitrary set) and is a measure (Counting measure is a measure).
Continuity from above assumes that some member of the decreasing sequence has finite measure (Continuity from above when one set has finite measure).
The natural order is defined through addition (Order on the natural numbers), natural addition is cancellative (Addition is cancellative), and each is strictly greater than (Discreteness: is the immediate successor).
Counterexample
The sequence decreases because implies , and .
Every is infinite, since injects into , so .
The intersection is empty: a natural does not belong to .
Hence but . The hypothesis of [L2] fails at every index, exactly as required.
A free ultrafilter induces a finitely additive zero-one probability that is not countably additive
Statement refuted
A finitely additive set function of total mass need not be countably additive, even when it takes only the values and . Assuming the Axiom of Choice, a free ultrafilter on gives such a set function.
Facts & Assumptions
Given: The Axiom of Choice and the tails .
A filter base is nonempty, excludes , and is downward directed; its upward closure is the filter it generates (Filter base and the filter it generates, The upward closure of a filter base is the smallest filter containing it).
Under the Axiom of Choice, every filter is contained in an ultrafilter (The Axiom of Choice, The ultrafilter lemma, from the Axiom of Choice: every filter extends to an ultrafilter), and an ultrafilter contains exactly one of each set and its complement (Ultrafilter, Characterisation of ultrafilters: every set or its complement).
The natural numbers begin at (The natural numbers (von Neumann)), their order is total (Order on the natural numbers, is a linear order on ), and is the immediate successor of (Discreteness: is the immediate successor).
A finitely additive nonnegative set function vanishes at the empty set and is additive on disjoint pairs (Finitely additive nonnegative set functions).
Counterexample
The family is a filter base: , no tail is empty, and . Let .
By [L2], extend to an ultrafilter . It is free: if , then , so closure under intersections would put in the filter.
Define when and otherwise. Then and .
If are disjoint, then exactly when one of lies in : the reverse implication is upward closure; for the forward implication, if , then and lies in . Disjointness prevents both from lying in . Thus , so is finitely additive.
Every singleton has value because is free, but their disjoint union is and has value . Hence countable additivity fails.
Steps 4.1 and 4.2 give a finitely additive zero-one probability that is not countably additive, refuting the proposed implication.
Two four-point probability measures agree on a generating family that is not a pi-system
Statement refuted
Agreement on a family that merely generates the sigma-algebra does not determine a measure. Intersection closure in the pi-system uniqueness theorem is essential.
Facts & Assumptions
Given: The four-point set and the family consisting of , the north and south rows, and the west and east columns.
A probability measure is a measure with total mass (Probability measures and probability spaces).
The generated sigma-algebra is the smallest sigma-algebra containing the generating family (The sigma-algebra generated by a family of sets).
A pi-system is closed under intersections (Pi-systems), and the uniqueness theorem requires agreement on a generating pi-system with a finite-measure exhaustion (Measures agreeing on a generating pi-system are equal under an increasing finite-measure exhaustion from that pi-system).
Counterexample
Give masses at and give masses . Finite summation over subsets defines probability measures on .
Intersecting rows with columns produces every singleton, so ; a singleton intersection is absent from , so is not a pi-system. The constant sequence is an increasing finite-measure exhaustion lying in .
Every row and column contains exactly one -atom and one -atom of mass , and both measures give mass , so the measures agree on .
The measures are unequal because and , despite steps 2.1 and 1.2. The family satisfies the generating and finite-measure exhaustion hypotheses and violates the pi-system hypothesis of [L3].
Sources
- S. Axler, Measure, Integration & Real Analysis, §2C
- G. Folland, Real Analysis, 2nd ed., §1.3
- S. Axler, Measure, Integration & Real Analysis, Example 2.55
- G. Folland, Real Analysis, 2nd ed., Theorem 1.8(d)
- D. Galvin, Ultrafilters, with Applications to Analysis, Social Choice and Combinatorics, §2
- D. Pollard, A User's Guide to Measure Theoretic Probability, §10, Example 42