Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicableSession-authored (Fable 5 assisted)audited 2026-08-02
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.

CkC^k maps and multi-index derivative notation in Euclidean space

Definition

Let m1m\ge1, let URmU\subseteq\mathbb R^m be open, and let f:URf:U\to\mathbb R. A multi-index is α=(α0,,αm1)Nm\alpha=(\alpha_0,\ldots,\alpha_{m-1})\in\mathbb N^m. Put

α:=i<mαi,α!:=i<mαi!,hα:=i<mhiαi(hRm).|\alpha|:=\sum_{i<m}\alpha_i,\qquad \alpha!:=\prod_{i<m}\alpha_i!,\qquad h^\alpha:=\prod_{i<m}h_i^{\alpha_i}\quad(h\in\mathbb R^m).

Here α|\alpha| and α!\alpha! use the natural-number sum and product of Finite sums and finite products of natural numbers, k<nak\sum_{k<n} a_k and k<nak\prod_{k<n} a_k in N\mathbb{N}, and n!n! is the factorial of The factorial n!n! and the falling factorial nkn^{\underline{k}}, defined by recursion in N\mathbb{N}. By contrast, hαh^\alpha is the finite product in R\mathbb R of Finite sums and finite products, by recursion, with the natural exponents interpreted by Integer powers ama^m. For the zero multi-index 00, set D0f:=fD^0f:=f. For nonzero α\alpha, write

Dαf:=0α0m1αm1fD^\alpha f:=\partial_0^{\alpha_0}\cdots\partial_{m-1}^{\alpha_{m-1}}f

for this displayed, canonical order whenever it exists. Coordinate partial derivatives have the meaning fixed in Directional derivatives and partial derivatives of a map URmRnU\subseteq\mathbb{R}^m\to\mathbb{R}^n.

For kNk\in\mathbb N, ff is of class CkC^k on UU when, for every word (i1,,ir)(i_1,\ldots,i_r) of coordinate indices with 0rk0\le r\le k, the iterated derivative iri1f\partial_{i_r}\cdots\partial_{i_1}f exists and is continuous on UU; the word of length 00 denotes ff. Thus this definition does not presuppose that differently ordered derivatives are equal. Equality of their values is a later theorem under these regularity hypotheses.

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 108 results over 28 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources