Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)
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.

Banach-space convex subgradients and dual pairings

Definition

Let X be a real Banach space and let X∗ be its continuous real dual. The dual pairing is evaluation, written ⟨ξ,x⟩X∗,X:=ξ(x) for ξ∈X∗ and x∈X. Let R:X→(−∞,+∞] be a proper convex functional: R never takes the value −∞, its effective domain dom⁡R:={x∈X:R(x)<+∞} is nonempty, and R((1−t)x+tz)≤(1−t)R(x)+tR(z) for x,z∈X and t∈[0,1], with 0⋅(+∞):=0 for this convex-combination formula. For x∈dom⁡R, its subdifferential is

∂R(x):={ξ∈X∗:R(z)≥R(x)+⟨ξ,z−x⟩X∗,X for every z∈X}.

An element of ∂R(x) is a subgradient of R at x. Set ∂R(x):=∅ when x∉dom⁡R. The subdifferential may be empty at a point of dom⁡R; no nonemptiness assertion is part of this definition.

Depends on

Used by

Dependency tree · two levels

17 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