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.

The open convex gauge is sublinear and recovers its set

Statement

Let U be an open convex neighbourhood of zero in a real or complex normed space X, and fix r>0 with B(0,r)⊆U. Its gauge satisfies 0≤pU(x)≤∥x∥/r,pU(tx)=tpU(x)(t≥0), pU(x+y)≤pU(x)+pU(y),U={x:pU(x)<1}, ∣pU(x)−pU(y)∣≤∥x−y∥/r. In particular it is a sublinear functional on the underlying real space. No symmetry identity is asserted.

Facts & Assumptions

[F1]

pU(x)=inf⁡Sx for the nonempty positive admissible-scale set Sx, and pU(0)=0 (The finite gauge of an open convex neighbourhood of zero).

[F2]

For a nonempty lower-bounded real set and a lower bound l, one has l=inf⁡S if and only if for each ε>0 there is s∈S with s<l+ε (Epsilon characterisation of the infimum).

[F3]

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 U⊆X with 0∈U and r>0 such that B(0,r)⊆U.

1.1givenF1algebra

Write p=pU. The gauge definition gives p(x)≥0. For every t>∥x∥/r one has x/t∈B(0,r)⊆U, so p(x)≤t. If p(x)>∥x∥/r, their midpoint is such a t smaller than p(x), impossible. Hence p(x)≤∥x∥/r.

1.2F1F2algebra

For a>0, the condition s∈Sax is equivalent to s/a∈Sx, so Sax=aSx. The number ap(x) is a lower bound of this set. Conversely, for every ε>0, choose t∈Sx with t<p(x)+ε/a; then at∈Sax and at<ap(x)+ε. The infimum criterion gives p(ax)=ap(x). For a=0, both sides are zero by p(0)=0.

1.3F1F2algebra

If s>p(x), choose s′∈Sx with s′<s using the infimum criterion with ε=s−p(x). Since 0<s′/s<1, convexity and 0∈U give x/s=(s′/s)(x/s′)+(1−s′/s)0∈U. Thus every s>p(x) is admissible.

1.4F1F2algebra

If p(x)<1, choose s∈Sx with s<1 using the infimum criterion with ε=1−p(x). Then 0<s<1 and x=s(x/s)+(1−s)0∈U by convexity.

2.1step 1.2step 1.3F1F3algebra

Given ε>0, set s=p(x)+ε and t=p(y)+ε. Both are positive and admissible by step 1.3. Convexity gives (x+y)/(s+t)=(s/(s+t))(x/s)+(t/(s+t))(y/t)∈U. Hence p(x+y)≤s+t=p(x)+p(y)+2ε. If the desired inequality failed with positive difference d, taking ε=d/4 would give d≤d/2. Therefore p(x+y)≤p(x)+p(y). Together with step 1.2, this is sublinearity on the real space.

2.2step 1.4F1algebra

Conversely, let x∈U. For x=0, p(x)=0<1. If x≠0, openness gives η>0 with B(x,η)⊆U. Put d=η/(2∥x∥)>0. Since ∥(1+d)x−x∥=η/2, (1+d)x∈U, so 1/(1+d)∈Sx and p(x)≤1/(1+d)<1. This proves both inclusions in the asserted set equality.

3.1step 1.1step 2.1algebra∎

Subadditivity gives p(x)−p(y)≤p(x−y)≤∥x−y∥/r and, with x,y interchanged, p(y)−p(x)≤p(y−x)≤∥x−y∥/r. These two real inequalities yield the Lipschitz bound. When x=y both differences are zero; no use of p(−v)=p(v) 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