← Proof comparison · Lean proof graph · Definitions

Proof graph

Dependency graphs of the printed proofs in the manuscript (human_readable_main.tex, paper commit ecd7761). Arrows run from premise to consequence. Results the paper cites, and standard facts it uses without a citation, are drawn as axioms together with their source. Click a node to jump to its proof graph or source.

From the axioms to Theorem 1.1

Roots are the three Lean base axioms and the external inputs. The three axioms sit under the logic of every step of the paper. The Lean development proves Theorem 1.1 from these three axioms alone and follows the printed proof statement by statement (see the Lean proof graph).

propext propositional extensionality classical logic of every step the Lean proof of Thm 1.1 uses only these three Classical.choice global choice Quot.sound quotient soundness Lemma 3.1 symplectic completion: g ω-preserving, g(e) = v §4 setup x₁ normal in A_{≥0}; Euler degree ≥ 1 ⇒ ∈ A_{≥0}x₁ Lemma 4.1 x₁^m p^m, p^m x₁^m are products of (E ± i) Lemma 4.7 𝔭 ∈ Supp N ⇔ ∃y, Ann(y) ⊆ 𝔭 Lemma 5.9 valuation ring W with x̄₁ ∈ 𝔪_W and a chart j Lemma 6.2 base change: gr Q_K = gr Q ⊗ K; Q = 0 ⇔ Q_K = 0 Gabber involutivity Gab81 · SK14 · HTT D.3.4 Lemma 4.10 ℓ(U_𝔮) > ℓ(V_𝔮) Theorem 1.1 A_n = dA_n + FdA_n, i.e. 1 = dR + FdS; F = Φ_g⁻¹(x₁)^{deg_B d} gr A_n = k[x,ξ] Coutinho 7.3.1 · Schnell 2.10 Proposition 3.2 d̃ = c⁻¹Φ_g(d) monic in p of degree N Proposition 3.6 P ∈ Ann gr Q localization exact Stacks 00CS · AM 3.11 Lemma 4.8 U, V finite over T; Supp V ⊆ Supp U Lemma 4.9 ℓ(U_𝔮) ≤ ℓ(V_𝔮) length additive Coutinho · Cohn · Stacks 02LY Vasconcelos Matsumura Thm 2.4 support = V(Ann) Stacks 00L2 Proposition 6.1 Char(Q) ∩ V(x₁) = ∅ Nakayama Nak51 · Stacks 00DV Lemma 5.12 dim C ≤ d′ + 2; δq, q ∈ C Supp(M/xM) Stacks 00L3 finite length at minimal 𝔮 AM 8.5 · Stacks 00KH coefficient field Matsumura 28.3 Theorem 5.7 P|N(Y) = 0 ⇒ P(1,0,…,0) = 0; [dx₁] ∈ Dir(Y) dim Ω = trdeg Hart II.8.6A · Mat 25.2 V(prime) irreducible Hartshorne I.1.4 Theorem 5.8 involutive exclusion: W ∩ π⁻¹(H) = ∅ ⇒ W = ∅ Ann flat base change Stacks 07T8 Stafford 2 generators Sta78 Thm 3.7 Corollary 6.3 f.g. torsion right A_n-modules are cyclic stably cyclic Sta78 p. 435 Nullstellensatz Thm 2.11 · Hart · AM Lemma 5.10 DVR V with q_i ∈ V, x̄₁ ∈ 𝔪_V, R ⊄ V symplectic bases Lang XV.8 · Coutinho 11.2.1 field facts uncited Lemma 4.2 1 + Ux₁ ∈ I for some U ∈ A_{≥0} Lemma 5.11 basis d q_{i_k}(0) of Ω_{κ/K} Lemma 5.13 annihilators of C are conormal Weyl/PBW basics Coutinho 1.2.1 Lemma 3.5 σ_ord(d̃) = P(ξ), monic in ξ₁, P(1,0,…,0) = 1 Proposition 4.3 Q = Qx₁ Noetherian algebra uncited · Stacks 00E0 Corollary 4.11 gr Q = (gr Q)x₁, i.e. U = 0 valuations, normalization, Krull Stacks 00IA · AM · Mat 11.2 transcendence basis Lang VIII.1.1 Kähler differentials Hart II.8.2A · Mat 26.5 Y_sm dense Hartshorne I.5 Hamiltonian flows HTT E.2 Ore domain Björk 1.8.4 Remark 3.3 identity for d̃ transports back to d

One graph per proof

Hypotheses enter at the top; the proved statement exits at the bottom. Theorem 2.10 (Gabber) and Theorem 2.11 (Nullstellensatz) are cited without proof and appear as axioms.

Proposition 3.2

statement · proof

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

d ≠ 0, N = deg_B d ≥ 1 Bernstein symbol s ≠ 0, homogeneous of degree N; pick v with s(v) ≠ 0, so v ≠ 0 char k = 0 h ω-preserving with h(e_p) = v g := hᵀ is ω-preserving (J⁻¹ = −J) Φ_g(d) ≡ s(Mu) mod B_{N−1}; deg_B = N, c := s_g(e_p) = s(v) ≠ 0 d̃ = c⁻¹Φ_g(d) = Σ p^j a_j, deg_B a_j ≤ N − j evaluate the symbol at e_p ⇒ a_N = 1 Proposition 3.2 d̃ = p^N + Σ_{j<N} p^j a_j, a_j ∈ C, deg_B a_j ≤ N − j Lemma 3.1 symplectic completion: g ω-preserving, g(e) = v Field facts: char 0 ⇒ k infinite, ℚ ⊂ k, m! ≠ 0; Bézout in ℚ[E]; ranks and minors standard; no citation gr A_n = k[x,ξ], commutative; symbols multiply Coutinho Th. 7.3.1; Schnell, D-modules notes, Prop. 2.10 Weyl algebra basics: presentation, PBW basis, Weyl relations, commutators lower the order Coutinho Prop. 1.2.1, Th. 1.3.1 (Notation 2.2)

Lemma 3.5

statement · proof

σ_ord(d̃) = P(ξ), monic in ξ₁, P(1,0,…,0) = 1

d̃ as in (3.1), N = deg_B d̃ order-N PBW monomials have |α| = 0: pure ∂^β with scalar coefficient order N; σ_ord(d̃) = P(ξ), homogeneous of degree N only p^N reaches ξ₁^N ⇒ c_N = 1 Lemma 3.5 σ_ord(d̃) = P(ξ), monic in ξ₁, P(1,0,…,0) = 1 Proposition 3.2 d̃ = c⁻¹Φ_g(d) monic in p of degree N Weyl algebra basics: presentation, PBW basis, Weyl relations, commutators lower the order Coutinho Prop. 1.2.1, Th. 1.3.1 (Notation 2.2)

The hypothesis is the output of Proposition 3.2.

Lemma 4.2

statement · proof

1 + Ux₁ ∈ I for some U ∈ A_{≥0}

I = d̃A_n + x₁^N d̃A_n (d̃x₁^N)u + (x₁^N d̃)v = 1 + w ∈ I R₊(E) = p^N x₁^N, R₋(E) = x₁^N p^N roots {−1,…,−N} ∩ {0,…,N−1} = ∅ ⇒ gcd = 1 uR₊ + vR₋ = 1, u, v ∈ ℚ[E] each term of w has Euler degree > 0 ⇒ w = Ux₁, U ∈ A_{≥0} Lemma 4.2 ∃U ∈ A_{≥0} with 1 + Ux₁ ∈ I Lemma 4.1 x₁^m p^m, p^m x₁^m are products of (E ± i) Proposition 3.2 d̃ = c⁻¹Φ_g(d) monic in p of degree N §4 setup x₁ normal in A_{≥0}; Euler degree ≥ 1 ⇒ ∈ A_{≥0}x₁ Field facts: char 0 ⇒ k infinite, ℚ ⊂ k, m! ≠ 0; Bézout in ℚ[E]; ranks and minors standard; no citation

Proposition 4.3

statement · proof

Q = Qx₁

q = class of 1 in Q q = −qUx₁ ∈ (qA_{≥0})x₁ normality x₁r = r′x₁ ⇒ qA_{≥0} = (qA_{≥0})x₁ qA_{≥0} stable under p (m′x₁p = m′E) and C Proposition 4.3 right multiplication by x₁ on Q is surjective: Q = Qx₁ C and p generate A_n ⇒ qA_{≥0} = Q Lemma 4.2 1 + Ux₁ ∈ I for some U ∈ A_{≥0} §4 setup x₁ normal in A_{≥0}; Euler degree ≥ 1 ⇒ ∈ A_{≥0}x₁ Weyl algebra basics: presentation, PBW basis, Weyl relations, commutators lower the order Coutinho Prop. 1.2.1, Th. 1.3.1 (Notation 2.2)

Lemma 4.8

statement · proof

U, V finite over T; Supp V ⊆ Supp U

M = gr Q, f = ·x₁, V = ker f, U = coker f, T = k[x₂…x_n, ξ₂…ξ_n] M finite over T[x₁] via T[x₁,ξ₁]/(P), basis 1, ξ₁, …, ξ₁^{N−1} U, V finite over T[x₁], killed by x₁ ⇒ finite over T 𝔭 ∈ Supp_T V ⇒ ∃𝔮 ∈ Supp ker f, 𝔮 ∩ (T∖𝔭) = ∅ T_𝔮/Ann is Artinian ⇒ finite length Lemma 4.8 U, V finite over T; Supp_T V ⊆ Supp_T U; U_𝔮, V_𝔮 of finite length Supp ker f ⊆ Supp coker f back to T: 𝔭 ∈ Supp_T U 𝔮 minimal: Supp U_𝔮, Supp V_𝔮 ⊆ {𝔮T_𝔮} Lemma 3.5 σ_ord(d̃) = P(ξ), monic in ξ₁, P(1,0,…,0) = 1 Lemma 4.7 𝔭 ∈ Supp N ⇔ ∃y, Ann(y) ⊆ 𝔭 Proposition 3.6 P ∈ Ann gr Q Finite module whose support is the maximal ideal has finite length Stacks Tags 00L2, 00KH; Atiyah–Macdonald Thm 8.5 Noetherian algebra: ACC, finite submodules, minimal primes, primes avoiding a multiplicative set standard; minimal primes Stacks Tag 00E0 Localization: fractions, exactness, primes and annihilators Stacks Tags 00CM, 00CS (Def. 4.4); Atiyah–Macdonald Props 3.11, 3.14 Vasconcelos: surjective endomorphism of a finite module is injective Matsumura, Commutative Ring Theory, Thm 2.4; Vasconcelos

The finite-length claim for a minimal prime is now argued in the proof.

Lemma 4.9

statement · proof

ℓ(U_𝔮) ≤ ℓ(V_𝔮)

Lemma 4.10

statement · proof

ℓ(U_𝔮) > ℓ(V_𝔮)

Involutivity of the minimal primes of J is cited (Hotta–Takeuchi–Tanisaki Thm D.3.4), not argued by localization.

Corollary 4.11

statement · proof

gr Q = (gr Q)x₁, i.e. U = 0

if U ≠ 0: a minimal prime 𝔮 ∈ Supp_T U U_𝔮, V_𝔮 of finite length ℓ(U_𝔮) ≤ ℓ(V_𝔮) < ℓ(U_𝔮): contradiction Corollary 4.11 U = M/x₁M = 0, i.e. gr Q = (gr Q)x₁ Lemma 4.10 ℓ(U_𝔮) > ℓ(V_𝔮) Lemma 4.8 U, V finite over T; Supp V ⊆ Supp U Lemma 4.9 ℓ(U_𝔮) ≤ ℓ(V_𝔮) Noetherian algebra: ACC, finite submodules, minimal primes, primes avoiding a multiplicative set standard; minimal primes Stacks Tag 00E0

Theorem 5.7

statement · proof

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

K = K̄, char 0; Y ⊆ 𝔸^n nonempty, closed, irreducible, Y ∩ H = ∅ x̄₁ algebraic: x₁ = c ≠ 0 on Y ⇒ dx₁ ∈ N(Y) x̄₁ transcendental: valuation ring W, chart q; DVR V with q_i ∈ V, x̄₁ ∈ 𝔪_V, R ⊄ V Theorem 5.7 (i) P|N(Y) = 0 ⇒ P(1,0,…,0) = 0 (ii) [dx₁] ∈ Dir(Y) V̂ ≅ κ[[t]]; F ↪ κ((t)); generic point y a = ord q₀ > 0, b − a = ord x̄₁ > 0; q₀(0) = q₁(0) = 0, q_j(0) = 1 Z from the derivations D_k; τ = t^{−c}(q′ − Zλ) M = [q | Z | τ]: rank d′ + 2, M(0) ⊆ {v : v₁ = 0} columns of M lie in C and span it lift u to ℓ(t), ℓM = 0, ℓ(0) = u ℓ̃ ∈ span{dg_y : g ∈ 𝔭}, ℓ̃(0) = (1,0,…,0) P|N(Y) = 0 ⇒ P(ℓ̃) = 0 ⇒ P(1,0,…,0) = 0 Lemma 5.10 DVR V with q_i ∈ V, x̄₁ ∈ 𝔪_V, R ⊄ V Lemma 5.11 basis d q_{i_k}(0) of Ω_{κ/K} Lemma 5.12 dim C ≤ d′ + 2; δq, q ∈ C Lemma 5.13 annihilators of C are conormal Lemma 5.9 valuation ring W with x̄₁ ∈ 𝔪_W and a chart j Field facts: char 0 ⇒ k infinite, ℚ ⊂ k, m! ≠ 0; Bézout in ℚ[E]; ranks and minors standard; no citation Coefficient field: completion of V is κ[[t]] Matsumura Thm 28.3; Atiyah–Macdonald Cor. 10.20 Smooth locus Y_sm is dense in Y Hartshorne Ch. I.5 (Definition 5.4)

Lemmas 5.9–5.13 are stated and proved inside this proof.

Theorem 5.8

statement · proof

involutive exclusion: W ∩ π⁻¹(H) = ∅ ⇒ W = ∅

K = K̄, char 0; W ⊆ T*X closed, fibre-conical, involutive J = I(W) is ξ-homogeneous; B = J ∩ K[x] {f, ·} preserves J for f ∈ B ⇒ {y} × span{df_y : f ∈ B} ⊆ W P(1,0,…,0) ≠ 0, P|W = 0 N(Y₀) ⊆ W ⇒ P|N(Y₀) = 0 P(1,0,…,0) = 0: contradiction W ∩ π⁻¹(H) = ∅; suppose W ≠ ∅ Y = V_K(B) = π(W), Y × {0} ⊆ W, Y ∩ H = ∅ minimal prime 𝔮 of B: Y₀ = V(𝔮) ≠ ∅, irreducible, Y₀ ∩ H = ∅ s𝔮 ⊆ B ⇒ {y} × span{dh_y : h ∈ 𝔮} ⊆ W Theorem 5.8 W = ∅ Theorem 5.7 P|N(Y) = 0 ⇒ P(1,0,…,0) = 0; [dx₁] ∈ Dir(Y) Field facts: char 0 ⇒ k infinite, ℚ ⊂ k, m! ≠ 0; Bézout in ℚ[E]; ranks and minors standard; no citation Noetherian algebra: ACC, finite submodules, minimal primes, primes avoiding a multiplicative set standard; minimal primes Stacks Tag 00E0 Hamiltonian derivations {f, ·} of f ∈ I(W) preserve an involutive ideal Hotta–Takeuchi–Tanisaki Ch. E.2 V(prime) is closed and irreducible; minimal primes give components Hartshorne Cor. I.1.4, Prop. I.1.5 Hilbert's Nullstellensatz (stated as Thm 2.11) Hartshorne Thm I.1.3A, Cor. I.1.4, Thm I.3.2; Atiyah–Macdonald Cor. 7.10, Ex. 7.14

The conormal space N*_y Y₀ is Definition 5.4.

Lemma 5.9

statement · proof

valuation ring W with x̄₁ ∈ 𝔪_W and a chart j

x̄₁ transcendental over K S = K[x̄₁] polynomial ring; 𝔮 = x̄₁S prime, S_𝔮 local valuation ring W of F dominating S_𝔮: K ⊆ W, x̄₁ ∈ 𝔪_W a/b or b/a ∈ W ⇒ chart j with x̄_i/x̄_j ∈ W Lemma 5.9 valuation ring W ⊇ K with x̄₁ ∈ 𝔪_W; ∃ j: x̄_i/x̄_j ∈ W for all i Dominating valuation ring; finite normalization; Krull PIT; normal local of dimension one ⇒ DVR Stacks Tag 00IA; Hartshorne Thm I.3.9A; Atiyah–Macdonald 5.12, 5.18, Cor. 11.17; Matsumura Thm 11.2

Lemma 5.10

statement · proof

DVR V with q_i ∈ V, x̄₁ ∈ 𝔪_V, R ⊄ V

Y = V_K(𝔭), Y ∩ H = ∅; R = K[x]/𝔭, F = Frac R; q_i = x̄_i/x̄_j C₀ = K[q, x̄₁] ⊆ W finitely generated, Frac C₀ = F 1 ∈ (𝔭, x₁) (Thm 2.11) ⇒ x̄₁ ∈ R^× ⇒ R ⊄ V A = integral closure of C₀: f.g., normal, Noetherian, A ⊆ W x̄₁ nonzero nonunit of A; minimal 𝔭_D ∋ x̄₁ has height 1 (Krull) (b) κ = Frac(A/𝔭_D) integral over K[res q] ⇒ algebraic over L (c) Ω_{A/K} finite ⇒ Ω_{V/K} = V ⊗ Ω_{A/K} finite V = A_{𝔭_D} normal local of dimension 1 ⇒ DVR Lemma 5.10 (a) q_i ∈ V, x̄₁ ∈ 𝔪_V, R ⊄ V; (b) κ algebraic over L; (c) Ω_{V/K} finite Lemma 5.9 valuation ring W with x̄₁ ∈ 𝔪_W and a chart j Kähler differentials: finite for f.g. algebras, localize; in char 0 a transcendence basis is a differential basis Hartshorne Prop. II.8.2A; Matsumura Thm 26.5 Hilbert's Nullstellensatz (stated as Thm 2.11) Hartshorne Thm I.1.3A, Cor. I.1.4, Thm I.3.2; Atiyah–Macdonald Cor. 7.10, Ex. 7.14 Dominating valuation ring; finite normalization; Krull PIT; normal local of dimension one ⇒ DVR Stacks Tag 00IA; Hartshorne Thm I.3.9A; Atiyah–Macdonald 5.12, 5.18, Cor. 11.17; Matsumura Thm 11.2

The proof begins inside the valuation ring W of Lemma 5.9.

Lemma 5.11

statement · proof

basis d q_{i_k}(0) of Ω_{κ/K}

κ = V/𝔪_V; q₀(0) = q₁(0) = 0, q_j(0) = 1 (theorem proof, before the lemma) L generated by q_i(0), i ∉ {0,1,j}; transcendence basis B among them L/K(B), κ/L algebraic ⇒ κ/K(B) algebraic; B is a transcendence basis of κ/K char 0: B is a differential basis of Ω_{κ/K} Lemma 5.11 d q_{i_1}(0), …, d q_{i_d′}(0) basis of Ω_{κ/K}; d′ < ∞ Lemma 5.10 DVR V with q_i ∈ V, x̄₁ ∈ 𝔪_V, R ⊄ V Field facts: char 0 ⇒ k infinite, ℚ ⊂ k, m! ≠ 0; Bézout in ℚ[E]; ranks and minors standard; no citation Kähler differentials: finite for f.g. algebras, localize; in char 0 a transcendence basis is a differential basis Hartshorne Prop. II.8.2A; Matsumura Thm 26.5 A finite generating set of a field extension contains a transcendence basis Lang Thm VIII.1.1

The vanishing q₀(0) = q₁(0) = 0 is established in the theorem proof just before the lemma.

Lemma 5.12

statement · proof

dim C ≤ d′ + 2; δq, q ∈ C

Θ_y = ∩ ker df_y, ρ: κ((t))^{n+1} → κ((t))^n, C = ρ⁻¹(Θ_y), m = trdeg_K F dim Ω_{F/K} = m and Ω_{F/K} = F^n / span{df} ⇒ dim Θ_y = m (b) δ(f(y)) = df_y·δy = 0; quotient rule ρ(δq) = δy; ρ(q) = 0 Nakayama: Ω_{V/K} has ≤ d′ + 1 generators ⇒ m ≤ d′ + 1 conormal sequence for V → κ: dim κ ⊗ Ω_{V/K} ≤ d′ + 1 ker ρ is a line ⇒ dim C = m + 1 ≤ d′ + 2 Lemma 5.12 (a) dim Θ_y = m ≤ d′ + 1, dim C ≤ d′ + 2; (b) δq(t) ∈ C, q(t) ∈ C Lemma 5.10 DVR V with q_i ∈ V, x̄₁ ∈ 𝔪_V, R ⊄ V Lemma 5.11 basis d q_{i_k}(0) of Ω_{κ/K} dim_F Ω_{F/K} = trdeg_K F (char 0); conormal sequence Hartshorne Thm II.8.6A; Matsumura Thm 25.2 Kähler differentials: finite for f.g. algebras, localize; in char 0 a transcendence basis is a differential basis Hartshorne Prop. II.8.2A; Matsumura Thm 26.5 Nakayama's lemma Nakayama 1951; Stacks Tag 00DV

Lemma 6.2

statement · proof

base change: gr Q_K = gr Q ⊗ K; Q = 0 ⇔ Q_K = 0

K/k field extension; I_K, Q_K = A_n(K)/I_K PBW: F_iA_n(K) = F_iA_n(k) ⊗ K, I_K = I ⊗ K, Q_{K,i} = Q_i ⊗ K K free nonzero ⇒ (Q ⊗ K = 0 ⇒ Q = 0) K flat over k ⇒ gr Q_K = gr Q ⊗ K Ann gr Q_K = (Ann gr Q) K[x,ξ] Lemma 6.2 gr Q_K ≅ gr Q ⊗ K; Ann extends; Q = 0 ⇔ Q_K = 0; Char(Q_K) = preimage of Char(Q) Annihilator of a finite module commutes with flat base change Stacks Tag 07T8 Field facts: char 0 ⇒ k infinite, ℚ ⊂ k, m! ≠ 0; Bézout in ℚ[E]; ranks and minors standard; no citation Weyl algebra basics: presentation, PBW basis, Weyl relations, commutators lower the order Coutinho Prop. 1.2.1, Th. 1.3.1 (Notation 2.2)

Theorem 1.1

statement · proof

A_n = dA_n + FdA_n, i.e. 1 = dR + FdS; F = Φ_g⁻¹(x₁)^{deg_B d}

The case N = 0 is treated at the start of Section 3 and n = 0 at the start of the proof.

Corollary 6.3

statement · proof

f.g. torsion right A_n-modules are cyclic

T a f.g. torsion right A_n-module T = t₁A_n + t₂A_n ≅ (A_n ⊕ A_n)/M common annihilator d = d₁r₁ = d₂r₂ ≠ 0 1 = dR + FdS ⇒ (a, 1 − Fa) ∈ M, a = dS A_n ⊕ A_n = (a, 1 − Fa)A_n + (1, −F)A_n stable cyclicity: l = 1 by f₁ = −F for any generating pair; l ≥ 2 by the two-generator theorem Corollary 6.3 T is cyclic, generated by the image of (1, −F); T is stably cyclic Theorem 1.1 A_n = dA_n + FdA_n, i.e. 1 = dR + FdS; F = Φ_g⁻¹(x₁)^{deg_B d} A_n is a right Ore domain Björk Prop. 1.8.4 Stafford: definition of a stably cyclic module Stafford 1978, p. 435 Stafford: f.g. torsion modules need 2 generators Stafford 1978, Thm 3.7, p. 438

Stafford’s two-generator theorem, his definition of stable cyclicity and the Ore property are used as inputs.

External inputs used as axioms

InputSource givenUsed in
Gabber: √Ann gr M and its minimal primes are involutive (stated as Thm 2.10)Gabber 1981; Singh–Kumar 2014; Hotta–Takeuchi–Tanisaki Thm D.3.4Lemma 4.10, Theorem 1.1
gr A_n = k[x,ξ], commutative; symbols multiplyCoutinho Th. 7.3.1; Schnell, D-modules notes, Prop. 2.10Proposition 3.2, Proposition 3.6, Theorem 1.1
Localization: fractions, exactness, primes and annihilatorsStacks Tags 00CM, 00CS (Def. 4.4); Atiyah–Macdonald Props 3.11, 3.14Lemma 4.7, Lemma 4.8, Lemma 4.9, Lemma 4.10
Length well defined, additive on short exact sequencesCoutinho; Cohn; Stacks Tags 02LY, 00J3, 00IV (Def. 4.6)Lemma 4.9, Lemma 4.10
Vasconcelos: surjective endomorphism of a finite module is injectiveMatsumura, Commutative Ring Theory, Thm 2.4; VasconcelosLemma 4.8
Support of a finite module is V(Ann), closed under specializationStacks Tag 00L2Lemma 4.10, Proposition 6.1
Nakayama's lemmaNakayama 1951; Stacks Tag 00DVLemma 4.10, Lemma 5.12
Supp(M/xM) = Supp M ∩ V(x) for finite MStacks Tag 00L3Proposition 6.1
Finite module whose support is the maximal ideal has finite lengthStacks Tags 00L2, 00KH; Atiyah–Macdonald Thm 8.5Lemma 4.8
Coefficient field: completion of V is κ[[t]]Matsumura Thm 28.3; Atiyah–Macdonald Cor. 10.20Theorem 5.7
dim_F Ω_{F/K} = trdeg_K F (char 0); conormal sequenceHartshorne Thm II.8.6A; Matsumura Thm 25.2Lemma 5.12
V(prime) is closed and irreducible; minimal primes give componentsHartshorne Cor. I.1.4, Prop. I.1.5Theorem 5.8
Annihilator of a finite module commutes with flat base changeStacks Tag 07T8Lemma 6.2
Stafford: f.g. torsion modules need 2 generatorsStafford 1978, Thm 3.7, p. 438Corollary 6.3
Stafford: definition of a stably cyclic moduleStafford 1978, p. 435Corollary 6.3
Hilbert's Nullstellensatz (stated as Thm 2.11)Hartshorne Thm I.1.3A, Cor. I.1.4, Thm I.3.2; Atiyah–Macdonald Cor. 7.10, Ex. 7.14Theorem 5.8, Lemma 5.10, Theorem 1.1
Symplectic bases exist; dim U + dim U^⊥ = 2nLang XV.8.1, XV.8.2; Coutinho Prop. 11.2.1Lemma 3.1
Field facts: char 0 ⇒ k infinite, ℚ ⊂ k, m! ≠ 0; Bézout in ℚ[E]; ranks and minorsstandard; no citationProposition 3.2, Lemma 4.2, Lemma 4.10, Theorem 5.7, Theorem 5.8, Lemma 5.11, Lemma 5.13, Lemma 6.2
Weyl algebra basics: presentation, PBW basis, Weyl relations, commutators lower the orderCoutinho Prop. 1.2.1, Th. 1.3.1 (Notation 2.2)Proposition 3.2, Lemma 3.5, §4 setup, Lemma 4.1, Proposition 4.3, Lemma 4.9, Lemma 6.2
Noetherian algebra: ACC, finite submodules, minimal primes, primes avoiding a multiplicative setstandard; minimal primes Stacks Tag 00E0Lemma 4.8, Lemma 4.9, Lemma 4.10, Corollary 4.11, Theorem 5.8
Dominating valuation ring; finite normalization; Krull PIT; normal local of dimension one ⇒ DVRStacks Tag 00IA; Hartshorne Thm I.3.9A; Atiyah–Macdonald 5.12, 5.18, Cor. 11.17; Matsumura Thm 11.2Lemma 5.9, Lemma 5.10
A finite generating set of a field extension contains a transcendence basisLang Thm VIII.1.1Lemma 5.11
Kähler differentials: finite for f.g. algebras, localize; in char 0 a transcendence basis is a differential basisHartshorne Prop. II.8.2A; Matsumura Thm 26.5Lemma 5.10, Lemma 5.11, Lemma 5.12
Smooth locus Y_sm is dense in YHartshorne Ch. I.5 (Definition 5.4)Theorem 5.7
Hamiltonian derivations {f, ·} of f ∈ I(W) preserve an involutive idealHotta–Takeuchi–Tanisaki Ch. E.2Theorem 5.8
A_n is a right Ore domainBjörk Prop. 1.8.4Corollary 6.3

Generated by scripts/build-proof-dag.py from the manuscript snapshot in sources/paper/raw. The graphs are a reading aid; they do not certify the printed proofs.