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 open convex gauge is sublinear and recovers its set
Statement
Let be an open convex neighbourhood of zero in a real or complex normed space , and fix with . Its gauge satisfies In particular it is a sublinear functional on the underlying real space. No symmetry identity is asserted.
Facts & Assumptions
for the nonempty positive admissible-scale set , and (The finite gauge of an open convex neighbourhood of zero).
For a nonempty lower-bounded real set and a lower bound , one has if and only if for each there is with (Epsilon characterisation of the infimum).
Sublinearity means subadditivity and homogeneity for every real scalar at least zero (A sublinear functional on a real vector space).
Proof
Given: An open convex with and such that .
Write . The gauge definition gives . For every one has , so . If , their midpoint is such a smaller than , impossible. Hence .
For , the condition is equivalent to , so . The number is a lower bound of this set. Conversely, for every , choose with ; then and . The infimum criterion gives . For , both sides are zero by .
If , choose with using the infimum criterion with . Since , convexity and give . Thus every is admissible.
If , choose with using the infimum criterion with . Then and by convexity.
Given , set and . Both are positive and admissible by step 1.3. Convexity gives . Hence . If the desired inequality failed with positive difference , taking would give . Therefore . Together with step 1.2, this is sublinearity on the real space.
Conversely, let . For , . If , openness gives with . Put . Since , , so and . This proves both inclusions in the asserted set equality.
Subadditivity gives and, with interchanged, . These two real inequalities yield the Lipschitz bound. When both differences are zero; no use of occurs.
Source notes
Brezis Lemma 1.2, p.6, full proof; Teschl Lemma 5.1, p.138, full proof.
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)