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 finite gauge of an open convex neighbourhood of zero
Definition
Let be a real or complex normed space and let be open and convex with , using Convex sets and continuous real-hyperplane separation in a normed space. For set The function is the gauge of , with real nonnegative values and real positive scale parameters. Symmetry and boundedness of are not assumed.
This infimum is well-defined without HB or choice. Openness at zero gives one with . For any fixed and any , , so . Thus is nonempty, for example at , and is bounded below by zero. The real infimum property Every nonempty set bounded below has an infimum supplies a finite . These formulas define a unique value at every ; no family of choices is involved. At zero, , whose infimum is zero because it has members below every positive number.
The scale sets give the following direct calculations. For , one has , so , including zero. For the open convex strip , the condition is exactly , so . This set contains for all real and is unbounded; its gauge vanishes along that whole line. Finally, in a nonzero normed space is convex but not a neighbourhood of zero: every positive-radius ball contains a nonzero multiple of any fixed nonzero vector. For its scale set is empty since for every . Thus that set does not define a finite gauge on all of by this construction.
Source notes
Brezis Lemma 1.2 and (8), p.6; Teschl (5.1) and Lemma 5.1, pp.137–138.
Depends on
Used by
Dependency tree · two levels
12 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
- Haim Brezis, Functional Analysis, Sobolev Spaces and Partial Differential Equations, §§1.1–1.2 and §1.3 evaluation paragraph (standard reference, not scraped)
- Gerald Teschl, Topics in Real and Functional Analysis, Theorems 4.13–4.20 and §5.1 (2018 university-hosted copy) (standard reference, not scraped)