LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-05

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 admissible values in a one-step Hahn-Banach extension form a nonempty interval

Statement

Let $X$ be a real vector space, let $M \subseteq X$ be a linear subspace, let $p : X \to R$ be sublinear, and let $f : M \to R$ be linear with $f (m) \leq p (m)$ for every $m \in M$ . Fix $x_{0} \in X ∖ M$ and put $N : = M + R x_{0}$ .

For $c \in R$ define

$F_{c} (m + t x_{0}) : = f (m) + t c (m \in M, t \in R) .$

This is well defined, and with

$α : = \sup_{y \in M} (f (y) - p (y - x_{0})), β : = \inf_{z \in M} (p (z + x_{0}) - f (z)),$

one has $α \leq β$ . Moreover, $F_{c} (n) \leq p (n)$ for every $n \in N$ if and only if $α \leq c \leq β$ . In particular the admissible values of $F_{c} (x_{0}) = c$ form the nonempty interval $[α, β]$ .

Facts & Assumptions

Given: A real vector space $X$ , a linear subspace $M \subseteq X$ , a sublinear functional $p : X \to R$ , a linear functional $f : M \to R$ with $f \leq p$ on $M$ , and a point $x_{0} \in X ∖ M$ .

[L1]

A sublinear functional satisfies $p (u + v) \leq p (u) + p (v)$ and $p (t u) = t p (u)$ for every real $t \geq 0$ (A sublinear functional on a real vector space).

[L2]

A linear functional is additive and homogeneous over the scalar field (Linear functionals and the algebraic dual $V^{*} = L (V, F)$ ).

[L3]

A linear subspace is closed under addition and scalar multiplication (Linear subspace of a vector space).

Proof

technique · direct

1.1L3givenconstruct

If $m + t x_{0} = m^{'} + t^{'} x_{0}$ with $m, m^{'} \in M$ and $t, t^{'} \in R$ , then $m - m^{'} = (t^{'} - t) x_{0} \in M$ . If $t \neq t^{'}$ , closure under scalar multiplication from [L3] gives $x_{0} \in M$ , contradicting the hypothesis. So $t = t^{'}$ and then $m = m^{'}$ . Therefore every element of $N$ has a unique representation $m + t x_{0}$ , and $F_{c}$ is well defined.

1.2L2givenalgebra

For $y, z \in M$ , one has $F_{c} (y - x_{0}) = f (y) - c and F_{c} (z + x_{0}) = f (z) + c .$ Therefore $F_{c} (y - x_{0}) \leq p (y - x_{0}) ⟺ f (y) - p (y - x_{0}) \leq c,$ and $F_{c} (z + x_{0}) \leq p (z + x_{0}) ⟺ c \leq p (z + x_{0}) - f (z) .$

1.3L1L2L3givenalgebra

Let $y, z \in M$ . Since $y + z \in M$ by [L3], linearity and domination on $M$ give $f (y) + f (z) = f (y + z) \leq p (y + z) .$ Also $y + z = (y - x_{0}) + (z + x_{0}),$ so subadditivity from [L1] yields $p (y + z) \leq p (y - x_{0}) + p (z + x_{0}) .$ Combining these inequalities gives $f (y) - p (y - x_{0}) \leq p (z + x_{0}) - f (z) .$ Hence every lower endpoint is at most every upper endpoint.

2.1step 1.2L1L2givenalgebra

Suppose first that the two inequalities from step 1.2 hold for every $y, z \in M$ . Let $m + t x_{0} \in N$ . If $t > 0$ , then $m + t x_{0} = t (\frac{m}{t} + x_{0}),$ so by linearity and positive homogeneity, $F_{c} (m + t x_{0}) = t F_{c} (\frac{m}{t} + x_{0}) \leq t p (\frac{m}{t} + x_{0}) = p (m + t x_{0}) .$ If $t < 0$ , then $m + t x_{0} = (- t) (\frac{- m}{t} - x_{0}),$ so the lower-bound half of step 1.2 applied to $y : = - m / t$ gives $F_{c} (m + t x_{0}) = (- t) F_{c} (\frac{- m}{t} - x_{0}) \leq (- t) p (\frac{- m}{t} - x_{0}) = p (m + t x_{0}) .$ If $t = 0$ , then $m + t x_{0} = m \in M$ , so the hypothesis $f \leq p$ gives $F_{c} (m) = f (m) \leq p (m)$ . Thus $F_{c} \leq p$ on $N$ . Conversely, if $F_{c} \leq p$ on $N$ , then applying that inequality to $y - x_{0}$ and $z + x_{0}$ yields the two inequalities in step 1.2.

3.1step 2.1step 1.3∎

Step 1.3 shows that the set of lower endpoints is bounded above by every upper endpoint, and the set of upper endpoints is bounded below by every lower endpoint. Completeness of $R$ therefore gives real numbers $α \leq β$ with the displayed formulas in the statement. By step 2.1, a real number $c$ is admissible exactly when it lies between every lower endpoint and every upper endpoint, that is, exactly when $α \leq c \leq β$ . Therefore the admissible values form the nonempty interval $[α, β]$ .

Depends on

Used by

Dependency tree · two levels

9 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

Daniel Daners, Introduction to Functional Analysis, Theorem 26.1(a) (standard reference, not scraped)
Gerald Teschl, Topics in Real and Functional Analysis, Section 4.2 (standard reference, not scraped)