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.
A regular index-one DAE has a local reduced ODE branch
Statement
Let , let be open, and let , be for . Suppose and is invertible. Then there are neighborhoods of and of , and a unique map , such that, for and ,
Its derivatives satisfy
with the derivatives of evaluated at . The reduced vector field is on . Thus solutions of the DAE that stay in this selected chart are exactly solutions of paired with .
Facts & Assumptions
Given: The dimensions, open domain, maps, root, and invertible algebraic Jacobian in the Statement.
Semi-explicit index-one DAEs and consistent initial data: a semi-explicit DAE is , ; a consistent pair satisfies .
The parametrized implicit function theorem with regularity: for a map whose derivative in the unknown block is invertible at a zero, there are neighborhoods and a unique implicit branch, with derivative .
The chain rule for total derivatives: : the derivative of a composite is the composition of the derivatives.
Proof
Treat as the parameter block and as the unknown block in [F2]. Its hypotheses hold because is , , and is invertible. Therefore [F2] gives neighborhoods and a unique function with the stated equivalence and derivative formula. Splitting that combined derivative into its and blocks gives the two displayed identities.
Differentiating in the direction using [F3] gives ; multiplying by gives . Differentiating in each direction gives , hence .
The map is , so [F3] applied to its composition with the map shows is . On the selected chart the equivalence in step 1.1 forces every DAE solution to have , and substitution gives ; conversely, a reduced solution paired with satisfies both DAE equations.
Depends on
Used by
- Finite-budget coupled backward Euler for an index-one DAE Algorithm
- Finite-budget coupled constant-step BDF2 for an index-one DAE Algorithm
- Finite-budget index-one DAE consistent initialization Algorithm
- A capacitor-resistor circuit has one consistent algebraic current Example
- An index-one algebraic residual locally bounds algebraic state error Lemma
- The coupled index-one backward-Euler equations have a local branch Lemma
- The coupled index-one constant-step BDF2 equations have a local branch Lemma
- Coupled backward Euler is first order for a regular index-one DAE Theorem
- Coupled constant-step BDF2 is second order for a regular index-one DAE Theorem
Cited to discharge well-definedness by Semi-explicit index-one DAEs and consistent initial data.
Dependency tree · two levels
14 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
- Ernst Hairer and Gerhard Wanner, Solving Ordinary Differential Equations II, Chapter VI §VI.1, Solving Index 1 Problems, pp. 372–381 (standard reference, not scraped)
- Kendall Atkinson, Weimin Han, and David Stewart, Numerical Solution of Ordinary Differential Equations, Chapter 10 §10.3 (standard reference, not scraped)