Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14
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.

Bishop phelps

Statement

Assume the Axiom of Dependent Choice (DC) and the relative Hahn–Banach principle HB.

  1. If C is a nonempty closed bounded convex subset of a real Banach space X, then the real-linear functionals attaining their supremum on C are norm dense in X.
  2. Consequently, the norm-attaining functionals are norm dense in the dual of every real Banach space.
  3. The norm-attaining complex-linear functionals are also norm dense in the dual of every complex Banach space.

The third claim concerns the closed unit ball only; no complex analogue for an arbitrary convex set is asserted.

Facts & Assumptions

Given: DC, HB, and the real or complex Banach spaces and positive approximation tolerances occurring in the statement.

[F1]

Under DC and HB, for a nonempty closed bounded convex set C in a real Banach space, every fX and ε>0 admit vC and gX with gf<ε and g(c)g(v) for every cC (Quantitative Bishop–Phelps support functional construction, The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain, The real dominated-extension principle as an additional hypothesis over ZF).

[F2]

For a real or complex normed space, the dual norm is f=supxBXf(x) (The dual space X^* of a normed space and its dual norm).

Proof

Proof technique: quantitative approximation followed by unit-ball symmetry and complexification.

1.1

Let X be real, let C be as in claim 1, and fix fX and ε>0. By [F1] there are vC and gX such that gf<ε and g(c)g(v) for every cC. Thus g(v)=supCg, and arbitrary f and ε prove the asserted norm density.

givenF1
1.2

Now let X be complex and write XR for its realification. For u(XR) define Uu(x)=u(x)iu(ix). Real linearity gives Uu(ix)=iUu(x) and ReUu=u. For any x, choose a unit scalar a with aUu(x)=Uu(x) when the value is nonzero, and take a=1 otherwise. Then Uu(x)=u(ax)ux, while u(x)Uu(x); therefore UuX and Uu=u. The correspondence is real-linear, and for complex-linear f, URef=f.

F2constructalgebra
2.1

Take C=BX in step 1.1. Since BX is symmetric, supxBXg(x)=supxBXg(x)=g by [F2]. Hence the approximating g satisfies g(v)=g at some vBX and is norm-attaining. This includes g=0, which attains norm zero at zero.

step 1.1F2algebra
2.2

Fix fX and ε>0. Apply the real claim 1 to the same set BX inside XR and to Ref. It gives a real functional u and vBX with uRef<ε and u(x)u(v) on BX. Put G=Uu. Step 1.2 applied to uRef gives Gf<ε. Because the complex unit ball is symmetric, [F2] and step 1.2 give u(v)=supBXu=u=G. But ReG(v)=u(v)=G and G(v)G, so G(v)=G and G attains its norm.

step 1.1step 1.2F2givenalgebra
3.1

The three density assertions follow from steps 1.1, 2.1 and 2.2. If X={0}, its unique functional is zero and already norm-attaining. The proof uses DC and HB only through [F1]; the realification and complexification are explicit and use no choice. The general convex-set conclusion remains real, while the complex conclusion is exactly the unit-ball norm-attainment assertion.

step 1.1step 2.1step 1.2step 2.2F1

Source notes

Loewen–Wang Proposition 5.1(i) derives density of convex subgradients from Ekeland's variational principle, and Theorem 5.2 states the real Bishop–Phelps theorem for nonempty closed bounded convex sets. The complex unit-ball clause is proved locally by the explicit real-dual/complex-dual correspondence; the source is not cited for a general complex convex-set theorem.

Depends on

Used by

Dependency tree · two levels

20 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