01
The problems
| Poisson | −u″ = f on (0, L) with Dirichlet, Neumann or Robin conditions at each end (Neumann at both ends: the projected problem, normalised by ∫u = 0); P1 linear elements on any mesh with rational nodes. |
| Beam | u⁗ = f on (0, L) with clamped, pinned, free or sliding ends in any combination; cubic Hermite elements carrying nodal values and slopes. |
| Loads | Sums and products of polynomials, eλx, sin and cos (also of qπx); the checker re-encloses them with Taylor models and never trusts the solver’s quadrature. |
| Why 1D | Green’s functions and classical solutions avoid Sobolev spaces, so every statement can be about the true solution; 2D will need an H¹ model in Lean. |
02
Claims in the trust ledger
| Claim | Statement | Tier |
|---|---|---|
| FEM-C01 | Poisson: the Green representation is a classical solution, and the only one | T3 |
| FEM-D01 | P1 nodal exactness and the discrete Green representation | T3 |
| FEM-D02 | Pointwise error inside an element: Mh²/8 plus the nodal error | T3 |
| FEM-D03 | Céa’s lemma (abstract setting, in preparation for 2D) | T3 |
| FEM-D04 | Discrete maximum principle | T3 |
| FEM-C02 | Beam: the classical solution exists and is unique | T3 |
| FEM-D05 | Discrete stability of Hermite elements (no maximum principle needed) | T3 |
| FEM-D06 | Hermite nodal exactness and the h⁴/384 interpolation bound | T3 |
| FEM-B02 | Taylor models of the load are sound | T4 |
| FEM-B01 | P1 checker soundness: intervals for u(xi) and a bound on max |u − uh| | T4 |
| FEM-C03 | Neumann at both ends: the projected problem −u″ = f − c̄ has exactly one classical solution with ∫u = 0; c̄ = 0 when the data are compatible | T3 |
| FEM-D07 | Neumann at both ends: the true nodal values solve the discrete equations up to one constant s, given by the element integrals | T3 |
| FEM-B04 | Two-sided Neumann checker soundness: intervals for the compatibility defect c̄, the constant s, the true nodal values, and the max-error bound | T4 |
| FEM-D08 | Eigenvalues: Sylvester’s law of inertia for the pencil Kx = λMx (M positive definite): the number of eigenvalues below σ equals the number of negative pivots of K − σM | T3 |
| FEM-D09 | Spectral gap of sine series: a function vanishing at the ends and orthogonal to the first k sines satisfies ((k + 1)π/L)² ∫v² ≤ ∫v′², proved via Parseval — the analytic half of λk ≤ λk,h | T3 |
| FEM-B05 | Eigenvalue checker soundness: the k-th discrete eigenvalue lies in the certified interval, and the eigenvalue counts below the certified shifts are exact | T4 |
| FEM-B06 | Problem echo: equation, L, both boundary conditions with their kind and exact coefficients, and a canonical right-hand side | T0 |
| FEM-B07 | Strict parsing: unknown, repeated, out-of-range or malformed lines are errors; the right-hand-side parser is total with a node limit | T0 |
| FEM-B10 | Pinned statements: the P1 solution is the unique classical solution; the beam’s classical solution exists and is unique | T4 |
| FEM-B11 | One exit-code rule (second adversarial review, 7 October): 0 only if no line starts with a tag ending in _FAIL or _PARTIAL; 3 when the main check passed and a secondary one failed; 1 rejected, 2 unreadable | T0 |
| FEM-B03 | Beam checker soundness: intervals for values and slopes, and the max-error bound | T4 |
03
Proof dependencies
Which claims are built on which, read from the Lean proof terms themselves (not from the ledger’s hand-written dependency column). The graph starts with this domain only; click the legend to add the others, or switch to “All Lean theorems” for the theorem level. All domains together are on the programme page.
- a claim or theorem, coloured by domain
- uses — points at what the proof relies on
- bigger — used by more results
- what the selection uses
- what uses the selection
Drag to pan, scroll or pinch to zoom, drag a node to move it; click a node to see what it uses and what uses it, and “Only its chain” to keep just those, directly or not. An arrow from claim A to claim B means that a proof behind A uses a theorem behind B (through lemmas that belong to no claim); two claims can use each other. Claims without a Lean theorem (tests, T0–T2) are not drawn. Generated by scripts/depgraph.py; a reading aid, not part of the trust chain.
04
Goal G2 — certified finite elements against scikit-fem
Reference: scikit-fem 12.0.2 on the same discrete problem. The standard is the same as G1, with one addition: wherever possible, the certificate is about the true solution of the continuous problem, not only the discrete one. In 1D this avoids Sobolev spaces by working with Green’s functions and classical solutions; 2D will need an H¹ model in Lean.
F0 · 1D Poisson with P1 elements — complete
| Feature | Status | What is certified |
|---|---|---|
| 1D meshes: uniform, graded, arbitrary rational nodes | Done | The checker verifies the mesh is well ordered |
| P1 elements, stiffness and load assembly | Done | The checker re-encloses the load with Taylor models and does not trust the solver’s quadrature |
| Non-homogeneous Dirichlet boundaries | Done | Covered by the checker’s soundness theorem |
| Polynomial right-hand sides | Done | Integrated exactly |
| Linear solve | Done | The solver is untrusted; its nodal error is bounded exactly |
| True-solution nodal values and pointwise error | Done | Existence and uniqueness of the classical solution, nodal exactness, the h²/8 interpolation bound and the discrete maximum principle are all proved |
| Céa’s lemma (abstract setting) | Done | Proved, in preparation for 2D |
F1 · 1D extensions
| Feature | Status | What is certified |
|---|---|---|
| Neumann and Robin boundaries | Done | All theory proved for general boundary conditions |
| Neumann at both ends (pure Neumann problem) | Done | Normalised by ∫u = 0, as scikit-fem’s Lagrange-multiplier solution; the checker proves the compatibility defect c̄ and certifies the projected problem (FEM-C03, D07, B04) |
| Non-polynomial right-hand sides | Done | Sums and products of polynomials, exponentials, sines and cosines, via Taylor models with proved remainders; nodal intervals about 10−15 wide |
| Hermite beam elements (fourth-order problem) | Done | Clamped, pinned, free and sliding ends in any combination; rigorous intervals for both nodal values and slopes; the h⁴/384 interpolation bound is proved |
| Adaptive refinement (1D) | Done | Elements are marked by their proved error bounds, not by an estimator; the final mesh is certified |
| Variable coefficients | Not started | |
| P2 and higher-order Lagrange elements | Not started | |
| Eigenvalue problem | Agrees | Since 6 October, --eigs n with Dirichlet, Neumann or Robin ends: the checker evaluates an exact LDLᵀ of K − σM at rational shifts and counts eigenvalues by inertia, as in DFT; every discrete eigenvalue gets an interval of relative width ≤ 2.1×10⁻¹⁵ (FEM-D08, B05). Agrees with scikit-fem to 3×10⁻¹⁵. Not done: the link to the continuous eigenvalues (λk ≤ λk,h) and eigenvector bounds. |
| Energy-norm error | Not started | |
| Example-by-example comparison with scikit-fem’s 1D gallery | Not started |
Planned: F2–F3 (10 items, none started)
F2 · 2D triangular meshes
- Triangular meshes with checker-verified shape regularity (the Sleipner lesson)
- P1 and P2 triangles
- A Lean model of H¹0
- Guaranteed-upper-bound a posteriori estimates (equilibrated fluxes)
- Quadrilateral elements
F3 · more physics and 3D
- Linear elasticity (Korn’s inequality)
- Stokes and mixed elements (inf-sup)
- Adaptive refinement in 2D
- Tetrahedral and hexahedral meshes
- Parallel assembly, specified in TLA+
05
What a certified run reports today
Rigorous statements about the true solution
- an interval for u(xi) at every node
- for beams, also an interval for the slope u′(xi)
- the exact error of the solver’s own nodal values
- a bound on max |u − uh| over the whole interval, and per element
- an adaptively refined mesh that meets a requested tolerance, with the tolerance certified on the final mesh
- for the eigenvalue problem, an interval for each discrete P1 eigenvalue (a statement about the discrete problem only, since 6 October)
06
Cross-checks and supporting evidence
- 11 Poisson and 6 beam cases — Lean nodal intervals contain the reference solutionwidth ≤ 3×10⁻¹⁵
- scikit-fem nodal values against mini-FEM (Poisson / beam)≤ 3×10⁻¹³ / 4×10⁻¹²
- proved max-error bound relative to the sampled actual error0.85 – 1.00
- tampered nodal valuesonly widen the error bound
- Eigenvalues, 6 cases: Lean intervals against a 50-digit mpmath reference / scikit-fem 12.0.2 (Neumann at both ends with shift-invert)contain it, relative width ≤ 2.1×10⁻¹⁵ / ≤ 3×10⁻¹⁵ (2.3×10⁻¹³)
- Dirichlet eigenvalues: the continuous (kπ/L)² below every Lean lower bound; convergence orderalways (known answer, not proved); 2.000
- Eigenvalue checking time: N = 1024 with 4 eigenvalues / N = 2000 with 100.45 s / 2.6 s
- Report validation: every
Leanline in a report is the checker’s own output; a rejecting, crashing or missing checker makes the driver exit with an errorpass - Fuzzing of the driver under AddressSanitizer and UBSan (about 14 000 mutated inputs), after hardening its input parsingno memory errors, undefined behaviour or crashes
07
Open gaps
- Eigenvalues of the continuous problemOnly the discrete P1 eigenvalues are certified. The inequality λk ≤ λk,h for Dirichlet ends lacks the P1 substitution step (the counting lemma is proved); there are no eigenvector bounds and no continuous results for Neumann or Robin ends.
- Other load functionsLogarithms, rational and piecewise functions need their own Taylor models; today only polynomials, exponentials, sines and cosines.
- Checking time for transcendental loadsAbout 13 ms per element, mostly in exact rational series at element midpoints; an interval series with term-wise rounding would be faster.
- Variable beam stiffness and elastic supportsOnly EI = 1; the checker accepts any 4×4 boundary matrix, but the driver writes only the four standard end conditions.
- The driver itselfUntrusted (T0) with no Frama-C proof; every result passes through the checker. Since 1 October it parses numbers strictly and rejects inputs it cannot write exactly (fuzzing had found a right-hand side truncated at 4 KB and NaN parameters written as zero); since 7 October the checker echoes the equation, interval, boundary conditions and load as exact
PROBLEMlines and rejects repeated or unknown certificate lines (FEM-B06, B07). Phase 3 plans to bring element-stiffness assembly to T4.