Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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.

Differentiation index for a regular local semi-explicit DAE

Definition

Fix a semi-explicit presentation x′=f(t,x,z), 0=g(t,x,z) as in Semi-explicit index-one DAEs and consistent initial data and a sufficiently differentiable consistent local solution. Differentiate the algebraic constraint along the differential equation, substituting x′=f(t,x,z) and any previously obtained derivative relations at each stage. The differentiation index in this convention is the least positive integer k for which the original constraint and its first k differentiated equations locally determine z and z′, with the equation for the highest derivative of z having an invertible square Jacobian on a neighborhood of the solution. If no such finite k exists, this local index is undefined. This convention counts through the first derivative of the algebraic variables and is local to the fixed presentation; it is not a universal index theory for arbitrary implicit systems.

If gz is invertible, one differentiation gives

gt+gxf+gzz′=0,

which determines z′, so the index is one. If gz is singular, the index must be checked from the actual differentiated equations; no index-one conclusion follows from this definition alone.

Depends on

Used by

Dependency tree · two levels

2 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