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.
The RMK functional outer content is well defined
Statement
Assume the Axiom of Dependent Choice. Let be LCH and let be positive. For open define with , and for arbitrary define These are well-defined elements of ; is monotone, , and for every open .
Facts & Assumptions
Given: Dependent Choice, is LCH, and is a positive linear functional on .
A positive functional on is monotone. (A positive linear functional on is monotone)
Under Dependent Choice, LCH cutoffs exist between a compact set and an open neighbourhood. (LCH Urysohn cutoff)
Proof
Every pointwise-admissible is nonnegative, so . The [given, L1] zero function is admissible for every open set, including the empty set; for it is the only admissible function. Thus and .
The cutoff supremum is at most the pointwise supremum. Conversely, let [L1, L2] have compact support , and choose with and on by applying [L2] to . For put . Then : its support lies in the compact set . Moreover , so positivity gives . Letting proves that the two displayed suprema defining are equal.
If , every test function admissible for is admissible for , hence . The family of open supersets of any is nonempty because it contains , so is well defined in .
For open , using itself in the infimum gives [step 2.1] . Conversely, if with open, monotonicity gives ; taking the infimum over such gives the reverse inequality. This also covers and .
Depends on
Used by
Dependency tree · two levels
9 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
- Donald L. Cohn, Measure Theory, 2nd ed., Chapter 7 (standard reference, not scraped)