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.
Complete ultrafilters and measurable cardinals
Definition
For an infinite cardinal kappa, a proper filter U on I is kappa-complete if whenever and each . The intersection with no factors is I. Countably complete means closed under countable intersections, equivalently omega_1-complete in ZFC. Ultrafilter and nonprincipal use Ultrafilter; cardinals use Cardinal (initial ordinal) and cardinality.
A measurable cardinal is an uncountable kappa carrying a nonprincipal kappa-complete ultrafilter on the full power set of kappa. Such a U is a normal measure if every function with , and is constant on a set in U contained in S. A set in U is called measure one.
The associated zero-one set function is if , and zero otherwise. It is not the definition of a real-valued measurable cardinal. The fixed-index filter and normality conditions are formulas of ZF and do not themselves use Choice. General cardinality language and the large-cardinal implications on this page use ZFC, with The Axiom of Choice explicit. No ultrafilter or measurable-cardinal existence is asserted.
Depends on
Used by
- Fine measures, strong compactness and supercompactness Definition
- Scott ultrapowers and class-embedding conventions Definition
- Fine-measure coordinates avoiding small supports Lemma
- Measurable cardinals are inaccessible Lemma
- Solovay densities and localized small null joins Lemma
- Infinitary Los theorem Theorem
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
- Monk Chapter 10; Marks Section 23 pp.93–95 (standard reference, not scraped)