Alphabeta Math
TheoremStatement: 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 geometric Hahn–Banach with the exact open, closed, and compact hypotheses

Statement

Assume HB. Let A,B be disjoint nonempty convex subsets of a real or complex normed space X.

(i) If A is open, there are 0fX and aR with Ref(x)<aRef(y)(xA, yB). If B is also open, the right inequality is strict too. If only B is open, interchange the labels and negate the functional to put the strict inequality on the B side.

(ii) If A is closed and B is compact, there are 0fX, aR, and ε>0 with Ref(x)aε<a+εRef(y)(xA, yB). In particular, a point outside a nonempty closed convex set is uniformly strictly separated from it. All inequalities concern real parts.

Facts & Assumptions

[F1]

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).

[F2]

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).

[F3]

Convexity uses real weights; for 0fX, u=Ref 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).

[F4]

A supremum of a nonempty upper-bounded real set has elements within every positive error from below (Epsilon characterisation of the supremum).

[F5]

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 X, and disjoint nonempty convex A,B, with the additional hypotheses of each part.

1.1

For (i), put D=AB={xy:xA,yB}. It is nonempty. For xjyjD and 0t1, their convex combination equals ((1t)x1+tx2)((1t)y1+ty2)D. If xyD, choose r>0 with B(x,r)A; then B(xy,r)D by keeping y fixed. Thus D is open and convex. If 0D, then some xA equals some yB, contrary to disjointness; hence 0D.

givenF3algebra
1.2

For (ii), now suppose A is closed and B compact. The distance-gap lemma applied with K=B,C=A gives δ>0 with xyδ for all xA,yB. Put ρ=δ/2 and O=A+B(0,ρ). The ball is convex by the triangle inequality, so for xj+hjO each convex combination has its A component in A and its ball component of norm less than ρ, including the weights zero and one. Thus O is convex. A ball about x+h of radius ρh stays in O, so O is open; it contains nonempty A. If x+h=yB, then xy=h<ρ<δ, impossible. Therefore O and B are disjoint.

givenF2F3algebra
2.1

For (i), apply point separation to D and 0. It gives 0fX with u(d)<u(0)=0 for every dD, where u=Ref is nonzero bounded real-linear. Consequently u(x)<u(y) for every xA,yB. Fix y0B. The nonempty real set u(A) is bounded above by u(y0), so it has a real supremum a0. Explicitly, a0=inf(u(A)); reflection of lower bounds makes this the least upper bound. Since every u(y) bounds u(A), a0u(y) for all yB.

step 1.1F1F3F5
3.1

For (i), fix a vector v with u(v)>0: nonzero u has a nonzero value, and negation makes that value positive. For each fixed xA, choose rx>0 with B(x,rx)A and set t=rx/(2v)>0. Then x+tvA and u(x)<u(x)+tu(v)=u(x+tv)a0. This proves the strict left inequality. If B is open, for each yB choose sy>0 with B(y,sy)B and set t=sy/(2v). Then ytvB, and step 2.1 gives a0u(ytv)<u(y). Thus both inequalities are strict in that case.

step 2.1algebra
4.1

If only B is open, apply the result just proved to (B,A) to get a functional g and level b with Reg(y)<bReg(x) for yB,xA. Taking f=g and a=b gives Ref(x)a<Ref(y). This completes (i) in each orientation.

step 2.1step 3.1algebra
4.2

For (ii), apply the already proved open-side assertion to (O,B). It gives 0fX and a0R with u(x)+u(h)<a0u(y) whenever xA, h<ρ, and yB, where u=Ref0. Regard u as a member of the real dual of the underlying normed space, and let N=u=supv1u(v). The bound u(v)fv makes this supremum finite, and a normalized vector with nonzero value shows N>0.

step 2.1step 3.1step 1.2F3
5.1

Continuing (ii), we show suph<ρu(h)=ρN. Normalization gives u(h)u(h)NhρN (including h=0). For any q<ρN with q<0, h=0 has u(h)>q. For 0q<ρN, use the supremum criterion for N with error Nq/ρ>0 to obtain v with v1 and u(v)>q/ρ. Let w=v if u(v)>0 and w=v otherwise; then m=u(w)=u(v)>0. Set t=(q/m+ρ)/2, which satisfies 0<t<ρ and tm>q. Thus h=tw has h<ρ and u(h)>q. No number smaller than ρN is an upper bound, proving the identity.

step 4.2F4algebra
6.1

For (ii), for each fixed xA, step 4.2 says a0u(x) is an upper bound for all u(h) with h<ρ. The identity just proved yields u(x)+ρNa0. Put ε=ρN/2>0 and a=a0ε. Then u(x)a0ρN=aε, while a+ε=a0u(y) for every yB. Since ε>0, these are precisely the required uniform strict separation inequalities.

step 4.2step 5.1F3algebra
7.1

Finally, if z lies outside a nonempty closed convex A, the set B={z} is nonempty, disjoint from A, and convex since (1t)z+tz=z. It is intrinsically compact: any open cover of its one-point metric space has a member containing z, 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.

step 1.2step 6.1algebra

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