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.
Premeasures on algebras of sets
Definition
Let be an algebra of subsets of . A premeasure on an algebra vanishes at the empty set and is countably additive whenever a disjoint sequence in has its union in . Thus is a premeasure when and
whenever the are pairwise disjoint members of and their union belongs to . Padding a finite disjoint family by empty sets shows that a premeasure is finitely additive.
The premeasure is finite if . It is sigma-finite if there is a sequence in with and for every .
Depends on
Used by
- A finite premeasure has at most one extension to its generated sigma-algebra Corollary
- A non-sigma-finite premeasure has distinct Borel extensions Counterexample
- Zero on finite sets and infinity on cofinite sets is finitely additive but not a premeasure Counterexample
- The outer set function induced by a premeasure Definition
- Counting premeasure on the finite-cofinite algebra induces counting outer measure Example
- FALSE: the extension of a premeasure is always unique False statement
- Assuming countable choice, every source-algebra set is measurable for the induced outer measure Lemma
- The induced outer measure agrees with the premeasure on the source algebra Lemma
- Under sigma-finiteness, every Carathéodory measurable set differs from a generated measurable hull by a null set Lemma
- A sigma-finite premeasure has at most one extension to its generated sigma-algebra Theorem
Dependency tree · two levels
11 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
- G. Folland, Real Analysis, 2nd ed., Section 1.4 (standard reference, not scraped)
- T. Tao, An Introduction to Measure Theory, Definition 1.7.7 (standard reference, not scraped)