← Proof comparison · Paper proof graph · Definitions

Lean proof graph

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.

From the axioms to Theorem 1.1

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.

propext propositional extensionality Lean 4 kernel Theorem 1.1 depends on these three only Classical.choice global choice Quot.sound quotient soundness cited: [Björk, Prop. 1.8.4] A_n(k) is a right Ore domain right Ore condition; proved in Lean weyl_rightOreCondition ≈ Lemma 3.1 symplectic completion: g ω-preserving, g(e) = v lemma_3_1 ≈ Lemma 3.5 σ_N^ord(d̃) = P(ξ) monic in ξ₁, P(1,0,…,0) = 1 lemma_3_5 (+1) ≈ Lemma 6.2 base change: gr, Ann, Char; Q = 0 ⇔ Q_K = 0 lemma_6_2 ≈ Lemma 4.7 𝔭 ∈ Supp N ⇔ Ann(y) ⊆ 𝔭 for some y lemma_4_7 ≈ Lemma 4.1 x₁^m p^m = Π(E − i), p^m x₁^m = Π(E + i) lemma_4_1 (+1) dimension theory dim = trdeg for finitely generated domains used for Def. 5.4(b); proved in Lean ringKrullDim_eq_trdeg ≈ Lemma 5.9 valuation ring W, x̄₁ ∈ 𝔪_W, chart j lemma_5_9 ≈ Lemma 5.10 DVR V = A_𝔭: q_i ∈ V, x̄₁ ∈ 𝔪_V, R ⊄ V; κ algebraic; Ω_V finite lemma_5_10 (+1) step of Thm 5.7 V̂ ≅ κ[[t]], F ↪ κ((t)) step_completion ≈ Lemma 5.11 residues q_i(0), i ∉ {0,1,j}, give a basis of Ω_κ lemma_5_11 (+1) step of Thm 5.7 dual derivations D_k, Z(0) = identity on rows i_l step_dual_derivations step of Thm 5.7 λ, w = q′ − Zλ = t^c τ step_lambda_w_tau step of Thm 5.7 M = (q, Z, τ): unit minor M_ι, M(0) has zero 1-row step_M_minor ≈ Lemma 5.12 dim Θ_y = trdeg F ≤ d′+1, dim 𝒞 = dim Θ_y + 1; δq, q ∈ 𝒞 generic_tangent_finrank_eq_ component_kaehler_finrank (+4) ≈ Lemma 5.13 annihilators of 𝒞 are conormal lemma_5_13 step of Thm 5.7 P(ℓ̃(0)) = 0 step_polynomial_limit cited: Thm 2.10 (Gabber) Gabber: √Ann gr M and its minimal primes are involutive Gab81 · SK14 · HTT D.3.4; proved in Lean theorem_2_11 (+4) cited: Thm 2.11 (Nullstellensatz) Nullstellensatz (a)–(c) Hartshorne I.1.3A; proved in Lean from Mathlib theorem_2_12 Ore extensions: Weyl normal form AlgebraicAnalysis Ore.* ≈ Proposition 3.2 d̃ = c⁻¹Φ_g(d) monic in p of degree N proposition_3_2 (+1) ≈ Lemma 4.2 1 + u₀x₁ ∈ 𝓘 lemma_4_2 filtered two-term pages AlgebraicAnalysis Module.FilteredTwoTerm* ≈ Lemma 4.9 ℓ(U_𝔮) ≤ ℓ(V_𝔮) lemma_4_9 minimal support, localized lengths, Koszul positivity AlgebraicAnalysis Module.* ≈ Lemma 4.8 U, V finite over T; finite length at 𝔮 lemma_4_8 Nullstellensatz paper Thm 2.11; Mathlib RingTheory.Nullstellensatz, Jacobson Def. 5.4(b) Jacobian criterion: Y_sm is the smooth locus definition_5_4_b_iff (+1) length, Artinian and Noetherian modules paper Def 4.6; Mathlib RingTheory.Length, SimpleModule, Artinian support, localization, local rings, Nakayama paper §4, Stacks 00L2, 00L3, 00DV; Mathlib flat base change, algebraic closure Stacks 07T8; Mathlib RingTheory.Flat, IsAlgClosed valuations, DVRs, integral closure, Krull dimension paper Lemmas 5.9, 5.10 inputs; Mathlib power and Laurent series, adic completion Matsumura Thm 28.3; Mathlib step of Thm 5.7 0 < a = ord q₀ < b = ord q₁; f(y) = 0 ⇔ f ∈ 𝔭 step_orders (+2) step of Thm 5.7 Lemmas 5.12–5.13 at the Laurent point of V witness_lemma_5_12_5_13_ paper (+1) step of Thm 5.7 columns of M span 𝒞 step_M_spans_cone step of Thm 5.7 ℓ = (u_υ, −u_υM_υM_ι⁻¹): ℓM = 0, ℓ(0) = u; ℓ̃ ∈ span{df_y} step_lift_ell_minor (+1) Kähler differentials, étale and smooth maps, transcendence Hartshorne II.8; Mathlib coprime polynomials (Bézout) Mathlib RingTheory.Coprime symplectic group Mathlib LinearAlgebra.SymplecticGroup ≈ Theorem 1.1 1 = dR + FdS with F = Φ_g⁻¹(x₁)^{deg_B d} theorem_1_1 (+3) cited: [Sta78, Thm 3.7] T is generated by two elements, stably Stafford 1978; proved in Lean from Theorem 1.1 stafford_1978_theorem_3_7 ≈ Corollary 6.3 torsion modules are cyclic: generator t₁ − t₂F corollary_6_3 (+1) ≈ Remark 3.3 transport 1 = d̃R + x₁^N d̃S back by Φ_g⁻¹ remark_3_3 (+2) proof of Thm 1.1 Q = 0: W = ∅ by Thm 5.8, gr Q_K = 0, Q_K = 0 theorem_6_Q_eq_zero (+1) ≈ Proposition 3.6 P ∈ Ann gr Q proposition_3_6 ≈ Proposition 6.1 Char(Q) ∩ V(x₁) = ∅ proposition_6_1 ≈ Corollary 4.11 gr Q = (gr Q)x₁ corollary_4_11 (+1) ≈ Lemma 4.10 ℓ(U_𝔮) > ℓ(V_𝔮) lemma_4_10 ≈ Proposition 4.3 Q = Qx₁ proposition_4_3 ≈ Theorem 5.8 closed, fibre-conical, involutive W with P|W = 0, W ∩ π⁻¹(H) = ∅ is empty theorem_5_8 ≈ Theorem 5.7 P|N(Y) = 0 ⇒ P(1,0,…,0) = 0; [dx₁] ∈ Dir(Y) theorem_5_7_i_printed (+6) step of Thm 5.7 place V of Lemmas 5.9–5.10, Ω_{V/K} finite generalDivisorialVisibleFrameWithKaehlerFinite

One graph per key theorem

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.

1 = dR + FdS with F = Φ_g⁻¹(x₁)^{deg_B d}

Theorem 1.1 graph · overall

Paper.theorem_1_1 · Paper.theorem_1_1_fixedSource · Paper.Section6.theorem_1_1_paper · Paper.Section6.theorem_1_1_fixedSource_paper

torsion modules are cyclic: generator t₁ − t₂F

Corollary 6.3 graph · overall

Paper.corollary_6_3 · Paper.Section6.corollary_6_3_of

A_n(k) is a right Ore domain

overall

Paper.Section6.weyl_rightOreCondition

transport 1 = d̃R + x₁^N d̃S back by Φ_g⁻¹

Remark 3.3 graph · overall

Paper.Section3.remark_3_3 · Paper.Section3.remark_3_3_of_Q_eq_zero · Paper.Section3.section_3_reduction

Q = 0: W = ∅ by Thm 5.8, gr Q_K = 0, Q_K = 0

overall

Paper.Section6.theorem_6_Q_eq_zero · Paper.Section6.step_W_empty

d̃ = c⁻¹Φ_g(d) monic in p of degree N

Proposition 3.2 graph · overall

Paper.Section3.proposition_3_2 · Paper.Section3.step_scalar_case

base change: gr, Ann, Char; Q = 0 ⇔ Q_K = 0

Lemma 6.2 graph · overall

Paper.Section6.lemma_6_2

gr Q = (gr Q)x₁

Corollary 4.11 graph · overall

Paper.Section4.corollary_4_11 · Paper.Section4.corollary_4_11_quotSMulTop

ℓ(U_𝔮) > ℓ(V_𝔮)

Lemma 4.10 graph · overall

Paper.Section4.lemma_4_10

ℓ(U_𝔮) ≤ ℓ(V_𝔮)

Lemma 4.9 graph · overall

Paper.Section4.lemma_4_9

U, V finite over T; finite length at 𝔮

Lemma 4.8 graph · overall

Paper.Section4.lemma_4_8

closed, fibre-conical, involutive W with P|W = 0, W ∩ π⁻¹(H) = ∅ is empty

Theorem 5.8 graph · overall

Paper.Section5.theorem_5_8

P|N(Y) = 0 ⇒ P(1,0,…,0) = 0; [dx₁] ∈ Dir(Y)

Theorem 5.7 graph · overall

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

step of Thm 5.7 V̂ ≅ κ[[t]], F ↪ κ((t)) step_completion ≈ Theorem 5.7 P|N(Y) = 0 ⇒ P(1,0,…,0) = 0; [dx₁] ∈ Dir(Y) theorem_5_7_i_printed (+6) step of Thm 5.7 dual derivations D_k, Z(0) = identity on rows i_l step_dual_derivations step of Thm 5.7 place V of Lemmas 5.9–5.10, Ω_{V/K} finite generalDivisorialVisibleFrameWithKaehlerFinite Def. 5.4(b) Jacobian criterion: Y_sm is the smooth locus definition_5_4_b_iff (+1) definition_5_5 ≈ Lemma 5.11 residues q_i(0), i ∉ {0,1,j}, give a basis of Ω_κ lemma_5_11 (+1) step of Thm 5.7 ℓ = (u_υ, −u_υM_υM_ι⁻¹): ℓM = 0, ℓ(0) = u; ℓ̃ ∈ span{df_y} step_lift_ell_minor (+1) step of Thm 5.7 P(ℓ̃(0)) = 0 step_polynomial_limit step of Thm 5.7 M = (q, Z, τ): unit minor M_ι, M(0) has zero 1-row step_M_minor step of Thm 5.7 columns of M span 𝒞 step_M_spans_cone step of Thm 5.7 0 < a = ord q₀ < b = ord q₁; f(y) = 0 ⇔ f ∈ 𝔭 step_orders (+2) step of Thm 5.7 λ, w = q′ − Zλ = t^c τ step_lambda_w_tau step of Thm 5.7 Lemmas 5.12–5.13 at the Laurent point of V witness_lemma_5_12_5_13_paper (+1) flat base change, algebraic closure Stacks 07T8; Mathlib RingTheory.Flat, IsAlgClosed step_coordinate_algebraic Kähler differentials, étale and smooth maps, transcendence Hartshorne II.8; Mathlib length, Artinian and Noetherian modules paper Def 4.6; Mathlib RingTheory.Length, SimpleModule, Artinian Nullstellensatz paper Thm 2.11; Mathlib RingTheory.Nullstellensatz, Jacobson exists_coordinate_inverse_of_ avoidance step_dir_of_fibre zeroLocus_vanishingIdeal_of_ isZariskiClosed power and Laurent series, adic completion Matsumura Thm 28.3; Mathlib support, localization, local rings, Nakayama paper §4, Stacks 00L2, 00L3, 00DV; Mathlib valuations, DVRs, integral closure, Krull dimension paper Lemmas 5.9, 5.10 inputs; Mathlib valuationSubring_toSubring_ isLocalRing + 3 further lemmas used directly

Jacobian criterion: Y_sm is the smooth locus

overall

Paper.Section5.definition_5_4_b_iff · Paper.Section5.conormalCone_paper_eq

place V of Lemmas 5.9–5.10, Ω_{V/K} finite

overall

Geometry.GeneralDivisorialVisibleFrame.generalDivisorialVisibleFrameWithKaehlerFinite

valuation ring W, x̄₁ ∈ 𝔪_W, chart j

Lemma 5.9 graph · overall

Paper.Section5.lemma_5_9

DVR V = A_𝔭: q_i ∈ V, x̄₁ ∈ 𝔪_V, R ⊄ V; κ algebraic; Ω_V finite

Lemma 5.10 graph · overall

Paper.Section5.lemma_5_10 · Paper.Section5.lemma_5_10_a_not_R_le

V̂ ≅ κ[[t]], F ↪ κ((t))

overall

Paper.Section5.step_completion

0 < a = ord q₀ < b = ord q₁; f(y) = 0 ⇔ f ∈ 𝔭

overall

Paper.Section5.step_orders · Paper.Section5.step_a_pos · Paper.Section5.step_generic_point

residues q_i(0), i ∉ {0,1,j}, give a basis of Ω_κ

Lemma 5.11 graph · overall

Paper.Section5.lemma_5_11 · Paper.Section5.witness_lemma_5_11

dim Θ_y = trdeg F ≤ d′+1, dim 𝒞 = dim Θ_y + 1; δq, q ∈ 𝒞

Lemma 5.12 graph · overall

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

Lemmas 5.12–5.13 at the Laurent point of V

overall

Paper.Section5.witness_lemma_5_12_5_13_paper · Paper.Section5.witness_lemma_5_12_a_bound

P(ℓ̃(0)) = 0

overall

Paper.Section5.step_polynomial_limit

Gabber: √Ann gr M and its minimal primes are involutive

overall

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

Cited inputs

A theorem from one of these modules, used by a key declaration, counts as a use of the input.

InputSourceLean modulesKey theorems
Ore extensions: Weyl normal formAlgebraicAnalysis Ore.*AlgebraicAnalysis.Ore16
filtered two-term pagesAlgebraicAnalysis Module.FilteredTwoTerm*AlgebraicAnalysis.Module.FilteredTwoTerm, AlgebraicAnalysis.Module.TwoTermPageLength, AlgebraicAnalysis.Module.UniformBoundaryVanishing1
minimal support, localized lengths, Koszul positivityAlgebraicAnalysis Module.*AlgebraicAnalysis.Module8
Nullstellensatzpaper Thm 2.11; Mathlib RingTheory.Nullstellensatz, JacobsonMathlib.RingTheory.Nullstellensatz, Mathlib.RingTheory.Jacobson6
length, Artinian and Noetherian modulespaper Def 4.6; Mathlib RingTheory.Length, SimpleModule, ArtinianMathlib.RingTheory.Length, Mathlib.RingTheory.FiniteLength, Mathlib.RingTheory.SimpleModule, Mathlib.RingTheory.Artinian, Mathlib.RingTheory.HopkinsLevitzki, Mathlib.RingTheory.Noetherian7
support, localization, local rings, Nakayamapaper §4, Stacks 00L2, 00L3, 00DV; MathlibMathlib.RingTheory.Support, Mathlib.RingTheory.Localization, Mathlib.RingTheory.Spectrum, Mathlib.RingTheory.Ideal.MinimalPrime, Mathlib.RingTheory.LocalRing, Mathlib.RingTheory.Nakayama, Mathlib.RingTheory.QuotSMulTop21
flat base change, algebraic closureStacks 07T8; Mathlib RingTheory.Flat, IsAlgClosedMathlib.RingTheory.Flat, Mathlib.RingTheory.TensorProduct, Mathlib.FieldTheory.IsAlgClosed8
valuations, DVRs, integral closure, Krull dimensionpaper Lemmas 5.9, 5.10 inputs; MathlibMathlib.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.GoingUp15
power and Laurent series, adic completionMatsumura Thm 28.3; MathlibMathlib.RingTheory.PowerSeries, Mathlib.RingTheory.MvPowerSeries, Mathlib.RingTheory.LaurentSeries, Mathlib.RingTheory.HahnSeries, Mathlib.RingTheory.AdicCompletion11
Kähler differentials, étale and smooth maps, transcendenceHartshorne II.8; MathlibMathlib.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.Minpoly18
coprime polynomials (Bézout)Mathlib RingTheory.CoprimeMathlib.RingTheory.Coprime1
symplectic groupMathlib LinearAlgebra.SymplecticGroupMathlib.LinearAlgebra.SymplecticGroup3

Generated by scripts/build-lean-dag.py from verification/lean-dag/graph.json. The graph is a reading aid for the checked proof.