Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (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.

Gateaux and Frechet derivatives of a functional

Definition

Let X be a real Banach space, U⊆X open and F:U→R. Frechet differentiability. F is Frechet differentiable at u∈U if there is a bounded linear functional DF(u)∈X∗ (Fréchet derivative between Banach spaces, A bounded linear operator between normed spaces, The dual space X^* of a normed space and its dual norm) with F(u+h)=F(u)+DF(u)h+o(∥h∥)(h→0), that is, lim⁡h→0∣F(u+h)−F(u)−DF(u)h∣/∥h∥=0; such DF(u) is unique. Gateaux differentiability. F is Gateaux differentiable at u in the direction v∈X if the limit δF(u;v):=lim⁡ε→0, ε≠0F(u+εv)−F(u)ε∈R exists; F is Gateaux differentiable at u if that limit exists for every v∈X and the resulting map v↦δF(u;v) is a bounded linear functional, written δF(u)∈X∗ and called the Gateaux (variational) derivative of F at u. Relation and caveat. Frechet differentiability at u implies Gateaux differentiability at u with δF(u)=DF(u), because F(u+εv)−F(u)=DF(u)(εv)+o(∣ε∣); the converse fails, and the directional limits δF(u;v) need not be linear or bounded in v when only the one-dimensional limits exist. For each fixed v the function φ(ε):=F(u+εv) satisfies φ′(0)=δF(u;v).

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