Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 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.

Ck maps and multi-index derivative notation in Euclidean space

Definition

Let m≥1, let U⊆Rm be open, and let f:U→R. A multi-index is α=(α0,…,αm−1)∈Nm. Put

∣α∣:=∑i<mαi,α!:=∏i<mαi!,hα:=∏i<mhiαi(h∈Rm).

Here ∣α∣ and α! use the natural-number sum and product of Finite sums and finite products of natural numbers, ∑k<nak and ∏k<nak in N, and n! is the factorial of The factorial n! and the falling factorial nk‾, defined by recursion in N. By contrast, hα is the finite product in R of Finite sums and finite products, by recursion, with the natural exponents interpreted by Integer powers am. For the zero multi-index 0, set D0f:=f. For nonzero α, write

Dαf:=∂0α0⋯∂m−1αm−1f

for this displayed, canonical order whenever it exists. Coordinate partial derivatives have the meaning fixed in Directional derivatives and partial derivatives of a map U⊆Rm→Rn.

For k∈N, f is of class Ck on U when, for every word (i1,…,ir) of coordinate indices with 0≤r≤k, the iterated derivative ∂ir⋯∂i1f exists and is continuous on U; the word of length 0 denotes f. 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

…and 20 more results.

Dependency tree · two levels

39 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