Conductor-Reduced Defect Decompositions for Rees Algebras and a Fiber-Corrected Bridge to Linear Type
Conductor-Reduced Defect Decompositions for Rees Algebras and a Fiber-Corrected Bridge to Linear Type
Abstract
Let be an excellent normal local domain of dimension , and let be an -primary ideal. Write =\bigoplus_{n\ge 0}\overline{I^n}t^n, \qquad \mathcal U(I)=\bigoplus_{n\ge 0}(I^n)_1t^n, where is the first coefficient ideal of . The quotient /\mathcal U(I) is the pure codimension-one defect controlling Serre's condition for , while the quotient between the defining ideal of and the ideal of linear relations measures failure of linear type.
This paper records a verified theorem package extracted from the interaction of Puthenpurakal's criterion and the conductor formalism of Gasanova--Herzog--Kling--Moradi. For every nonzero conductor element we define the reduced comparison map and prove:
the exact index formula
\lambda((J/L)_n);- the exact decomposition where is the first-coefficient correction, is the conductor-sliced codimension-one defect, and is an explicit intersection defect;
- the asymptotic criterion while in the non- case one has ;
- a fiber-corrected bridge theorem: if the fiber-cone equation ideal vanishes, then there exists a constant such that hence
The raw bridge between equation defects and codimension-one defects fails in general: if , then the equation defect has maximal symmetric-fiber dimension. Thus the honest contribution is a corrected bridge theorem, not an unconditional one.
Code availability. The full theorem package has been formalized in Lean 4 (Mathlib) as the ReesDefects package. Source code: https://github.com/Shengrong-Wu/AI-Driven-Math-Research/tree/main/ReesDefects. A section-by-section account of the formal development appears in the appendix.
Introduction
Context and motivation
For an -primary ideal in a normal local domain, two natural defects govern two different failures of regularity in the blow-up algebra of .
The first is the equation defect where is the defining ideal of the Rees algebra inside a polynomial presentation of , and is the ideal of linear relations. The module vanishes exactly when is of linear type.
The second is the codimension-one normalization defect where is the first-coefficient Rees algebra. Puthenpurakal proved that detects the property of :
These two defects live on different sides of the symmetric--Rees comparison: The conductor formalism of Gasanova--Herzog--Kling--Moradi supplies the bridge on the equation side: The guiding question of the research program summarized here was whether one can compare the equation defect and the codimension-one defect quantitatively.
Related work
Two recent results form the base of this paper.
First, Puthenpurakal showed that for an excellent normal local ring of dimension at least and an -primary ideal , the property of the Rees algebra is equivalent to equality between integral closures and first coefficient ideals:
Second, Gasanova--Herzog--Kling--Moradi introduced the conductor , proved that it localizes, and in the domain case obtained the identity This turns multiplication by a conductor element into an equation detector inside the symmetric algebra.
The present paper does not improve the base theorem itself. It reorganizes the mechanism behind it and records the strongest verified bridge statements obtained in the subsequent research log.
Main result
The strongest theorem package proved in the research log is the following.
For every nonzero conductor element , the reduced comparison map has finite-length kernel and cokernel, and satisfies the exact index formula n). Its cokernel is the reduced normalization defect and one has the exact decomposition where {(I^n)1/I^n}r\right), \qquad \kappa_r(n)=\lambda!\left(0:{\overline{I^n}/(I^n)_1}r\right), and The leading term of detects .
The second main theorem is a corrected bridge to linear type. Let be the fiber cone and k(I/\mathfrak m I)\to F(I)\big) its equation ideal over . If {\mathrm{fib}}=0, then for a constant independent of , hence .
What is genuinely new
The paper centers on the mechanism, not on a stronger replacement for Puthenpurakal's theorem.
The genuinely new verified outputs are:
- the reduced comparison map and its exact index formula;
- the exact defect decomposition
- the identification of as an explicit intersection defect;
- the fiber-corrected bridge theorem, which is the strongest true bridge between equation defect and codimension-one defect obtained in the research log;
- the obstruction theorem showing why the raw uncorrected bridge cannot hold in general.
Paper outline
Section 2 fixes notation and collects the exact sequences inherited from the two source papers. Section 3 develops the conductor-reduced mechanism and proves the structural identity . Section 4 states the main results. Section 5 proves them. Section 6 discusses the remaining obstruction and the only currently viable route to stronger theorems. Appendix A records the special-fiber obstruction theorem.
Background and Preliminaries
Setup and notation
Throughout the paper:
- is an excellent normal local domain;
- ;
- is an -primary ideal;
- is the fraction field of ;
- .
Write
For each , let 1 be the first coefficient ideal of , and define {n\ge 0}U_n t^n. Following the notation of the research log, set and globally
On the symmetric side, fix a polynomial presentation where and
Standard exact sequences
The inclusions yield exact sequences \to \mathcal C\to 0, \tag{2.2}
The symmetric--Rees presentation yields
Splicing (2.4) with \to \mathcal B\to 0 gives \to \mathcal B\to 0. \tag{2.5}
Inherited structural facts
We use the following results proved in the source papers and already extracted in the research log.
- is a finite graded -module and
- is a finite graded -module and
- One has
- The conductor satisfies it localizes, and for every nonzero ,
We also use the elementary finite-length identity for any finite-length -module and any .
Fiber-cone notation
Let be the fiber cone. Set k(V), and define the fiber-cone equation ideal {\mathrm{fib}}:=\ker(S_k\to F(I)).
Mechanism and Main Structural Identity
Conductor-reduced comparison maps
Fix a nonzero element For each define This factors as
The conductor identity turns multiplication by into an exact torsion detector in the symmetric algebra:
Since , multiplication by is injective on and on . Since \subset Q(A)[t], it is also injective on . Applying the snake lemma to (2.4), (2.1), and (2.2) yields degreewise exact sequences
The four reduced defects
Define and let be the length of the image of the boundary map coming from multiplication by on
By (2.6), the two equalities in (3.7) and (3.8) hold because and have finite length.
The interaction term as an intersection defect
The boundary map admits an explicit ideal-theoretic description.
Take a class . Then and . The connecting map sends Hence and therefore
Thus This is the precise intersection-rigidity statement measured by the interaction term.
Main Result
We now state the strongest verified theorem package.
Theorem A (conductor-reduced comparison package)
Assume the setup of Section 2. Let .
For each , the reduced comparison map has finite-length kernel and cokernel and satisfies
\lambda(\mathcal E_n). \tag{4.1}
The cokernel of is the reduced normalization defect: and its length satisfies the exact decomposition
The interaction term is given by
One has while
If , equivalently for all , then
Theorem B (fiber-corrected bridge to linear type)
Assume the setup of Section 2 and, in addition, Then there exists a constant such that for all , Consequently For every nonzero one then has
Corollary C
Assume and . Then so is of linear type.
Proof of the Main Result
Proof of Theorem A
We prove the five statements in order.
Step 1: auxiliary kernel and cokernel sequences
Let Write and let be the natural cokernel map coming from (3.5). Restrict to and define
We claim that there are exact sequences
To prove (5.1), note from (3.5) that Thus
\beta_n^{-1}(C_n[r]). Its image in is
\ker q_n\cap C_n[r]
\ker(\theta_n^r). Since the kernel of is , we obtain (5.1).
For (5.2), observe that
\big(\overline{I^n}/r\overline{I^n}\big)\big/\gamma_n(\operatorname{im}\beta_n). There is an exact sequence Since by (3.6), one has while . Hence (5.2) follows.
Finally, since is surjective with kernel by (3.4), we have
Step 2: proof of the index formula
By (5.3) and (5.4), it is enough to prove
From (5.1) and (5.2),
\lambda(D_n[r])+\lambda(\ker\theta_n^r), \tag{5.6}
\lambda(\operatorname{coker}\theta_n^r)+\lambda(C_n/rC_n). \tag{5.7} Also,
\lambda(C_n[r])-\lambda(D_n/rD_n). \tag{5.8} Using (2.6), Substituting (5.8) and (5.9) into (5.6) and (5.7) gives (5.5). Hence
\lambda(\mathcal E_n), which proves (4.1).
Step 3: the exact decomposition of
Since we have
Now apply multiplication by to Because all three modules have finite length, we get the long exact sequence Break it into short exact pieces: Taking lengths and using (2.6) yields
\lambda(D_n[r])+\lambda(C_n[r])-\lambda(\operatorname{im}\partial_n^r). By definition, , so which proves (4.3).
The cokernel description (4.2) follows directly from (5.10) and (5.4).
Step 4: the intersection formula for
Take . Then and . Under the connecting map, Therefore the image consists exactly of residue classes represented by elements of modulo . Since , we have hence Taking lengths proves (4.4).
Step 5: asymptotic detection of
First suppose . Then for all and for all . Since , one has hence by (4.3), So .
Now suppose . Then . We claim {\mathcal C}r)=d. \tag{5.15} Let be a minimal prime of . Every graded piece has finite length, so Since , we have . Because minimal primes of a finite module are associated primes, there exists with Then , so {\mathcal C}r. Thus {\mathcal C}r) and {\mathcal C}r)\ge \dim \mathcal U(I)/P=d. The reverse inequality is automatic, so (5.15) holds.
Therefore is eventually a polynomial of degree . On the other hand, because is the length of a subquotient of and . Hence from (4.3), so .
Since is if and only if , this proves (4.5) and (4.6).
Step 6: the case
If , then every . Hence and the boundary map is zero, so . Thus (4.3) becomes proving (4.7).
This completes the proof of Theorem A.
Proof of Theorem B
We now assume
Step 1: a degreewise exact sequence through the first-coefficient algebra
The composite has kernel and cokernel , so there is an exact sequence
Tensoring (5.16) with gives an exact segment
Tensoring with gives
Since , the natural map is an isomorphism for every . Therefore Hence So is a quotient of .
From (5.17), the cokernel of is exactly . Therefore Both and are quotients of . Consequently
Step 2: uniform control of
Set If is a finite-length -module, then Indeed, choose a composition series for with simple quotients and induct on .
Applying (5.22) to and combining with (5.21) gives
If , then there is nothing more to prove. Assume . Since is annihilated by and is -primary, the conductor is -primary in this nontrivial case. Choose such that Then for every . Hence a minimal generating set of gives a surjection so Combining (5.23) and (5.25), we get where This proves (4.8).
Step 3: asymptotic consequence
Since , the Hilbert function of has degree at most , so By (5.26), proving (4.9).
Finally, Theorem A gives and Substituting (5.28) into (5.27) yields (4.10) and (4.11).
This completes the proof of Theorem B.
Proof of Corollary C
If , then for all . By Theorem B, for all . Hence for all , so . Therefore , and is of linear type.
Further Directions
The research log reached a clean stopping point: the unconditional bridge from equation defects to codimension-one defects is false in general, and the fiber-corrected theorem is the strongest verified positive statement.
There are three live directions beyond the present paper.
1. Compute the interaction term in structured classes
The exact decomposition isolates the only genuinely mysterious term: It is known to vanish when , but no broader verified vanishing class has yet been proved. The natural next target is to test this term in almost complete intersections, -sequence ideals, or classes with explicit symmetric/Rees equations.
2. Replace the raw equation defect by a fiber-corrected equation defect
The present paper proves that the raw equation defect contains an unavoidable special-fiber component. A stronger future theorem should probably compare only after quotienting out the image of the fiber-cone equation ideal, or equivalently compare the residual homological piece coming from to the codimension-one defect.
3. Determine whether the leading coefficient of is independent of
The present results show that for each fixed nonzero , exactly in the non- case. The research log did not prove that the leading coefficient of is independent of the choice of conductor element. That question remains open.
References
O. Gasanova, J. Herzog, F. J. Kling, S. Moradi, On the Rees algebra and the conductor of an ideal, arXiv:2407.06922.
T. J. Puthenpurakal, First Coefficient ideals and property of Rees algebras, arXiv:2408.05532.
P. Valabrega, G. Valla, Form rings and regular sequences, Nagoya Math. J. 72 (1978), 93--101.
H. Matsumura, Commutative Ring Theory, Cambridge Studies in Advanced Mathematics 8, Cambridge University Press, 1986.
Appendix A. The special-fiber obstruction theorem
This appendix records the negative statement that forced the corrected form of Theorem B.
Proposition A.1
There is an exact sequence of graded -modules 1^A(k,\mathcal R(I)) \longrightarrow \mathcal E/\mathfrak m\mathcal E \longrightarrow J{\mathrm{fib}} \longrightarrow 0. \tag{A.1}
Proof
Tensor the exact sequence with . This yields Now A(I)\otimes_A k=S_k, \qquad \mathcal R(I)\otimes_A k=F(I). The image of is exactly {\mathrm{fib}}. Hence (A.1) is exact.
Corollary A.2
If , then has full -dimension
Proof
Since is a polynomial ring in variables over , any nonzero ideal of has full dimension . By Proposition A.1, surjects onto . Hence The reverse inequality is automatic, so equality holds.
Corollary A.3
If is -primary and , then the raw equation defect cannot in general lie on the same asymptotic scale as the codimension-one defect.
Proof
If is -primary, then the fiber cone has dimension If , then the map cannot be injective, so . By Corollary A.2, the equation defect has maximal symmetric-fiber dimension. On the other hand, the codimension-one defect has degree at most . Thus no unconditional comparison of the form can hold in general.
This is precisely the obstruction removed by the fiber hypothesis in Theorem B.
Appendix: Lean 4 Formalization
The full theorem package in this paper has been formalized in Lean 4 (Mathlib) as the ReesDefects package.
Source code: https://github.com/Shengrong-Wu/AI-Driven-Math-Research/tree/main/ReesDefects
The following sections retell the mathematical content in the order imposed by the formal package — organized by layer rather than by narrative flow. Each section corresponds to a directory in the package, and each subsection to a .lean file. Statements proved only relative to abstract hypothesis parameters are recorded in that conditional form; axiomatized placeholders are identified explicitly.
Introduction
The original research article presents a single mathematical narrative. The Lean package does not. Instead, it builds the argument through a sequence of interfaces. This rewritten article follows that formal architecture exactly. Each directory of the package becomes a section, and each file is translated into mathematical prose using definition-theorem-proposition-lemma blocks.
Unless otherwise stated, is a commutative ring and is an ideal. Later sections introduce stronger hypotheses, such as domain hypotheses for normalized Rees algebras or abstract first-coefficient packages encoding the criterion. We state these hypotheses where they appear in Lean rather than moving them elsewhere.
1. ReesDefects/Foundations
1.1. FiniteLengthNat.lean
Definition. For an -module , define the nat-valued finite length This is the paper-facing version of module length used throughout the package.
Theorem. has finite length if and only if .
Proposition. If has finite length, then R(M) viewed in \infty is exactly .
Proposition. If has finite length, then
Lemma. Nat-valued finite length is invariant under linear equivalence.
Theorem. For an exact sequence with and of finite length,
\operatorname{finLengthNat}_R(N)+\operatorname{finLengthNat}_R(P).
1.2. ExactLength.lean
Definition. For a linear map , the formal cokernel model is
Proposition. If has finite length, then
\operatorname{finLengthNat}_R(\ker \phi) +\operatorname{finLengthNat}_R(\operatorname{range}\phi).
Proposition. If has finite length, then
\operatorname{finLengthNat}_R(\operatorname{range}\phi) +\operatorname{finLengthNat}_R(\operatorname{linearCokernel}(\phi)).
Theorem. Suppose and have finite length and is another finite-length module such that
\operatorname{finLengthNat}_R(Q)+\operatorname{finLengthNat}_R(E). Then
\operatorname{finLengthNat}_R(\operatorname{linearCokernel}(\phi)) +\operatorname{finLengthNat}_R(E). This is the abstract index calculation used later for the reduced comparison map.
1.3. ScalarTorsion.lean
Definition. For , the package defines the scalar endomorphism
Definition. The -torsion submodule is
Definition. The scalar quotient is
Proposition. If has finite length, then
\operatorname{finLengthNat}_R(0:_M r) +\operatorname{finLengthNat}_R(rM).
Proposition. If has finite length, then
\operatorname{finLengthNat}_R(rM) +\operatorname{finLengthNat}_R(M/rM).
Theorem. If has finite length, then
\operatorname{finLengthNat}_R(M/rM).
1.4. ScalarSnake.lean
Definition. A linear map induces a map on -torsion and a map on scalar quotients
Lemma. Scalar multiplication commutes with every linear map. This is the compatibility needed to invoke the snake lemma.
Definition. Given an exact sequence
the snake lemma produces a connecting map
In Lean this is snakeDelta.
Lemma. The induced sequence is exact.
Lemma. The induced sequence is exact.
Theorem. If all have finite length, then This is the scalar-snake identity that later becomes the defect decomposition .
1.5. SubquotientBounds.lean
Lemma. A submodule of a finite-length module has length bounded by the ambient length.
Lemma. A quotient of a finite-length module has length bounded by the ambient length.
Proposition. Any subquotient of a finite-length module has length bounded by the ambient length.
2. ReesDefects/Algebra
2.1. ColonAnnihilator.lean
Definition. For submodules , the quotient is identified with the image of in .
Theorem. For submodules ,
Theorem. If , then
Corollary. For ideals in a commutative ring, This is the formal conductor identity underlying the equation-defect side of the package.
2.2. QuotientModulesOfIdeals.lean
Definition. For ideals , define the quotient module realized internally as a quotient of submodules of the ambient ring.
Theorem. For ideals ,
Proposition. The quotient module is nontrivial if and only if the inclusion is strict:
2.3. SupportDimension.lean
Definition. The predicate supportDimLEOne means
Lemma. Support dimension at most one descends along injective maps.
Lemma. Support dimension at most one ascends along surjective maps.
Theorem. For an ideal ,
3. ReesDefects/Rees and ReesDefects/Symmetric
3.1. Rees/Basic.lean
Definition. The Rees algebra of is written as ReesElem I; mathematically this is
.
Theorem. A polynomial belongs to the Rees algebra if and only if each coefficient lies in the matching power:
Corollary. A monomial lies in if and only if .
Theorem. The Rees algebra is generated by degree-one monomials coming from , and it is finitely generated whenever is finitely generated.
3.2. Rees/DegreePieces.lean
Definition. The degree- piece of the Rees algebra is represented by the ideal power
Definition. There is a coefficient map and an insertion map
Lemma. The insertion map has coefficient in degree and coefficient in every other degree.
3.3. Rees/CanonicalGenerators.lean
Definition. For , the canonical degree-one generator is the monomial .
Proposition. Its degree-one coefficient is , and every other coefficient is .
Theorem. The range of the canonical degree-one generators is exactly the standard degree-one submodule used by Mathlib to generate the Rees algebra.
Theorem. The Rees algebra is generated by these degree-one generators.
3.4. Symmetric/Basic.lean
Definition. The symmetric algebra on an -module is written .
Theorem. If is linear, then the universal algebra map evaluates on generators exactly as .
Definition. A DegreewiseData package for an ideal consists of modules piece n for
each degree together with distinguished degree-one generators indexed by elements of .
3.5. Symmetric/DegreeModel.lean
Definition. A DegreeModel for consists of:
with a specified kernel defect n, surjectivity in every degree, and compatibility between
degree-one generators on the symmetric side and canonical generators on the Rees side.
Proposition. For each , membership in the defect piece is equivalent to vanishing under the map .
Theorem. For each , the sequence is exact.
3.6. Symmetric/FreeCoverPresentation.lean
Definition. A FreeCoverPresentation of is a free -module together with a
surjection .
Proposition. The universal map from into behaves on generators exactly as expected.
Lemma. Every element of has a preimage in the chosen free cover.
3.7. Rees/SymmToRees.lean
Definition. From a degree model one obtains a degreewise map
Proposition. This map preserves zero and addition.
Theorem. In degree one it sends the chosen symmetric generators to the canonical Rees generators.
3.8. Rees/EquationDefectKernel.lean
Definition. The degree- equation defect piece is the kernel of the degreewise map from the symmetric model to .
Proposition. An element lies in the equation defect piece if and only if its degreewise image in vanishes.
Theorem. For each degree , the equation defect piece sits in an exact sequence
4. ReesDefects/Intermediate
4.1. SandwichedPowerFamily.lean
Definition. A sandwiched power family consists of two ideal families and such that with multiplicative compatibility
Definition. The three degreewise defect quotients are
Definition. For , the package introduces and defines the explicit intersection quotient
4.2. DegreewiseDefects.lean
Definition. A DegreewiseDefectPackage is a sandwiched power family together with exact
degreewise maps
such that
is exact in every degree, each module has finite length, and the snake-lemma boundary image is
identified with the explicit intersection quotient above.
Definition. For , define and
Theorem. For every and ,
Theorem. The interaction term equals the explicit intersection length:
\lambda!\left( \frac{U_n\cap (I^n+rN_n)}{I^n+rU_n} \right).
Corollary. Hence
4.3. ReducedComparisonData.lean
Definition. A ReducedComparisonData package extends a degreewise defect package by
introducing, for each and , a comparison map
finite-length hypotheses on its kernel and cokernel, and a sequence of integers
encoding equation-defect lengths.
Theorem. The package proves the abstract index formula
\lambda(\operatorname{coker}\phi_n^r)+\lambda(E_n).
Corollary. If one separately identifies with , then
5. ReesDefects/Normalized
5.1. ClosurePower.lean
Definition. A ClosurePowerSystem is a family of ideals
satisfying
Definition. If is a domain, the package maps these ideals into the fraction field and defines the normalized Rees algebra to be the polynomial subalgebra
Theorem. Membership in the normalized Rees algebra is coefficientwise membership in the mapped closure ideals.
Corollary. A monomial lies in the normalized Rees algebra if and only if lies in the mapped closure ideal in degree .
Lemma. The mapped ideal power lies inside the mapped closure ideal in degree .
5.2. DegreePieces.lean
Definition. The degree- piece of the normalized Rees algebra is represented by the mapped closure ideal in degree .
Definition. There are coefficient and insertion maps
Lemma. The insertion map has coefficient in degree and coefficient in the other degrees.
5.3. Basic.lean
Definition. A BasicSystem consists of a closure-power system together with an intermediate
family satisfying
Proposition. Such a system induces a sandwiched power family with lower terms and upper terms .
6. ReesDefects/FirstCoefficient
6.1. Axioms.lean
Definition. ReesR1 A I is the abstract predicate expressing that the Rees algebra of
satisfies Serre's condition.
Definition. A FirstCoefficientLike package extends a normalized basic system by requiring:
- finite length of
- support-dimension control
- a dichotomy for the correction term
- the criterion
Definition. A DegreewiseDefectAxioms package extends the first-coefficient interface by
providing exact sequences
and an explicit equivalence between the snake-lemma image and the intersection quotient defining
.
Definition. A ReducedComparisonAxioms package extends this further by specifying the reduced
comparison maps, finite-length kernel and cokernel data, equation-defect lengths, and the index
formula.
6.2. ConcreteDefinition.lean
Axiom. The package introduces an axiomatized family
called puthenpurakalFirstCoefficientIdeal.
Definition. A ConcreteDefinition is a FirstCoefficientLike package for which
for every .
Axiom. The file postulates a concrete instance This is a placeholder until the full first-coefficient ideal construction is internalized in Lean.
6.3. GlobalPackage.lean
Definition. A GlobalPackage is the full first-coefficient package: it contains all axioms
needed for the degreewise defect package and the reduced comparison package.
Proposition. Every global package forgets to:
- a first-coefficient interface;
- a degreewise defect package;
- a reduced comparison package.
Theorem. The global package inherits the criterion
7. ReesDefects/Fiber
7.1. ResidueFieldBaseChange.lean
Definition. A ResidueFieldBaseChange package consists of a field with an -algebra
structure. It serves as the abstract residue field in the fiber layer.
Definition. For an -module , its base change is
Definition. There is a canonical tensor inclusion
7.2. FiberCone.lean
Definition. The fiber cone is
Definition. The canonical map from the Rees algebra to the fiber cone is
7.3. SymmetricBaseChange.lean
Definition. The file isolates the assertion that symmetric algebra commutes with base change:
Remark. In Lean this appears as an abstract typeclass HasEquiv; the equivalence is used
downstream but is not constructed in this file.
7.4. FiberEquationIdeal.lean
Definition. A FiberEquationData package consists of residue-field base-change data, a chosen
-vector space , a model of the fibered equation defect , a chosen
carrier for the fiber cone, and a presentation map
Definition. The fiber equation ideal is
Definition. Proposition A.1 is recorded abstractly as the existence of a right-exact sequence 1^A(k,\mathcal R(I)) \to E/\mathfrak mE \to J{\mathrm{fib}} \to 0.
7.5. RightExactBridge.lean
Definition. A HasRightExactBridge package is a surjective map
Remark. This is the part of the bridge presently formalized directly and used by the main theorem layer.
7.6. TorSequenceFuture.lean
Definition. A FutureTorSequenceData package records the missing Tor-term and the exact
segment
1^A(k,\mathcal R(I)) \to E/\mathfrak mE \to J{\mathrm{fib}} \to 0
as future data.
Remark. The file explicitly states that current Mathlib infrastructure does not yet provide the Tor long exact sequence needed for a direct proof. Accordingly, this layer is a placeholder for future completion rather than a fake proof.
8. ReesDefects/Asymptotics
8.1. GradedSupport.lean
Definition. For a first-coefficient package , define
Theorem. One has
Theorem. For each ,
8.2. HilbertLength.lean
Definition. A function has polynomial growth of degree at most if there exists such that for all .
Definition. A function is eventually polynomial of degree if it agrees for all large with a polynomial of nat-degree .
Definition. A HilbertGrowth package for dimension parameter consists of:
- a bound
- eventual polynomial behavior of the torsion slices for each .
Theorem. These two conclusions are extracted directly from the HilbertGrowth structure.
8.3. DegreeBounds.lean
Definition. The package introduces the paper-facing functions
Theorem. Under a HilbertGrowth hypothesis,
Theorem. Under the same hypothesis, is eventually polynomial of degree .
9. ReesDefects/Main
9.1. AbstractDefectDecomposition.lean
Theorem. For any degreewise defect package,
Theorem. The interaction term equals the explicit intersection quotient.
Corollary. Therefore
This file simply repackages the intermediate-layer result into the language used by the main theorem statements.
9.2. AbstractIndexFormula.lean
Theorem. For any reduced comparison package,
\lambda(\operatorname{coker}\phi_n^r)+\lambda(E_n).
Corollary. If is identified with , then
9.3. ConcreteTheoremA123.lean
Definition. A ConcretePackage is a global first-coefficient package in which the lower family
really is the first coefficient family:
Definition. The hypothesis class HasCokernelNuIdentification asserts that
for all and .
Theorem A(1). For every and ,
\lambda(\operatorname{coker}\phi_n^r)+\lambda(E_n).
Theorem A(2), first clause. Under the cokernel identification hypothesis,
Theorem A(2), second clause. For every and ,
Theorem A(3). The interaction term equals the explicit intersection quotient length.
9.4. ConcreteTheoremA45.lean
Definition. The class HasAsymptoticDetection packages the two asymptotic implications
appearing in Theorem A(4):
- if is , then has growth degree at most ;
- if is not , then is eventually polynomial of degree .
Definition. The class HasTrivialDConsequences packages the consequences of the vanishing of
: namely
Theorem A(4), direction. Under HasAsymptoticDetection,
Theorem A(4), non- direction. Under HasAsymptoticDetection,
Theorem A(5). Under HasTrivialDConsequences,
9.5. FiberCorrectedBridge.lean
Definition. Fix a concrete first-coefficient package , fiber equation data , a
dimension parameter , and an element . A FiberCorrectionData package consists of:
- a right-exact bridge ;
- future Tor-sequence data for Proposition A.1;
- the vanishing hypothesis ;
- a constant such that for all ;
- the growth bound
- error functions of degree at most such that
Theorem B, bound. Any such package yields for all .
Theorem B, growth. Any such package yields
Theorem B, kernel asymptotic form. The kernel length differs from by an error term of degree at most .
Theorem B, cokernel asymptotic form. The cokernel length differs from by an error term of degree at most .
This is the formal version of the fiber-corrected bridge: it is not an unconditional theorem in the current package, but rather a theorem extracted from an explicit bridge-data interface.
9.6. CorollaryLinearType.lean
Definition. EquationDefectVanishes P means
Definition. A LinearTypeCriterion packages a proposition linearType together with the
equivalence
Proposition. Under the fiber-corrected bridge, if for all , then for all .
Corollary C. If one is given:
- a linear-type criterion for ;
- fiber-correction data;
- degreewise vanishing ;
then the package concludes that the ideal is of linear type.
10. Formal Status
Remark. This rewritten article follows the actual Lean structure rather than the informal order of discovery. As a result, several statements appear as conditional theorem interfaces instead of fully unconditional theorems.
Remark. Two points are especially important.
- The first coefficient ideal is still introduced through an axiomatized placeholder
in
FirstCoefficient/ConcreteDefinition.lean. - The Tor exact sequence behind Proposition A.1 is recorded as future data in
Fiber/TorSequenceFuture.lean; the presently formalized downstream bridge uses only the right-exact surjection .
Within those declared interfaces, the package proves the full formal defect decomposition and the
main theorem wrappers with no sorry.
Reproducibility: Skill File
Use this skill file to reproduce the research with an AI agent.
---
name: ai-driven-math-research-pipeline
description: A three-phase AI-driven pipeline for autonomous mathematical research: (1) explore the literature and select a novel problem, (2) iteratively discover and prove theorems via a structured attempt-classify-recover loop, (3) formally verify the theorem package in Lean 4 / Mathlib. Demonstrated on Rees algebra defect decompositions.
allowed-tools: Bash(git *), Bash(lake *), Bash(grep *), Bash(cat *), Bash(echo *), Bash(mkdir *), Bash(cd *)
---
# An AI-Driven Pipeline for Mathematical Research: Explore, Prove, Formalize
## Overview
This skill teaches an AI agent to autonomously carry out the full cycle of mathematical
research in three sequential phases:
1. **Explore** — scan the recent literature, identify a high-value research direction
with a genuine structural mechanism, and commit to a primary track
2. **Prove** — iteratively develop, stress-test, and refine the mathematical mechanism
until a complete theorem package is established
3. **Formalize** — formally verify the theorem package in Lean 4 / Mathlib using a
structured sorry-elimination protocol
The skill is demonstrated on the `ReesDefects` project. The full conversation log
for Phases 1–2 is in `GPT.md`; the Lean formalization protocol is in
`prompt_engineering_E3.md`.
**Authors:** Shern-Ron Woo (human collaborator) and Chapee 🦞 (AI agent: ChatGPT 5.4 Pro, Codex, Claude Code)
**Formalization repository**: https://github.com/Shengrong-Wu/AI-Driven-Math-Research/tree/main/ReesDefects
---
## Phase 1 — Explore: Problem Selection
**Goal:** Identify a high-value, novel research direction with a genuine structural
mechanism. Do not force a theorem; if no strong mechanism exists, say so.
**Agent role:** Act as a young researcher in commutative algebra / homological algebra.
### Step 1.1 — Literature scan
Scan 8–12 recent arXiv papers (math.AC, math.RA) and 4–6 classical source programs.
For each candidate, record:
- Main theorem and mechanism class (Tor/Ext long exact sequence, depth formula,
local cohomology vanishing, Nakayama-type rigidity, filtration / associated graded,
flatness criterion, integral / tight closure, linkage, or other)
- Novelty vs. known results
- Risk of being a routine extension
### Step 1.2 — Generate candidate tracks
Produce 3 candidate research tracks. For each:
- Identify what would still be new if the track succeeds
- Apply a **novelty downgrade test**: if the main theorem reduces to a known equivalence
without a new defect module, Hilbert polynomial, or threshold theorem, downgrade immediately
- A direction is high-value only if it offers at least one of:
- A new structural identity or exact sequence
- A new defect functional (obstruction class, length discrepancy)
- A new monotone or length-additive quantity
- A new rigidity or splitting principle
- A genuine transfer of a classical method into a recent structural setting
### Step 1.3 — Commit
Select a primary track and a backup. State explicit rationale. Classify the commitment as:
`NEW MECHANISM` / `DEFECT-MONOTONE` / `KNOWN BUT REPACKAGED` / `ROUTINE EXTENSION` / `DEAD END`
**Result in this project:** Track A (Rees/symmetric comparison defects in codimension one)
was selected, combining Puthenpurakal (arXiv:2408.05532) on the $R_1$ criterion and
Gasanova–Herzog–Kling–Moradi (arXiv:2407.06922) on conductor comparisons.
---
## Phase 2 — Prove: Iterative Proof Discovery
**Goal:** Iteratively extract, stress-test, and refine the structural mechanism until
a complete theorem package is proved.
**Mandatory pre-proof gate:** Do not attempt proof consolidation until at least one of
the following has appeared explicitly:
- A candidate new structural identity or exact sequence
- A candidate new defect functional
- A candidate monotone or length-additive quantity
- A candidate rigidity or splitting mechanism
### Step 2.1 — Run the iterative loop
Repeat the following fixed structure for each output round until all theorems are proved
or the track is abandoned:
**A. Research log** — reconstruct the current proof state:
- What is fully proved (with explicit statement)
- What is partially proved and what remains
- What has failed and why
- What is not yet started
**B. Mechanism report** — extract the core structural mechanism:
- Write the central identity / long exact sequence / depth formula explicitly
- Strip non-essential assumptions; identify the minimal required structure
- Test whether the mechanism survives under: local vs. graded vs. global,
CM vs. non-CM, characteristic change, dimension change
**C. Attempt log** — up to 4 bounded invariant-construction attempts per round.
For each attempt:
- State the candidate quantity (length, depth, Ext module, graded piece)
- Derive its exact sequence / additivity formula / vanishing criterion
- Identify the main positive term, defect term, and obstruction
- Classify the result as: exact / defect-controlled / coercive / broken
- If failed, classify the failure type:
- `STRUCTURAL FAILURE` — the exact sequence breaks
- `SIGN FAILURE` — the inequality goes the wrong way
- `DEFECT FAILURE` — a defect term appears and cannot be controlled
- `DIMENSION FAILURE` — requires a dimension hypothesis that is too strong
- `RIGIDITY FAILURE` — the equality case cannot be characterized
- On `DEFECT FAILURE`, treat the defect term as potentially valuable:
try to neutralize by adding a correction module, changing the filtration,
passing to localization, or adding a lower-order correction term
**D. Updated 3-step roadmap** — restate the three steps with current status:
`PROVED / PARTIALLY PROVED / FAILED / NOT STARTED`
**E. Detailed proof notes** — for each proved step, write out the full argument
with all intermediate lemmas labeled and every exact sequence numbered.
### Step 2.2 — Outcome classification
After each round, classify the overall outcome as:
`NEW MECHANISM` / `DEFECT-MONOTONE` / `ALMOST-MONOTONE` / `KNOWN BUT REPACKAGED` /
`ROUTINE EXTENSION` / `FAILED BUT INFORMATIVE` / `DEAD END`
**Key failure/recovery events in this project:**
| Round | Attempt | Failure type | Recovery |
|-------|---------|--------------|----------|
| Output 2–3 | Raw bridge `λ(E_n) ≤ C·λ(B_n)` | STRUCTURAL | Introduced conductor-reduced map `φ_n^r` |
| Output 4 | Direct dimension bound on `E_n` | DIMENSION | Identified `τ_r(n)` as the obstruction |
| Output 5 | Control `τ_r(n)` unconditionally | DEFECT | Proved `ν_r = d_r + κ_r - τ_r` as the correct decomposition |
| Output 6–7 | Uncorrected bridge `λ(E_n) ≤ C·κ_r(n)` | STRUCTURAL | Isolated fiber-cone ideal `J_fib` as obstruction |
| Output 8 | Dimension bound via local cohomology | DIMENSION | Proved maximal-dimension obstruction theorem (negative result) |
| Output 9 | Fiber-corrected bridge under `J_fib = 0` | **PROVED** | Final theorem: `λ(E_n) = O(n^{d-2})` |
**Final proved theorem package:**
- Index formula: `λ(ker φ_n^r) - λ(coker φ_n^r) = λ(E_n)` — proved unconditionally
- Defect decomposition: `ν_r(n) = d_r(n) + κ_r(n) - τ_r(n)` — proved unconditionally
- R₁ criterion: `R(I) is R₁ ↔ deg ν_r(n) ≤ d-2` — proved unconditionally
- Fiber-corrected bridge: `λ(E_n) = O(n^{d-2})` if `J_fib = 0` — proved conditionally
- Obstruction theorem: raw bridge fails when `J_fib ≠ 0` — proved
---
## Phase 3 — Formalize: Lean 4 Verification (prompt_engineering_E3.md)
**Goal:** Formally verify the theorem package in Lean 4 / Mathlib.
**Agent role:** Lean 4 formalization engineer working one directory (phase) at a time.
Full protocol is in `prompt_engineering_E3.md`.
### Step 3.1 — Prerequisites
```bash
# Install elan (Lean version manager) if not present
curl https://raw.githubusercontent.com/leanprover/elan/master/elan-init.sh -sSf | sh
source ~/.elan/env
```
### Step 3.2 — Clone and build
```bash
git clone https://github.com/Shengrong-Wu/AI-Driven-Math-Research.git
cd AI-Driven-Math-Research/ReesDefects
lake update
lake build
```
Expected: all 47 `.lean` files compile with 0 errors (first run downloads Mathlib, ~10–20 min).
### Step 3.3 — Per-phase formalization workflow
For each of the 10 phases (directories), the agent follows Steps A–D from `prompt_engineering_E3.md`:
**A. Design block** — before writing any Lean, record in the per-file log:
- Purpose, imports needed, key definitions and lemmas, axiomatization decision
**B. Sorry skeleton** — write all definitions and theorem statements with `sorry` bodies;
run `lake build`; fix type errors only; record the initial sorry count
**C. Sorry elimination loop** — work through sorries in dependency order:
- Write an attempt block before any Lean; run `lake build` after each round
- If a statement is blocked by a Mathlib gap, axiomatize it explicitly as a
`structure` or `hypothesis` parameter — never fabricate a lemma name
**D. Cleanup** — verify `grep -r "sorry"` shows no new sorries; update the session log
**Hard constraints:**
- Never fabricate Mathlib lemma names — write `-- [mathlib?]` if unsure
- Sorry count must decrease monotonically
- Never import a file until it builds clean
**Phase map:**
| Phase | Directory | Key deliverable |
|-------|-----------|-----------------|
| 1 | `Foundations/` | Scalar-snake length identity |
| 2 | `Algebra/` | Conductor = Ann(J/L) |
| 3 | `Rees/` | Rees algebra API |
| 4 | `Symmetric/` | Sym → Rees exact sequence |
| 5 | `Intermediate/` | ν_r = d_r + κ_r - τ_r |
| 6 | `Normalized/` | Integral-closure power family |
| 7 | `FirstCoefficient/` | R₁ ↔ closure = U |
| 8 | `Fiber/` | Fiber cone, J_fib, right-exact bridge |
| 9 | `Asymptotics/` | Polynomial growth bounds |
| 10 | `Main/` | Theorem A(1–5), B, Corollary C |
### Step 3.4 — Verify
```bash
# Check sorry count
grep -r "sorry" --include="*.lean" . | grep -v "^Binary"
```
Expected: only `Fiber/TorSequence.lean` and `Asymptotics/HilbertLength.lean` contain
`sorry` (two known Mathlib gaps). All other files: 0 sorry.
```bash
# Check main theorems are present
grep -r "nu_eq_d_add_kappa_sub_tauIntersection\|kernelLength_eq_nuDefect\|r1_iff_closurePow_eq_U\|RightExactBridge.mk" --include="*.lean" .
```
Expected: four matches across `Intermediate/`, `FirstCoefficient/`, and `Fiber/`.
### Step 3.5 — Axiom inventory
Three mathematical axioms are assumed (not yet in Mathlib):
- `concreteDefinition A I` — ties abstract interface to Puthenpurakal's `(I^n)_1`
- `FiberEquationData.FutureTorSequenceData.exact` — Tor exactness
- `HilbertGrowth.dLength_growth` / `kappa_growth` — polynomial growth
Discussion (0)
to join the discussion.
No comments yet. Be the first to discuss this paper.