Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 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.

Continuous mixed partials of order k are invariant under permutations

Statement

Let k≥2. If f∈Ck(U) for an open U⊆Rm, then every iterated derivative of f of order k is unchanged by any permutation of its coordinate differentiations.

Facts & Assumptions

Given: A Ck scalar field on U and a word of k coordinate indices.

[L1]

Adjacent second coordinate derivatives commute under the C2 hypotheses (Clairaut--Schwarz theorem for continuous second partial derivatives).

[L2]

A Ck field has every ordered iterated partial derivative through length k, continuously on U (Ck maps and multi-index derivative notation in Euclidean space).

Proof

technique · induction
1.1basealgebra

Label the k differentiation positions and count inversions of a permutation of these labels. A permutation with zero inversions is the identity, so it leaves the derivative unchanged.

1.2ih

Assume every reordering with at most n inversions leaves the derivative unchanged.

2.1step 1.2L1L2algebra

A reordering with n+1 inversions has an adjacent inverted pair; exchanging that pair reduces its inversion count by one. If that pair occupies positions r,r+1 in the sequence of differentiation operations, first apply only the operations in positions 1,…,r−1 and call the resulting field g. Every ordered partial of g through order two is an ordered partial of f of length at most k, hence is continuous by [L2]; thus g∈C2(U) and [L1] swaps precisely the operations in positions r,r+1. Apply the remaining outer operations in positions r+2,…,k to this equality; their existence is again supplied by [L2].

3.1step 1.1step 1.2step 2.1discharge-induction∎

The induction hypothesis applies after the swap in step 2.1, so the original reordering leaves the derivative unchanged. Induction on inversion number proves the claim for every finite permutation.

Depends on

Dependency tree · 2 levels

Sources