Alphabeta Math
ExampleConstruction: AI-adaptedVerification: 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.

A codimension-one subspace can admit many norm-preserving Hahn-Banach extensions

Example

Let X=(R2,∥⋅∥∞), let M:=span⁡{(1,1)}, and define f0:M→R by f0(t,t)=t. Then ∥f0∥=1, and for every c∈[−1,1] the formula

Fc(a,b):=1+c2a+1−c2b

defines a norm-preserving extension of f0 to all of X. So a codimension-one subspace can have infinitely many Hahn-Banach extensions of the same norm.

Facts & Assumptions

Given: The normed space X=(R2,∥⋅∥∞), the diagonal subspace M=span⁡{(1,1)}, and the functional f0(t,t)=t.

[L1]

In a one-step Hahn-Banach extension, the admissible values form a nonempty interval (The admissible values in a one-step Hahn-Banach extension form a nonempty interval).

[L2]

Verification

technique · direct
1.1givenalgebra

For (t,t)∈M one has ∣f0(t,t)∣=∣t∣=∥(t,t)∥∞, so ∥f0∥=1. Also every (a,b)∈R2 decomposes as (a,b)=a+b2(1,1)+a−b2(1,−1), so X=M⊕R(1,−1).

2.1step 1.1givenconstructalgebra

If F is a linear extension of f0 and c:=F(1,−1), then step 1.1 forces F(a,b)=a+b2F(1,1)+a−b2F(1,−1)=1+c2a+1−c2b. Conversely, the displayed formula defines a linear functional extending f0.

3.1step 2.1algebra

Let φ(a,b):=αa+βb on (R2,∥⋅∥∞). If ∥(a,b)∥∞≤1, then ∣φ(a,b)∣≤∣α∣ ∣a∣+∣β∣ ∣b∣≤∣α∣+∣β∣. Choosing a=sgn⁡α and b=sgn⁡β (interpreting sgn⁡0=0) gives ∥(a,b)∥∞≤1 and ∣φ(a,b)∣=∣α∣+∣β∣, so ∥φ∥=∣α∣+∣β∣. Applying this to the formula from step 2.1 yields ∥Fc∥=∣1+c∣+∣1−c∣2. This equals 1 exactly when −1≤c≤1.

4.1L1L2step 3.1∎

Therefore every c∈[−1,1] gives a norm-preserving extension of f0. This computes explicitly the admissible interval predicted abstractly by [L1], and in particular is consistent with the existence statement of [L2].

Depends on

Used by

Dependency tree · two levels

10 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