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.
Lossless or midpoint-conductive Yee leapfrog update
Definition
Choose a finite complex and boundary closure as in Oriented Maxwell cochains, masses, and the Yee grid, step size , initial and , and source rows . The output is a sequence at integer times and at half-integer times. For each , perform the ordered instructions
-
Update the face flux by
-
Solve the electric row
For this is the lossless Yee leapfrog scheme. For , the midpoint term is the specified trapezoidal treatment of conductivity. The row is well defined for every input because its matrix is invertible by The midpoint-conductivity Yee electric solve is well defined. This procedure makes no stability claim; the lossless stability condition is proved separately.
Depends on
Used by
- A current violating discrete continuity creates Gauss-law drift Example
- Second-order consistency of the homogeneous periodic Yee scheme Lemma
- Cartesian Yee symbol, numerical dispersion, and grid CFL bound Theorem
- Compatible discrete charge and magnetic divergence propagate Theorem
- Finite-time Yee error for smooth homogeneous periodic Maxwell fields Theorem
- Midpoint conductivity dissipates the Yee discrete energy Theorem
- Strict spectral CFL positivity and Yee modified energy Theorem
Dependency tree · two levels
3 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
- John B. Schneider, Understanding the Finite-Difference Time-Domain Method (standard reference, not scraped)