1 = dR + FdS with F = Φ_g⁻¹(x₁)^{deg_B d}
Theorem 1.1 graph · overallPaper.theorem_1_1 · Paper.theorem_1_1_fixedSource · Paper.Section6.theorem_1_1_paper · Paper.Section6.theorem_1_1_fixedSource_paper
← Proof comparison · Paper proof graph · Definitions
Building blocks of the Lean proof (formal commit 1029fdb) and how they combine.
Every edge is computed from the constants Lean records in each declaration's type and proof
(scripts/LeanDag.lean), contracted to the 41 key declarations below. Arrows run from
premise to consequence. Library results and Lean proofs of results the paper cites appear as cited
inputs. Click a node to open its graph or source.
Key edges are transitively reduced. A cited input is drawn only into the first nodes that use it: an edge is omitted when a node it depends on already uses that input. General algebra (ideals, polynomials, finiteness) is not drawn.
Inputs enter at the top: the key theorems and cited inputs the proof reaches without passing another key theorem. The middle row shows the named lemmas the Lean proof uses directly, at most 6, chosen by how many inputs they carry. The theorem exits at the bottom.
Paper.theorem_1_1 · Paper.theorem_1_1_fixedSource · Paper.Section6.theorem_1_1_paper · Paper.Section6.theorem_1_1_fixedSource_paper
Paper.corollary_6_3 · Paper.Section6.corollary_6_3_of
Paper.Section6.stafford_1978_theorem_3_7
Paper.Section6.weyl_rightOreCondition
Paper.Section3.remark_3_3 · Paper.Section3.remark_3_3_of_Q_eq_zero · Paper.Section3.section_3_reduction
Paper.Section6.theorem_6_Q_eq_zero · Paper.Section6.step_W_empty
Paper.Section3.proposition_3_2 · Paper.Section3.step_scalar_case
Paper.Section3.lemma_3_5 · Paper.Section3.lemma_3_5_eval_axis
Paper.Section3.proposition_3_6
Paper.Section6.proposition_6_1
Paper.Section4.corollary_4_11 · Paper.Section4.corollary_4_11_quotSMulTop
Paper.Section4.proposition_4_3
Paper.Section4.lemma_4_1 · Paper.Section4.lemma_4_1_of_weylPair
Paper.Section5.theorem_5_7_i_printed · Paper.Section5.theorem_5_7_i_prime · Paper.Section5.theorem_5_7_i · Paper.Section5.theorem_5_7_i_paper · Paper.Section5.theorem_5_7_ii_printed · Paper.Section5.theorem_5_7_ii_prime · Paper.Section5.theorem_5_7_ii
Paper.Section5.definition_5_4_b_iff · Paper.Section5.conormalCone_paper_eq
Paper.Support.ringKrullDim_eq_trdeg
Geometry.GeneralDivisorialVisibleFrame.generalDivisorialVisibleFrameWithKaehlerFinite
Paper.Section5.lemma_5_10 · Paper.Section5.lemma_5_10_a_not_R_le
Paper.Section5.step_completion
Paper.Section5.step_orders · Paper.Section5.step_a_pos · Paper.Section5.step_generic_point
Paper.Section5.lemma_5_11 · Paper.Section5.witness_lemma_5_11
Paper.Section5.step_dual_derivations
Paper.Section5.step_lambda_w_tau
Paper.Section5.generic_tangent_finrank_eq_component_kaehler_finrank · Paper.Section5.component_kaehler_finrank_eq_trdeg · Paper.Section5.lemma_5_12_a_bound · Paper.Section5.lemma_5_12_a_cone · Paper.Section5.lemma_5_12_b
Paper.Section5.witness_lemma_5_12_5_13_paper · Paper.Section5.witness_lemma_5_12_a_bound
Paper.Section5.step_M_spans_cone
Paper.Section5.step_lift_ell_minor · Paper.Section5.step_ell_conormal
Paper.Section5.step_polynomial_limit
Paper.Section2.theorem_2_11 · Paper.Section2.theorem_2_11_cyclic · Paper.Support.Gabber.theorem_2_11_general · Characteristic.GabberGlobalAssembly.associatedGraded_radical_isInvolutive · Characteristic.GabberGlobalAssembly.minimalPrime_isInvolutive
A theorem from one of these modules, used by a key declaration, counts as a use of the input.
| Input | Source | Lean modules | Key theorems |
|---|---|---|---|
| Ore extensions: Weyl normal form | AlgebraicAnalysis Ore.* | AlgebraicAnalysis.Ore | 16 |
| filtered two-term pages | AlgebraicAnalysis Module.FilteredTwoTerm* | AlgebraicAnalysis.Module.FilteredTwoTerm, AlgebraicAnalysis.Module.TwoTermPageLength, AlgebraicAnalysis.Module.UniformBoundaryVanishing | 1 |
| minimal support, localized lengths, Koszul positivity | AlgebraicAnalysis Module.* | AlgebraicAnalysis.Module | 8 |
| Nullstellensatz | paper Thm 2.11; Mathlib RingTheory.Nullstellensatz, Jacobson | Mathlib.RingTheory.Nullstellensatz, Mathlib.RingTheory.Jacobson | 6 |
| length, Artinian and Noetherian modules | paper Def 4.6; Mathlib RingTheory.Length, SimpleModule, Artinian | Mathlib.RingTheory.Length, Mathlib.RingTheory.FiniteLength, Mathlib.RingTheory.SimpleModule, Mathlib.RingTheory.Artinian, Mathlib.RingTheory.HopkinsLevitzki, Mathlib.RingTheory.Noetherian | 7 |
| support, localization, local rings, Nakayama | paper §4, Stacks 00L2, 00L3, 00DV; Mathlib | Mathlib.RingTheory.Support, Mathlib.RingTheory.Localization, Mathlib.RingTheory.Spectrum, Mathlib.RingTheory.Ideal.MinimalPrime, Mathlib.RingTheory.LocalRing, Mathlib.RingTheory.Nakayama, Mathlib.RingTheory.QuotSMulTop | 21 |
| flat base change, algebraic closure | Stacks 07T8; Mathlib RingTheory.Flat, IsAlgClosed | Mathlib.RingTheory.Flat, Mathlib.RingTheory.TensorProduct, Mathlib.FieldTheory.IsAlgClosed | 8 |
| valuations, DVRs, integral closure, Krull dimension | paper Lemmas 5.9, 5.10 inputs; Mathlib | Mathlib.RingTheory.Valuation, Mathlib.RingTheory.DiscreteValuationRing, Mathlib.RingTheory.DedekindDomain, Mathlib.RingTheory.IntegralClosure, Mathlib.RingTheory.NoetherNormalization, Mathlib.RingTheory.KrullDimension, Mathlib.RingTheory.Ideal.Height, Mathlib.RingTheory.Ideal.KrullsHeightTheorem, Mathlib.RingTheory.Ideal.GoingUp | 15 |
| power and Laurent series, adic completion | Matsumura Thm 28.3; Mathlib | Mathlib.RingTheory.PowerSeries, Mathlib.RingTheory.MvPowerSeries, Mathlib.RingTheory.LaurentSeries, Mathlib.RingTheory.HahnSeries, Mathlib.RingTheory.AdicCompletion | 11 |
| Kähler differentials, étale and smooth maps, transcendence | Hartshorne II.8; Mathlib | Mathlib.RingTheory.Kaehler, Mathlib.RingTheory.Etale, Mathlib.RingTheory.Smooth, Mathlib.RingTheory.Unramified, Mathlib.RingTheory.Derivation, Mathlib.RingTheory.AlgebraicIndependent, Mathlib.RingTheory.Algebraic, Mathlib.RingTheory.RegularLocalRing, Mathlib.RingTheory.EssentialFiniteness, Mathlib.FieldTheory.Separable, Mathlib.FieldTheory.Perfect, Mathlib.FieldTheory.PurelyInseparable, Mathlib.FieldTheory.IntermediateField, Mathlib.FieldTheory.Minpoly | 18 |
| coprime polynomials (Bézout) | Mathlib RingTheory.Coprime | Mathlib.RingTheory.Coprime | 1 |
| symplectic group | Mathlib LinearAlgebra.SymplecticGroup | Mathlib.LinearAlgebra.SymplecticGroup | 3 |
Generated by scripts/build-lean-dag.py from
verification/lean-dag/graph.json. The graph is a reading aid for the checked proof.