Start with the root proved showcase for the paper's result. For reusable mathematics, the principal entry points are:
| Topic | Content |
|---|---|
| NashMoser | Guarded Newton iteration, decay, summable corrections, compatible limits, exact zeros |
| SmoothDependence | Differentiability and smoothness of branches across regularity spaces |
| FourierAnalysis | Fourier norms, interpolation, smoothing and approximation |
| AnalyticAlgebras | Analytic weights, convolution estimates, Neumann and perturbation inverses |
| BanachCalculus | Smooth operator series and termwise differentiation |
| Topology | Configuration quotients, moduli topology and non-isolation |
| Applications/MHS | The paper's definitions and the assembled main theorem |
| Internal | Supporting functional, nonlinear and physical analysis |
The topic folders contain the proof sources, with each module included once. The general results still have dependencies elsewhere in this package. These folders are mathematical entry points, not independently packaged libraries. Some constructions, especially the constrained smoothing and configuration spaces, are specific to the present application.
File locations have changed; Lean module names have not. For example:
import NewtonGradeLimits
import AKCT3ContinuousBranchInverseRemainder
import BanachCalcSeriesProofLake uses the source roots registered in the root lakefile.toml to find these
modules in the topic folders. Unchanged modules can reuse matching compiled
.olean files with the pinned toolchain and dependencies.
MODULES.tsv maps every one of the 5,839 module names to its current path and SHA-256 hash. Names with historical prefixes remain unchanged to preserve imports and proof outputs; the topic guides provide descriptive entry points. No unproved blueprint units or exploratory files are needed to compile the main result.