Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-09
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 separation of an open convex set from an exterior point

Statement

Assume HB. If C is a nonempty open convex subset of a real or complex normed space X and z∉C, there is a nonzero f∈X∗ such that Re⁡f(c)<Re⁡f(z)(c∈C). Over the real field, the real-part symbol is redundant.

Facts & Assumptions

[F1]

Under HB a real-linear dominated functional extends, with upper bound p(x) and lower bound −p(−x) (Dominated extension conditional on the relative principle).

[F2]

An open convex neighbourhood U of zero has a sublinear gauge with U={pU<1} and 0≤pU(x)≤∥x∥/r whenever B(0,r)⊆U (The open convex gauge is sublinear and recovers its set).

[F3]

For real-linear F on a complex space, f(x)=F(x)−iF(ix) is complex-linear with real part F (A complex linear functional is recovered from its real part by f(x)=u(x)-iu(ix)).

Proof

Given: HB, a nonempty open convex C⊆X, and z∈X∖C.

1.1givenalgebra

Fix c0∈C, set U=C−c0 and v=z−c0. Then 0∈U and v∉U, hence v≠0. If uj=cj−c0∈U and 0≤t≤1, then (1−t)u1+tu2=((1−t)c1+tc2)−c0∈U. A ball in C about c translates to a ball of the same radius in U about c−c0, so U is open. Fix r>0 with B(0,r)⊆U.

2.1step 1.1F2

Let p=pU. Its gauge is finite and sublinear on the underlying real space, nonnegative everywhere, and bounded above by ∥x∥/r. Because v∉U={p<1}, p(v)≥1.

3.1step 1.1step 2.1algebra

The set M=Rv is a real linear subspace. Since v≠0, tv has a unique real coefficient t, and g(tv)=t defines a real-linear functional. For t≥0, g(tv)=t≤tp(v)=p(tv); for t<0, g(tv)=t<0≤p(tv). This checks domination on every element of M, including zero.

4.1step 2.1step 3.1F1

Applying relative dominated extension on the underlying real X gives real-linear F extending g and satisfying −p(−x)≤F(x)≤p(x). The two gauge upper bounds imply −∥x∥/r≤F(x)≤∥x∥/r, so ∣F(x)∣≤∥x∥/r. Also F(v)=1.

5.1step 4.1F3algebra

Over R put f=F. Over C put f(x)=F(x)−iF(ix); reconstruction gives complex linearity and real part F, and ∣f(x)∣≤∣F(x)∣+∣F(ix)∣≤2∥x∥/r. Thus in either field f∈X∗, and it is nonzero because Re⁡f(v)=1. The explicit bounds give continuity: ∣f(x)−f(y)∣≤(2/r)∥x−y∥ in both cases.

6.1step 1.1step 2.1step 4.1step 5.1algebra∎

For every c∈C, c−c0∈U, so F(c−c0)≤p(c−c0)<1=F(z−c0). Adding F(c0) gives Re⁡f(c)=F(c)<F(z)=Re⁡f(z), as required.

Source notes

Brezis Lemma 1.3, pp.6–7; Teschl Theorems 5.2–5.3, pp.138–139.

Remarks

The continuity estimate uses both p(x) and p(−x). It does not infer ∣F(x)∣≤p(x) from F(x)≤p(x).

Depends on

Used by

Dependency tree · two levels

11 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