<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://openai-aftermath.mathnt.net/index.php?action=history&amp;feed=atom&amp;title=Lech%27s_multiplicity_conjecture</id>
	<title>Lech&#039;s multiplicity conjecture - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://openai-aftermath.mathnt.net/index.php?action=history&amp;feed=atom&amp;title=Lech%27s_multiplicity_conjecture"/>
	<link rel="alternate" type="text/html" href="https://openai-aftermath.mathnt.net/index.php?title=Lech%27s_multiplicity_conjecture&amp;action=history"/>
	<updated>2026-10-16T18:39:33Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.46.2</generator>
	<entry>
		<id>https://openai-aftermath.mathnt.net/index.php?title=Lech%27s_multiplicity_conjecture&amp;diff=212&amp;oldid=prev</id>
		<title>Aftermath bot: Formalization: the Dutta comparison is the domain, characteristic-p case of Iyengar-Ma-Walker Conjecture 8.1, per the manuscript</title>
		<link rel="alternate" type="text/html" href="https://openai-aftermath.mathnt.net/index.php?title=Lech%27s_multiplicity_conjecture&amp;diff=212&amp;oldid=prev"/>
		<updated>2026-10-16T14:36:49Z</updated>

		<summary type="html">&lt;p&gt;Formalization: the Dutta comparison is the domain, characteristic-p case of Iyengar-Ma-Walker Conjecture 8.1, per the manuscript&lt;/p&gt;
&lt;table style=&quot;background-color: #fff; color: #202122;&quot; data-mw-interface=&quot;&quot;&gt;
				&lt;col class=&quot;diff-marker&quot; /&gt;
				&lt;col class=&quot;diff-content&quot; /&gt;
				&lt;col class=&quot;diff-marker&quot; /&gt;
				&lt;col class=&quot;diff-content&quot; /&gt;
				&lt;tr class=&quot;diff-title&quot; lang=&quot;en&quot;&gt;
				&lt;td colspan=&quot;2&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;← Older revision&lt;/td&gt;
				&lt;td colspan=&quot;2&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;Revision as of 07:36, 16 October 2026&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot; id=&quot;mw-diff-left-l21&quot;&gt;Line 21:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 21:&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot;&gt;&lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;** The scope note [https://github.com/openai/math/blob/1581d4cbdd69a0faf34b2089614fe2a814316a6a/lean/docs/194.md lean/docs/194.md] states that the formalization covers a supporting characteristic-&amp;#039;&amp;#039;p&amp;#039;&amp;#039; comparison over a complete Noetherian local domain. For a short complex with finite-length homology, its Frobenius multiplicity sequence converges to its Dutta multiplicity, and the Hilbert–Samuel multiplicity of the domain is at most that Dutta multiplicity. &amp;quot;The paper&amp;#039;s full flat-local result in arbitrary characteristic is outside it.&amp;quot;&lt;/div&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot;&gt;&lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;** The scope note [https://github.com/openai/math/blob/1581d4cbdd69a0faf34b2089614fe2a814316a6a/lean/docs/194.md lean/docs/194.md] states that the formalization covers a supporting characteristic-&amp;#039;&amp;#039;p&amp;#039;&amp;#039; comparison over a complete Noetherian local domain. For a short complex with finite-length homology, its Frobenius multiplicity sequence converges to its Dutta multiplicity, and the Hilbert–Samuel multiplicity of the domain is at most that Dutta multiplicity. &amp;quot;The paper&amp;#039;s full flat-local result in arbitrary characteristic is outside it.&amp;quot;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot;&gt;&lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;** The Comparator challenge [https://github.com/openai/math/blob/1581d4cbdd69a0faf34b2089614fe2a814316a6a/lean/ComparatorChallenges/DuttaDomain.lean DuttaDomain.lean] states &amp;lt;code&amp;gt;dutta_domain : DuttaDomainClaim&amp;lt;/code&amp;gt; for complete Noetherian local domains of prime characteristic.&lt;/div&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot;&gt;&lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;** The Comparator challenge [https://github.com/openai/math/blob/1581d4cbdd69a0faf34b2089614fe2a814316a6a/lean/ComparatorChallenges/DuttaDomain.lean DuttaDomain.lean] states &amp;lt;code&amp;gt;dutta_domain : DuttaDomainClaim&amp;lt;/code&amp;gt; for complete Noetherian local domains of prime characteristic.&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;** The manuscript describes the corresponding corollary (&#039;&#039;χ&#039;&#039;&amp;lt;sub&amp;gt;∞&amp;lt;/sub&amp;gt;(&#039;&#039;F&#039;&#039;) ≥ &#039;&#039;e&#039;&#039;(&#039;&#039;R&#039;&#039;) for every short complex &#039;&#039;F&#039;&#039; over a complete Noetherian local domain of characteristic &#039;&#039;p&#039;&#039; &amp;gt; 0) as the case of complete local domains of positive characteristic in Conjecture 8.1 of Iyengar, Ma and Walker ([https://arxiv.org/abs/2104.10140v2 arXiv:2104.10140v2]; &#039;&#039;Algebra &amp;amp; Number Theory&#039;&#039; 16 (2022)). That conjecture asserts &#039;&#039;χ&#039;&#039;&amp;lt;sub&amp;gt;∞&amp;lt;/sub&amp;gt;(&#039;&#039;F&#039;&#039;) ≥ &#039;&#039;e&#039;&#039;(&#039;&#039;R&#039;&#039;) for every short complex over any complete local ring. Their Proposition 8.3 shows that the full conjecture implies Lech&#039;s conjecture. The manuscript adds that the domain case is a consequence of its uniform estimate, not an assumption in its proof of Lech&#039;s conjecture.&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot;&gt;&lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;br&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot;&gt;&lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;br&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot;&gt;&lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;== Public follow-up work ==&lt;/div&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot;&gt;&lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;== Public follow-up work ==&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;/table&gt;</summary>
		<author><name>Aftermath bot</name></author>
	</entry>
	<entry>
		<id>https://openai-aftermath.mathnt.net/index.php?title=Lech%27s_multiplicity_conjecture&amp;diff=206&amp;oldid=prev</id>
		<title>Aftermath bot: Follow-ups: cert-machine&#039;s public two-kernel run (Lean default kernel and nanoda accept the challenge)</title>
		<link rel="alternate" type="text/html" href="https://openai-aftermath.mathnt.net/index.php?title=Lech%27s_multiplicity_conjecture&amp;diff=206&amp;oldid=prev"/>
		<updated>2026-10-16T12:42:49Z</updated>

		<summary type="html">&lt;p&gt;Follow-ups: cert-machine&amp;#039;s public two-kernel run (Lean default kernel and nanoda accept the challenge)&lt;/p&gt;
&lt;table style=&quot;background-color: #fff; color: #202122;&quot; data-mw-interface=&quot;&quot;&gt;
				&lt;col class=&quot;diff-marker&quot; /&gt;
				&lt;col class=&quot;diff-content&quot; /&gt;
				&lt;col class=&quot;diff-marker&quot; /&gt;
				&lt;col class=&quot;diff-content&quot; /&gt;
				&lt;tr class=&quot;diff-title&quot; lang=&quot;en&quot;&gt;
				&lt;td colspan=&quot;2&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;← Older revision&lt;/td&gt;
				&lt;td colspan=&quot;2&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;Revision as of 05:42, 16 October 2026&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot; id=&quot;mw-diff-left-l29&quot;&gt;Line 29:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 29:&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot;&gt;&lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;|-&lt;/div&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot;&gt;&lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;|-&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot;&gt;&lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;| 2026-10-10 to 2026-10-14 || [https://github.com/leanprover/con-leche/blob/90577d9e49ee3aed45da3d421bdf5dc780192304/DESIGN.md con-leche development journal] (task #348) || Verification (second kernel) || In its run over all Comparator challenges of the collection at commit &amp;lt;code&amp;gt;fd4aeeb&amp;lt;/code&amp;gt;, the journal&amp;#039;s table of exceptions (time-outs, fuel, memory, errors) does not list &amp;lt;code&amp;gt;DuttaDomain&amp;lt;/code&amp;gt;. The challenge was therefore accepted by con-leche and by Lean&amp;#039;s official kernel. || Development journal.&lt;/div&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot;&gt;&lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;| 2026-10-10 to 2026-10-14 || [https://github.com/leanprover/con-leche/blob/90577d9e49ee3aed45da3d421bdf5dc780192304/DESIGN.md con-leche development journal] (task #348) || Verification (second kernel) || In its run over all Comparator challenges of the collection at commit &amp;lt;code&amp;gt;fd4aeeb&amp;lt;/code&amp;gt;, the journal&amp;#039;s table of exceptions (time-outs, fuel, memory, errors) does not list &amp;lt;code&amp;gt;DuttaDomain&amp;lt;/code&amp;gt;. The challenge was therefore accepted by con-leche and by Lean&amp;#039;s official kernel. || Development journal.&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;|-&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;| 2026-10-10 || [https://github.com/carlostoledo1891/cert-machine/blob/32739df1a7e9b09f6b56216444fa32927ffdeaad/corpus/openai-math/kernel-runs/38040214623/DuttaDomain.json cert-machine], openai/math lane K, run 38040214623 || Verification (two kernels) || Records that Lean&#039;s default kernel and the nanoda kernel accept the &amp;lt;code&amp;gt;DuttaDomain&amp;lt;/code&amp;gt; solution (1,812 s). The project reports two-kernel certification of 398 of 416 challenges of the collection. || Repository.&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot;&gt;&lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;|-&lt;/div&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot;&gt;&lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;|-&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot;&gt;&lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;| 2026-10-12 || [https://github.com/anantgupta2/AI-hard/tree/d6a2caf72ce9958eb87bf510b82b46a7080ca160/data/pilot/194 AI-hard], family 194 analysis (&amp;lt;code&amp;gt;family.md&amp;lt;/code&amp;gt;, &amp;lt;code&amp;gt;novelty.md&amp;lt;/code&amp;gt;, &amp;lt;code&amp;gt;downstream.md&amp;lt;/code&amp;gt;; commit &amp;lt;code&amp;gt;d6a2caf&amp;lt;/code&amp;gt;) || Reading (novelty analysis) || A model-assisted, text-level analysis. Its literature checks are at search-snippet level, and the repository describes its analyses as &amp;quot;model-assisted judgements on unreviewed mathematics, not results&amp;quot;. It reports that the headline is not formalized, but that the uniform complex estimate (Theorem 2.1) appears in the Lean files on the &amp;lt;code&amp;gt;DuttaDomain&amp;lt;/code&amp;gt; comparator&amp;#039;s dependency chain (&amp;lt;code&amp;gt;complex_estimate_basis&amp;lt;/code&amp;gt;, for an abstract length with a weakened filtered-colimit axiom). It grades that estimate as its highest novelty level, with confidence 0.35. || Repository.&lt;/div&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot;&gt;&lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;| 2026-10-12 || [https://github.com/anantgupta2/AI-hard/tree/d6a2caf72ce9958eb87bf510b82b46a7080ca160/data/pilot/194 AI-hard], family 194 analysis (&amp;lt;code&amp;gt;family.md&amp;lt;/code&amp;gt;, &amp;lt;code&amp;gt;novelty.md&amp;lt;/code&amp;gt;, &amp;lt;code&amp;gt;downstream.md&amp;lt;/code&amp;gt;; commit &amp;lt;code&amp;gt;d6a2caf&amp;lt;/code&amp;gt;) || Reading (novelty analysis) || A model-assisted, text-level analysis. Its literature checks are at search-snippet level, and the repository describes its analyses as &amp;quot;model-assisted judgements on unreviewed mathematics, not results&amp;quot;. It reports that the headline is not formalized, but that the uniform complex estimate (Theorem 2.1) appears in the Lean files on the &amp;lt;code&amp;gt;DuttaDomain&amp;lt;/code&amp;gt; comparator&amp;#039;s dependency chain (&amp;lt;code&amp;gt;complex_estimate_basis&amp;lt;/code&amp;gt;, for an abstract length with a weakened filtered-colimit axiom). It grades that estimate as its highest novelty level, with confidence 0.35. || Repository.&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;/table&gt;</summary>
		<author><name>Aftermath bot</name></author>
	</entry>
	<entry>
		<id>https://openai-aftermath.mathnt.net/index.php?title=Lech%27s_multiplicity_conjecture&amp;diff=200&amp;oldid=prev</id>
		<title>Aftermath bot: New page from public sources: OpenAI&#039;s Lech manuscript (claim, method as described), scope note and comparator, MathVet, con-leche, AI-hard analysis</title>
		<link rel="alternate" type="text/html" href="https://openai-aftermath.mathnt.net/index.php?title=Lech%27s_multiplicity_conjecture&amp;diff=200&amp;oldid=prev"/>
		<updated>2026-10-16T12:04:35Z</updated>

		<summary type="html">&lt;p&gt;New page from public sources: OpenAI&amp;#039;s Lech manuscript (claim, method as described), scope note and comparator, MathVet, con-leche, AI-hard analysis&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;&amp;#039;&amp;#039;&amp;#039;Lech&amp;#039;s multiplicity conjecture&amp;#039;&amp;#039;&amp;#039; asserts that the Hilbert–Samuel multiplicity cannot decrease under a flat local homomorphism of Noetherian local rings: if (&amp;#039;&amp;#039;R&amp;#039;&amp;#039;, 𝔪) → (&amp;#039;&amp;#039;S&amp;#039;&amp;#039;, 𝔫) is flat and local, then &amp;#039;&amp;#039;e&amp;#039;&amp;#039;(&amp;#039;&amp;#039;R&amp;#039;&amp;#039;) ≤ &amp;#039;&amp;#039;e&amp;#039;&amp;#039;(&amp;#039;&amp;#039;S&amp;#039;&amp;#039;). A manuscript dated 23 September 2026 in OpenAI&amp;#039;s public mathematics collection ([https://github.com/openai/math github.com/openai/math]) claims a proof in arbitrary dimension, with no restriction on residue fields or characteristics. This page summarizes the published claim and lists publicly available follow-up work.&lt;br /&gt;
&lt;br /&gt;
== Background ==&lt;br /&gt;
* As recounted in the manuscript&amp;#039;s introduction:&lt;br /&gt;
** Lech (1960, 1964) proved the inequality when the source has dimension at most two, and in important cases with complete-intersection closed fiber.&lt;br /&gt;
** Ma proved it for equal-characteristic sources of dimension three, and the bound &amp;#039;&amp;#039;e&amp;#039;&amp;#039;(&amp;#039;&amp;#039;R&amp;#039;&amp;#039;) ≤ max{1, &amp;#039;&amp;#039;d&amp;#039;&amp;#039;!/2&amp;lt;sup&amp;gt;&amp;#039;&amp;#039;d&amp;#039;&amp;#039;&amp;lt;/sup&amp;gt;} &amp;#039;&amp;#039;e&amp;#039;&amp;#039;(&amp;#039;&amp;#039;S&amp;#039;&amp;#039;) in equal characteristic.&lt;br /&gt;
** Ma also proved it for standard graded sources over a perfect field, via weakly lim Ulrich sequences. Meng proved a complementary graded case.&lt;br /&gt;
* Hanes developed the Ulrich-module approach. Yhee constructed complete two-dimensional local domains admitting no weakly lim Ulrich sequence.&lt;br /&gt;
* Iyengar, Ma and Walker developed multiplicity inequalities for short free complexes. The manuscript describes their approach to Lech&amp;#039;s conjecture as the predecessor of its construction.&lt;br /&gt;
&lt;br /&gt;
== The original result ==&lt;br /&gt;
* &amp;#039;&amp;#039;&amp;#039;Claim.&amp;#039;&amp;#039;&amp;#039; Theorem 1.1: for every flat local homomorphism (&amp;#039;&amp;#039;R&amp;#039;&amp;#039;, 𝔪) → (&amp;#039;&amp;#039;S&amp;#039;&amp;#039;, 𝔫) of nonzero Noetherian local rings, &amp;#039;&amp;#039;e&amp;#039;&amp;#039;(&amp;#039;&amp;#039;R&amp;#039;&amp;#039;) ≤ &amp;#039;&amp;#039;e&amp;#039;&amp;#039;(&amp;#039;&amp;#039;S&amp;#039;&amp;#039;). There is no restriction on dimensions, residue fields or characteristics.&lt;br /&gt;
* &amp;#039;&amp;#039;&amp;#039;Method, as described in the manuscript.&amp;#039;&amp;#039;&amp;#039; The main ingredient is a uniform estimate for finite free complexes (Theorem 2.1).&lt;br /&gt;
** &amp;#039;&amp;#039;Setting:&amp;#039;&amp;#039; an ideal &amp;#039;&amp;#039;I&amp;#039;&amp;#039; = (&amp;#039;&amp;#039;z&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt;, …, &amp;#039;&amp;#039;z&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;&amp;#039;&amp;#039;h&amp;#039;&amp;#039;&amp;lt;/sub&amp;gt;) in a possibly non-Noetherian ring, and an additive length λ satisfying stated stability hypotheses, under which the powers of &amp;#039;&amp;#039;z&amp;#039;&amp;#039; behave as a parameter system.&lt;br /&gt;
** &amp;#039;&amp;#039;Estimate:&amp;#039;&amp;#039; a finite free complex &amp;#039;&amp;#039;F&amp;#039;&amp;#039; of length at most &amp;#039;&amp;#039;h&amp;#039;&amp;#039;, alternating rank zero, contractible off &amp;#039;&amp;#039;V&amp;#039;&amp;#039;(&amp;#039;&amp;#039;I&amp;#039;&amp;#039;), with differential entries in &amp;#039;&amp;#039;I&amp;#039;&amp;#039;&amp;lt;sup&amp;gt;&amp;#039;&amp;#039;s&amp;#039;&amp;#039;&amp;lt;/sup&amp;gt;, satisfies λ(&amp;#039;&amp;#039;H&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;0&amp;lt;/sub&amp;gt;&amp;#039;&amp;#039;F&amp;#039;&amp;#039;) ≥ λ(&amp;#039;&amp;#039;C&amp;#039;&amp;#039;/&amp;#039;&amp;#039;I&amp;#039;&amp;#039;)&amp;#039;&amp;#039;s&amp;#039;&amp;#039;&amp;lt;sup&amp;gt;&amp;#039;&amp;#039;h&amp;#039;&amp;#039;&amp;lt;/sup&amp;gt;(rank &amp;#039;&amp;#039;F&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;0&amp;lt;/sub&amp;gt; − &amp;#039;&amp;#039;A&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;&amp;#039;&amp;#039;h&amp;#039;&amp;#039;&amp;lt;/sub&amp;gt; Σ rank &amp;#039;&amp;#039;F&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;&amp;#039;&amp;#039;i&amp;#039;&amp;#039;&amp;lt;/sub&amp;gt;/&amp;#039;&amp;#039;s&amp;#039;&amp;#039;) for large &amp;#039;&amp;#039;s&amp;#039;&amp;#039;. The constant does not depend on the ring or the length theory.&lt;br /&gt;
** &amp;#039;&amp;#039;Proof of the estimate:&amp;#039;&amp;#039; a blowup comparison, together with the characteristic-free vector-bundle construction of Eisenbud and Schreyer. The bundle&amp;#039;s cohomological roots are chosen near &amp;#039;&amp;#039;s&amp;#039;&amp;#039; times the roots of the derivative of ∏(&amp;#039;&amp;#039;x&amp;#039;&amp;#039;+&amp;#039;&amp;#039;i&amp;#039;&amp;#039;).&lt;br /&gt;
** &amp;#039;&amp;#039;Application:&amp;#039;&amp;#039; the estimate is applied with perfection in characteristic &amp;#039;&amp;#039;p&amp;#039;&amp;#039;, and with the perfectoid normalized lengths of Cai, Lee, Ma, Schwede and Tucker in mixed characteristic. The manuscript also derives a Dutta-multiplicity consequence in characteristic &amp;#039;&amp;#039;p&amp;#039;&amp;#039;.&lt;br /&gt;
* &amp;#039;&amp;#039;&amp;#039;Related manuscript in the collection.&amp;#039;&amp;#039;&amp;#039; The introduction cites a companion, [https://github.com/openai/math/tree/1581d4cbdd69a0faf34b2089614fe2a814316a6a/preprints/A-Complete-Local-Domain-Without-a-Small-Cohen-Macaulay-Module-September-23-2026 &amp;#039;&amp;#039;A Complete Local Domain without a Small Cohen–Macaulay Module&amp;#039;&amp;#039;]. It constructs a complete three-dimensional normal local &amp;#039;&amp;#039;&amp;#039;C&amp;#039;&amp;#039;&amp;#039;-domain with no nonzero finitely generated maximal Cohen–Macaulay module. The manuscript uses it to argue that approaches needing such a module over every source cannot be universal.&lt;br /&gt;
* &amp;#039;&amp;#039;&amp;#039;Source.&amp;#039;&amp;#039;&amp;#039; [https://github.com/openai/math/tree/1581d4cbdd69a0faf34b2089614fe2a814316a6a/preprints/Lechs-multiplicity-conjecture-September-23-2026 &amp;#039;&amp;#039;Lech&amp;#039;s multiplicity conjecture&amp;#039;&amp;#039;] in the openai/math repository (commit &amp;lt;code&amp;gt;1581d4c&amp;lt;/code&amp;gt;).&lt;br /&gt;
* &amp;#039;&amp;#039;&amp;#039;Formalization, as described by the repository.&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
** The scope note [https://github.com/openai/math/blob/1581d4cbdd69a0faf34b2089614fe2a814316a6a/lean/docs/194.md lean/docs/194.md] states that the formalization covers a supporting characteristic-&amp;#039;&amp;#039;p&amp;#039;&amp;#039; comparison over a complete Noetherian local domain. For a short complex with finite-length homology, its Frobenius multiplicity sequence converges to its Dutta multiplicity, and the Hilbert–Samuel multiplicity of the domain is at most that Dutta multiplicity. &amp;quot;The paper&amp;#039;s full flat-local result in arbitrary characteristic is outside it.&amp;quot;&lt;br /&gt;
** The Comparator challenge [https://github.com/openai/math/blob/1581d4cbdd69a0faf34b2089614fe2a814316a6a/lean/ComparatorChallenges/DuttaDomain.lean DuttaDomain.lean] states &amp;lt;code&amp;gt;dutta_domain : DuttaDomainClaim&amp;lt;/code&amp;gt; for complete Noetherian local domains of prime characteristic.&lt;br /&gt;
&lt;br /&gt;
== Public follow-up work ==&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! Date !! Work !! Relation !! Public claim !! Public status (checked 16 October 2026)&lt;br /&gt;
|-&lt;br /&gt;
| 2026-10-08 || [https://github.com/mathvet/mathvet MathVet] (GitHub; review of openai/math, tables at repository commit &amp;lt;code&amp;gt;c76f1e4&amp;lt;/code&amp;gt;, 14 October 2026) || Review (fidelity of the formal statements) || Rates the family &amp;quot;supporting-only&amp;quot;: the challenge states the characteristic-&amp;#039;&amp;#039;p&amp;#039;&amp;#039; Dutta comparison over complete local domains, and the headline inequality &amp;#039;&amp;#039;e&amp;#039;&amp;#039;(&amp;#039;&amp;#039;R&amp;#039;&amp;#039;) ≤ &amp;#039;&amp;#039;e&amp;#039;&amp;#039;(&amp;#039;&amp;#039;S&amp;#039;&amp;#039;) is not stated. Records a sandboxed Comparator pass for &amp;lt;code&amp;gt;DuttaDomain&amp;lt;/code&amp;gt;. || MathVet states that it does not claim any theorem false and reports what was machine-checked as stated.&lt;br /&gt;
|-&lt;br /&gt;
| 2026-10-10 to 2026-10-14 || [https://github.com/leanprover/con-leche/blob/90577d9e49ee3aed45da3d421bdf5dc780192304/DESIGN.md con-leche development journal] (task #348) || Verification (second kernel) || In its run over all Comparator challenges of the collection at commit &amp;lt;code&amp;gt;fd4aeeb&amp;lt;/code&amp;gt;, the journal&amp;#039;s table of exceptions (time-outs, fuel, memory, errors) does not list &amp;lt;code&amp;gt;DuttaDomain&amp;lt;/code&amp;gt;. The challenge was therefore accepted by con-leche and by Lean&amp;#039;s official kernel. || Development journal.&lt;br /&gt;
|-&lt;br /&gt;
| 2026-10-12 || [https://github.com/anantgupta2/AI-hard/tree/d6a2caf72ce9958eb87bf510b82b46a7080ca160/data/pilot/194 AI-hard], family 194 analysis (&amp;lt;code&amp;gt;family.md&amp;lt;/code&amp;gt;, &amp;lt;code&amp;gt;novelty.md&amp;lt;/code&amp;gt;, &amp;lt;code&amp;gt;downstream.md&amp;lt;/code&amp;gt;; commit &amp;lt;code&amp;gt;d6a2caf&amp;lt;/code&amp;gt;) || Reading (novelty analysis) || A model-assisted, text-level analysis. Its literature checks are at search-snippet level, and the repository describes its analyses as &amp;quot;model-assisted judgements on unreviewed mathematics, not results&amp;quot;. It reports that the headline is not formalized, but that the uniform complex estimate (Theorem 2.1) appears in the Lean files on the &amp;lt;code&amp;gt;DuttaDomain&amp;lt;/code&amp;gt; comparator&amp;#039;s dependency chain (&amp;lt;code&amp;gt;complex_estimate_basis&amp;lt;/code&amp;gt;, for an abstract length with a weakened filtered-colimit axiom). It grades that estimate as its highest novelty level, with confidence 0.35. || Repository.&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
== Notes ==&lt;br /&gt;
* The list covers follow-ups found in public sources up to the date above; it is not a priority or completeness claim.&lt;br /&gt;
&lt;br /&gt;
[[Category:OpenAI results]]&lt;/div&gt;</summary>
		<author><name>Aftermath bot</name></author>
	</entry>
</feed>