Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-21
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 Euclidean maps are closed under componentwise algebra and composition

Statement

Let kN. Finite componentwise sums and products of Ck Euclidean maps are Ck, and a composite of composable Ck Euclidean maps is Ck. Scalar multiples are included among the finite componentwise operations. The assertions remain valid on an empty open domain.

Facts & Assumptions

Given: Open Euclidean domains and maps for which the displayed sums, products, scalar multiples, or composites are defined. We use induction on derivative order (The principle of mathematical induction).

[F1]

A map f:URq is of class Ck when each component is of class Ck (Ck Euclidean maps and diffeomorphisms).

[L1]

If f is totally differentiable at a and g is totally differentiable at f(a), then gf is totally differentiable at a and D(gf)(a)=Dg(f(a))Df(a) (The chain rule for total derivatives: D(gf)(a)=Dg(f(a))Df(a)).

[L3]

If every first partial derivative exists near a point and is continuous there, then the map is totally differentiable there and its total derivative has matrix equal to its Jacobian (If all partial derivatives exist on a neighbourhood and are continuous at a point, then the map is totally differentiable there with Jacobian derivative).

[L5]

Total differentiability gives every directional and partial derivative by applying the total derivative to the corresponding direction vector (A total derivative computes every directional derivative, and its matrix is the Jacobian).

Proof

technique · induction
1.1

At order k=0, [F1] reduces the assertions to scalar component functions, and [L4] supplies closure under the stated operations; on an empty domain all these assertions are vacuous.

F1L4givenbase
1.2

Fix rN and assume that all the closure assertions hold through order r.

ih
2.1

Consider maps of class Cr+1. For a sum, scalar multiple, or componentwise product, [L2] on each coordinate line expresses every first partial derivative as a finite sum of products of Cr functions. For a composite, [L3] supplies total differentiability, [L1] gives its total derivative, and [L5] identifies the first partials with the columns of that derivative; hence every first partial is a finite sum of products of first partials of the factors. The hypothesis in step 1.2 makes all these first partials Cr, so [F1] makes the resulting maps Cr+1. Together with the base case, this proves the result through every finite k.

step 1.1step 1.2F1L1L2L3L5givenalgebradischarge-induction

Depends on

Used by

Dependency tree · two levels

45 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