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.
Separation of disjoint convex sets when one is open
Statement
Assume the Axiom of Choice. If are nonempty disjoint convex sets and is open, then there is a nonzero such that
Facts & Assumptions
Given: The Axiom of Choice and nonempty disjoint convex sets , with open.
An exterior point and a nonempty open convex set admit a strict separating continuous functional (Separate a point from an open convex set).
The Axiom of Choice is used through the Hahn–Banach extension in [F1].
Proof
The difference is open and convex, and because .
Under [A1], apply [F1] to and . It supplies nonzero with for every .
For and , , so . This is the required strict separation.
Depends on
Used by
- A closed convex set is an intersection of closed half-spaces Corollary
- A topological invariant mean yields norm-approximately invariant densities Lemma
- Probability-density approximation of continuous tests and topological means Lemma
- Mazur theorem: weak and norm closure agree for convex sets Theorem
- Strong separation of a closed and a compact convex set Theorem
Dependency tree · two levels
10 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
- Theo Buehler and Dietmar Salamon, Functional Analysis, Theorem 2.41 (standard reference, not scraped)