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.
Relative geometric Hahn–Banach with the exact open, closed, and compact hypotheses
Statement
Assume HB. Let be disjoint nonempty convex subsets of a real or complex normed space .
(i) If is open, there are and with If is also open, the right inequality is strict too. If only is open, interchange the labels and negate the functional to put the strict inequality on the side.
(ii) If is closed and is compact, there are , , and with In particular, a point outside a nonempty closed convex set is uniformly strictly separated from it. All inequalities concern real parts.
Facts & Assumptions
Under HB a nonempty open convex set and an exterior point admit a nonzero bounded scalar-linear functional with strict real-part separation (Relative separation of an open convex set from an exterior point).
A nonempty compact set and a disjoint nonempty closed set have a uniform positive norm-distance lower bound (A compact set and a disjoint closed set have a positive norm-distance gap).
Convexity uses real weights; for , is a nonzero bounded real-linear functional, and a uniform positive margin defines uniform strict separation (Convex sets and continuous real-hyperplane separation in a normed space).
A supremum of a nonempty upper-bounded real set has elements within every positive error from below (Epsilon characterisation of the supremum).
A nonempty lower-bounded real set has a real infimum; reflection gives the corresponding real supremum (Every nonempty set bounded below has an infimum).
Proof
Given: HB, a normed real or complex , and disjoint nonempty convex , with the additional hypotheses of each part.
For (i), put . It is nonempty. For and , their convex combination equals . If , choose with ; then by keeping fixed. Thus is open and convex. If , then some equals some , contrary to disjointness; hence .
For (ii), now suppose is closed and compact. The distance-gap lemma applied with gives with for all . Put and . The ball is convex by the triangle inequality, so for each convex combination has its component in and its ball component of norm less than , including the weights zero and one. Thus is convex. A ball about of radius stays in , so is open; it contains nonempty . If , then , impossible. Therefore and are disjoint.
For (i), apply point separation to and . It gives with for every , where is nonzero bounded real-linear. Consequently for every . Fix . The nonempty real set is bounded above by , so it has a real supremum . Explicitly, ; reflection of lower bounds makes this the least upper bound. Since every bounds , for all .
For (i), fix a vector with : nonzero has a nonzero value, and negation makes that value positive. For each fixed , choose with and set . Then and . This proves the strict left inequality. If is open, for each choose with and set . Then , and step 2.1 gives . Thus both inequalities are strict in that case.
If only is open, apply the result just proved to to get a functional and level with for . Taking and gives . This completes (i) in each orientation.
For (ii), apply the already proved open-side assertion to . It gives and with whenever , , and , where . Regard as a member of the real dual of the underlying normed space, and let . The bound makes this supremum finite, and a normalized vector with nonzero value shows .
Continuing (ii), we show . Normalization gives (including ). For any with , has . For , use the supremum criterion for with error to obtain with and . Let if and otherwise; then . Set , which satisfies and . Thus has and . No number smaller than is an upper bound, proving the identity.
For (ii), for each fixed , step 4.2 says is an upper bound for all with . The identity just proved yields . Put and . Then , while for every . Since , these are precisely the required uniform strict separation inequalities.
Finally, if lies outside a nonempty closed convex , the set is nonempty, disjoint from , and convex since . It is intrinsically compact: any open cover of its one-point metric space has a member containing , and that one member is a finite subcover. Thus the hypotheses of (ii) hold and steps 1.2, 4.2, 5.1 and 6.1 give the final specialization.
Source notes
Brezis Theorems 1.6–1.7, pp.5–7; Teschl Theorems 5.2–5.3 and Corollary 5.4, pp.138–140.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
22 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)