Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-09
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.

Reduction of higher-order normal form with jet compatibility

Statement

For the scalar solved normal equation of order m1 with allowed jets α+jm, j<m, introduce Uβ for all (d+1)-multi-indices βm1. With data U(α,j)(0,x)=xαgj(x) there is an analytic first-order system involving only these U and their first spatial derivatives whose analytic solution satisfies Uβ=DβU0. Thus this system and the original scalar equation with its m data are equivalent.

Facts & Assumptions

Given: The scalar analytic solved normal equation of order m1 with allowed jets α+jm, j<m, and analytic data gj. The proposed vector data are U(α,j)(0,x)=xαgj(x).

[F1]

Scalar normal form and first-order systems determine unique formal series after analytic data subtraction. (Formal recursion for solved analytic normal equations).

[F2]

Analytic first-order systems with analytic data have unique analytic solution germs. (Cauchy–Kovalevskaya for first-order analytic systems).

[F3]

Mixed derivatives commute for analytic functions. (Continuous mixed partials of order k are invariant under permutations).

[F4]

Analytic finite ODE systems have unique analytic solution germs. (Analytic ODE systems from majorants).

Proof

1.1

For βm2 prescribe tUβ=Uβ+et. For β=m1 other than (m1)et, choose the least spatial i with βi>0 and prescribe tUβ=iUβei+et. For β=(m1)et, prescribe tUβ=F, replacing jets of order at most m-1 by U, and each allowed order-m jet γ by iUγei using the least spatial i with γi>0. Such i exists because the pure m-time jet is excluded. Thus every right side uses only U and first spatial derivatives of U.

givenalgebra
2.1

The prescribed data are analytic derivatives of the g_j, and the finite right-hand side is analytic near their compatible initial jet. For d1, F2 supplies a unique analytic vector U. If d=0, there are no spatial derivatives or mixed jets, and F4 supplies that vector as an analytic ODE solution. Independently F1 supplies the scalar formal solution u for the original data. Formal differentiation shows that Dβu solves every equation in step 1.1 and has initial trace xαgj. The first-order formal uniqueness clause of F1 therefore identifies the Taylor series of each analytic U_beta with Dβu.

step 1.1F1F2F4
3.1

In particular the Taylor series of U_0 is u. Differentiating its convergent series shows DβU0 and U_beta have identical Taylor series; hence they coincide on a smaller neighborhood. Substituting in the pure-time equation in step 1.1 yields the scalar equation, and its first m data follow from the traces of U_{je_t}. Conversely for any analytic scalar solution, F3 makes its actual derivative vector satisfy every equation and datum in step 1.1. These constructions are inverse, including m=1 when the sole unknown is U_0 and the pure-time equation is the original equation.

step 1.1step 2.1F3

Remarks

When the scalar right side is affine in its highest-order jets, the displayed vector system is quasilinear: the substitutions in step 1.1 put every highest jet into a first spatial derivative, with coefficients depending only on the coordinates and lower jets U. The nonlinear first-order theorem used in step 2.1 also handles general analytic dependence on those derivatives. Setting the number of spatial variables to zero leaves the familiar higher-order ODE chain U0=U1,,Um2=Um1,Um1=F.

Source notes

Gantumur, §4 Corollary 20 and proof, equations (53)–(57), printed p. 11. The compatibility recovery is proved by formal uniqueness below.

Depends on

Used by

Dependency tree · two levels

13 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