Matching works

16 works

math-ph — Mathematical Physics

From Four-Dimensional Wilson Lattice Gauge Theory to Quantum Yang--Mills Theory: Construction with Proofs from Certified Assumptions, and the Record of Its Independent Validation

Contributed by Zeng Chunping

We present a complete formal paper compiling the Lean-verified construction of quantum Yang--Mills theory submitted on October 28, 2026, and independently validated by the Yang--Mills Shepherding Committee. Starting from the Wilson definition of lattice gauge theory on a four-dimensional torus, we give full proofs of every step that can be carried out from the definitions: the field-label algebra, the finite lattice theory, and---under an explicit, individually certified package of renormalization-group and analytic assumptions (RG1)--(RG5), (UV1), (PH1)--(PH3), (AN1), (Y1)--(Y4), (B1), (C1)---the fixed-volume ultraviolet limit, the subsequential infinite-volume limit, the phase decomposition with clustering and full support, the Osterwalder--Schrader reconstruction satisfying the Wightman axioms, and the Yang--Mills identification: the stress tensor and its Ward identity, the trace anomaly with the verified constant 3dim⁡Rg/π43\dim_{\mathbb{R}}\mathfrak{g}/\pi^{4}, the exclusion of a precise class of free-field descriptions, the one-loop running coupling, and the operator product expansion. The independent validation (clean rebuild, Lean kernel replay, Comparator runs, the verification of the OS axioms against an independent axiom system, and the lattice-law, Ward-identity, common-scale, short-distance, and OPE adapters) is recorded in the second part. Two errata to the source validation document are corrected in the text. For the mass gap we prove two logical boundaries: an explicit OS model satisfies all sixteen registered inputs, with E4 clustering (equivalently, vacuum uniqueness) holding, yet its Hamiltonian has no spectral gap, and a mass gap is equivalent to a uniform exponential rate in the clustering axiom E4; the sixteen registered inputs therefore do not imply a mass gap. The gap problem is reduced to a single volume-uniform, label-uniform rate (MG); the cluster-expansion, spectral, rate and Wilson-loop routes, the random-mechanics criteria, the source-level adjudication, and the complete status are recorded in an appendix. A positive mass gap, uniqueness of the infinite-volume limit, uniqueness of the vacuum of the mixed theory, and order-by-order agreement of the OPE with perturbation theory are not proved, and the paper records precisely what is and is not proved at every step.

Author comments: Recompiled with complete proofs from the committee's validation document (2026-11-10 release) of the Lean-verified OpenAI Yang--Mills construction (2026-10-28), incorporating the readable re-proof and the review-and-supplement packages. All proofs that can be carried out from the definitions and the certified assumption package (16 external inputs) are given in full; two errata of the source document are corrected (the $I^2=1$ contraction identity and the $\log^2$ weight of the free-field exclusion). The mass-gap problem is reduced to the single uniform rate (MG); Appendix E records the complete adjudicated status including rate theorems, counterexample families, cluster-expansion and local-mixing routes, and source-level adjudications.

A mix of human-written and AI-generated textHuman understanding: some partsLeanOPEOS/Wightman axiomsRGWilson latticeYang-Millsconstructive QFTmass gaptrace anomaly
Nov 15, 202681 pages
PDFView work

cs.LO — Logic in Computer Science

A Lean 4 formalization of the area law for three-dimensional U(1) lattice gauge theory with the Wilson action

Contributed by Tejasvi Singh Tomar

In three-dimensional U(1)U(1) lattice gauge theory with the Wilson action, static charges are confined at every coupling: rectangular Wilson loops obey an area law, uniformly in the finite box. This was proved recently by the author in a separate paper; the proof runs to over three hundred pages with its supplement and adapts the Debye-screening analysis of Brydges and Federbush and the multiscale expansion of Göpfert and Mack. We describe a formalization of this proof in Lean 4 with Mathlib, which also covers the paper's corollaries and its appendix on comparing Wilson and Villain loops. The formal theorems take no hypotheses and use only the standard axioms of Lean. The proof became formalizable through explicit interfaces between its parts, written-out versions of the steps that the paper adapts from the literature or leaves out, and certified values for every numerical constant. The formalization also yielded 70 corrections and improvements to the paper, none of which changes its main results.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23752572

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 12, 202619 pages
PDFView work

cs.LO — Logic in Computer Science

Re-proving native_decide facts in Lean's kernel: a study of 16 public packages and a converter

Contributed by Tejasvi Singh Tomar

Lean's native_decide proves a decidable proposition by running compiled code and records the result as an axiom. Mathlib forbids such axioms, and lake check and Comparator in Lean 4.35 reject them, as do the independent proof checkers. NativeTrust re-proves the recorded facts in Lean's kernel, with only the standard axioms and without editing the projects that contain them. Where a definition blocks kernel evaluation and NativeTrust has a version proved equal to it (for example, a fuel-indexed form of well-founded recursion), the converter evaluates a copy that uses that version. It then proves the copy equal to the original, usually by congruence. With its default settings it converts 98.2% of 52,821 native facts in 16 public packages. The three largest packages hold 94% of these facts; outside them it converts 68.5%. Nearly every converted fact needed nothing beyond plain kernel evaluation. Two tools remove the native axioms that the kernel can prove within a budget: a single import that makes each call of the tactic try the kernel first, and a source rewriter.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23818391

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 12, 202627 pages
PDFView work

math.HO — History and Overview

The 57 Grothendieckian Problems: Open Problems for Mathematics and Machine Reasoning from the Grothendieckian Programme

Contributed by Vincent Liu

We state fifty-seven open problems drawn from the seven works of the Grothendieckian Programme (34 volumes, 26,021 pages, released openly in October 2026 as first drafts that have not been peer-reviewed). Thirty-five come from the two works on the architecture of a reasoning system and twenty-two from the five works that each take a named conjecture or programme as research subject; no problem is one of those conjectures. Each problem is stated in the words of its source, located by work, chapter and page, given the status the source assigns it, and paired with a criterion that decides when it is solved, a note on existing work and the date of a literature check. The problems are of three kinds: twenty-five mathematical problems, nineteen machine problems with success criteria fixed in advance, and thirteen formalization problems for Lean 4 and Mathlib. Every quotation from the sources has been checked against the published PDFs, and each problem has been checked against the literature as of 28 October 2026; a machine-readable version accompanies the paper.

Author comments: 54 pages, 5 figures. Version 1.0 of 28 October 2026; the same text is deposited at Zenodo, DOI 10.5281/zenodo.23734427 (all versions: 10.5281/zenodo.23734426). This copy was typeset with pdfLaTeX for Hexagon: its text is identical to version 1.0 at Zenodo, whose sealed PDF was typeset with LuaLaTeX, and a few line and page breaks differ. Each problem has a public issue at https://github.com/AlienMuse/grothendieckian-problems, which also holds the machine-readable data, the literature-check records and the Lean statement of Problem 49. Corrections recorded since version 1.0, including literature missed by the check for Problem 18: https://github.com/AlienMuse/grothendieckian-problems/blob/main/ERRATA.md. Companion papers: The Grothendieckian Programme: An Overview (DOI 10.5281/zenodo.23734421) and The Rising-Sea Theses (DOI 10.5281/zenodo.23734423).

A mix of human-written and AI-generated textHuman understanding: all partsGrothendieckian ProgrammeLeandescentformal verificationmachine reasoningopen problems
Nov 10, 202654 pages
PDFView work

math.NT — Number Theory

Saouter's primality criterion in Lean, a ladder constant, and a 25 rung route to odd Goldbach up to 102010^{20}

Contributed by Steve Hubbard

This note gives Lean proofs, with no hypothesis, of the primality criterion of Saouter's paper, Lemma 1 for every even FF, Theorems 1 and 2, and it records the reading of the constant on page 865 under which the formula agrees with the rest of the paper; separately, given the published even Goldbach computation to 4⋅10184\cdot 10^{18} as an explicit hypothesis, a ladder of 25 Proth primes reaches 102010^{20} in the Lean kernel. The binary Goldbach conjecture remains open and this note makes no progress on it. The ternary Goldbach theorem for all odd numbers is Helfgott's (arXiv:1312.7748), and it is not formalized here and not used.

Author comments: 8 pages. Version 3 of the note, first deposit on Hexagon.

Primarily AI-generated textHuman understanding: some partsGoldbach ConjectureLean 4Proth primesformal verificationprimality criterion
Nov 06, 20268 pages
PDFView work

math.NT — Number Theory

An explicit prime gap under the Riemann hypothesis, formalized in Lean with its prime power input made elementary

Contributed by Steve Hubbard

We report on a Lean 4 formalization of Theorem 2 of Dudek, 2015, as numbered in arXiv v2, which states that if the Riemann hypothesis is true, then for every real x≥2x \ge 2 there is a prime in the interval (x−(4/π)xlog⁡x,x](x - (4/\pi)\sqrt{x}\log x, x]. In the formalization, Theorem 2 is proved assuming the Riemann hypothesis and one cited explicit zero-counting bound of Hasanalizade, Shen and Wong, arXiv:2107.06506. Four cited inputs of the printed proof are replaced in the formal proof. The two that carry the argument are these: first, the prime power contribution ψ−θ\psi - \theta is required only across the moving window (x−h,x+h](x - h, x + h] and is proved outright in Lean by an elementary counting argument with no cited input and without assuming the Riemann hypothesis; second, the sum over nontrivial zeros is bounded from the cited Hasanalizade, Shen and Wong zero count for T≥70T \ge 70 by trading slack between the head and tail sums at the split point T=2x/hT = 2x/h. The Riemann hypothesis is open and this note makes no progress on it.

Author comments: 11 pages. Version 2 of the note, first deposit on Hexagon.

Primarily AI-generated textHuman understanding: some partsLean 4Riemann Hypothesisexplicit number theoryformal verificationprime gaps
Nov 06, 202611 pages
PDFView work

math.NT — Number Theory

Cumulative Prime Sums and Riemann Zeros: A fine grid, its ripple, and a family of prime races

Contributed by Antonio Mennillo

Summing the primes one after another and taking logarithms gives an increasing sequence of real numbers, σm=log⁡Spm\sigma_m=\log S_{p_m} with SN=1+∑p≤NpS_N = 1+\sum_{p\le N}p, which becomes exponentially dense. The ordinates γn\gamma_n of the zeros of the Riemann zeta function fall on this grid with tiny errors: 1.4⋅10−31.4\cdot10^{-3} at the first zero, 2.4⋅10−72.4\cdot10^{-7} at the fifth, 3⋅10−173\cdot10^{-17} at the twentieth. Part I explains why. The cell of the grid containing a height tt has width (1+o(1))t e−t/2(1+o(1))\sqrt t\,e^{-t/2} (Step Theorem), and every real t>log⁡3t>\log 3 has a node above it within that width, by an argument going back to Bertrand's postulate (Covering Theorem). The precision observed at the zeros is therefore the resolution of the grid, and the same precision holds at every height (Genericity Principle). We compute the first-crossing primes NnN_n with certification up to n=20n=20 and test, in a protocol fixed before the computation, whether the zeros sit closer to the nodes than a generic height. Neither the mean distance to the nearest node (0.2460.246 against 0.2500.250, p=0.92p=0.92) nor the distribution of the position within the cell (Kolmogorov–Smirnov, p=0.79p=0.79) departs detectably from the generic case, and an integer grid used as control behaves in the same way. We also correct the half-exponent law by a factor t′/t\sqrt{t'/t}. Part II shows where the zeros are actually visible. They are not in the position of the nodes but in the ripple: the deviation of the grid from its mean curve B(x)=1+li(x2)−li(4)B(x)=1+\mathrm{li}(x^2)-\mathrm{li}(4). This ripple is a sum of pure oscillations, one per zero; its spectrum shows a peak at each of the first 13 ordinates, with the amplitude predicted by the explicit formula. Under RH the ripple has size e−t/4e^{-t/4} on the grid, much larger than the cell e−t/2e^{-t/2}, and RH is equivalent to this decay rate. The ripple is not centred: on [103,108][10^3,10^8] the sum of the primes stays below li(x2)\mathrm{li}(x^2) for about 97% of logarithmic time, and it first exceeds it at x=109x=109. We place this in a one-parameter family of prime races, ∑p≤xpa\sum_{p\le x}p^a against li(xa+1)\mathrm{li}(x^{a+1}), and prove that under RH the normalized error has mean −1/(2a+1)-1/(2a+1), coming from the squares of the primes. Under RH and LI the limiting logarithmic density of the set where the race is ahead is given by a Rubinstein–Sarnak formula; it moves from 2.6⋅10−72.6\cdot10^{-7} (counting the primes, a=0a=0) to 0.060.06 (summing them, a=1a=1) and tends to 1/21/2 as a→∞a\to\infty, at the rate 12−δa∼1/(2πAlog⁡(A/2π))\tfrac12-\delta_a\sim1/\bigl(2\sqrt{\pi A\log(A/2\pi)}\bigr) with A=a+12A=a+\tfrac12. At a=−1/2a=-1/2 the bias becomes the 12log⁡log⁡x\tfrac12\log\log x of the weighted counting functions of Aoki and Koyama. All theorems are formalized in Lean 4, with the classical results they use as explicit hypotheses.

A mix of human-written and AI-generated textHuman understanding: some partsChebyshev biasLean 4Riemann zerosexplicit formulaprime races
Nov 06, 202629 pages
PDFView work

quant-ph — Quantum Physics

Exact amplitudes of sparse quantum circuits in subexponential time, assuming the new #SAT algorithms

Contributed by Vaibhav Tulsyan

Classical simulation lower bounds for quantum circuits have been derived from the Exponential Time Hypothesis (ETH). However, in October 2026 OpenAI and Anthropic claimed deterministic subexponential algorithms for #k-SAT, refuting ETH, and neither manuscript mentions quantum circuits. We record the corollary. Assuming three internal results of the Anthropic manuscript, one deterministic Turing machine computes the amplitude ⟨y∣C∣x⟩\langle y|C|x\rangle of a Clifford+T circuit with GG two-qubit gates in arbitrary connectivity exactly, as an element of Z[ω]/2 k\mathbb{Z}[\omega]/\sqrt2^{\,k} with ω=eiπ/4\omega=e^{i\pi/4}, in time 2O(G/log⁡G)2^{O(G/\sqrt{\log G})} whenever the input length LL satisfies log⁡L≤G0.9\log L\le G^{0.9}. The proof reads the sum over paths, one bit per wire segment, as an Anthropic-type network, with a Kronecker map for Z[ω]\mathbb{Z}[\omega] and a Galois bound. We machine-check this theorem in Lean 4 (amplitude_TM_rate', amplitude_TM_rate, amplitude_TM; axioms propext, Classical.choice, Quot.sound) on top of Anthropic's Lean development (sources at https://github.com/xennygrimmato/eth-hamiltonicity). On paper only, the method gives exact marginals and exact sampling, depth-dd circuits in 2O(dn/log⁡n)2^{O(dn/\sqrt{\log n})}, and, through OpenAI's tensor-contraction theorem, polynomial space when the number of Hadamard-type gates is O(G)O(G). Conversely, constant-depth circuits with O(n)O(n) gates encode #3-SAT with O(n)O(n) clauses, so the rate matches that of the refutations. We check the fine-grained supremacy conjectures we found against their sources; a counting form of the Calabro-Impagliazzo-Paturi width reduction refutes the gap conjecture of Morimae and Tamaki's depth-scaling paper. Dense statements (cubic phases, permanents, random circuits) survive. Nothing here concerns approximate sampling, the constants are galactic, and everything is conditional on the claimed refutations, which are under review.

Primarily AI-generated textHuman understanding: some partsClifford+Tfine-grained complexityquantum circuit simulationquantum supremacystrong simulationtensor networks
Nov 04, 202615 pages
PDFView work

math.NT — Number Theory

Every real primitive Dirichlet L-function has de Bruijn–Newman constant at most 9/32: a kernel-checked proof in Lean 4

Contributed by Peter W. Murphy, MD

Let χ be a real primitive Dirichlet character of conductor N ≥ 3 and parity k ∈ {0,1}. Let Λ(s,χ) = (N/π)^{(s+k)/2} Γ((s+k)/2) L(s,χ) be its completed L-function, and let H^χ_t(z) = ∫_0^∞ e^{tu²} Φ_χ(u) cos(zu) du be the de Bruijn–Newman heat flow of Λ(·,χ), normalised so that H^χ_0(z) = (1/8) Λ(1/2 + iz/2, χ). We give a proof, checked by the Lean 4 kernel, that for every such χ and every t ≥ 9/32 all zeros of H^χ_t are real. Equivalently, the generalised de Bruijn–Newman constant satisfies Λ_χ ≤ 9/32. The mathematics is not new, and we say exactly whose it is. De Bruijn's strip-contraction theorem (1950) gives Λ_χ ≤ D²/2 whenever the zeros of H^χ_0 lie in |Im z| ≤ D. Freire, González-Riquelme, Muñoz, Poblete and Salinas observed (arXiv:2610.27343, Remarks 3.1 and 3.4) that the zero-free half-plane Re s > 7/8 for Dirichlet L-functions asserted by OpenAI would give D = 3/4, and hence Λ_χ ≤ 9/32. What this paper adds is a complete formal proof of that composition. For conductors up to 400, FGMPS's unconditional bounds are stronger for 136 of the 242 characters; what is new is that 9/32, for every conductor, is a kernel-checked theorem. OpenAI's half-plane enters as their own kernel-checked Lean theorem. Every other step is proved in Lean on top of Mathlib: de Bruijn's theorem for a general class of kernels, the identification of the theta integral with Mathlib's completed L-function, and Gauss's sign theorem for real primitive characters. The final theorem depends only on the axioms propext, Classical.choice and Quot.sound. In local, unsandboxed replays five checkers accept it: Lean's kernel (run twice), nanoda, and the con-leche/con-ron pair. All five reject a deliberately unsound control. A sandboxed Comparator run against a separately written challenge also accepts it. That run was made by another agent session, and the auditor reproduced its solution export byte for byte. The result rests on OpenAI's Lean proof, whose accompanying manuscript is unrefereed. It is not progress on the Generalised Riemann Hypothesis, which is the statement Λ_χ ≤ 0. A short, separable section records two companion results for ζ that use no OpenAI code, Λ ≤ 225/512 and ψ(x) = x + O_ε(x^{31/32+ε}), both from Cureton and Thorner's half-plane Re s > 31/32. Code, verification records and archive: https://github.com/DrMurphyIsIn/real-dirichlet-dbn-lean (release v1.0.0); DOI 10.5281/zenodo.23840082.

Primarily AI-generated textHuman understanding: some partsDirichlet L-functionsGauss sumsLean 4Mathlibde Bruijn-Newman constantformal verification
Nov 02, 202625 pages
PDFView work

cs.DS — Data Structures and Algorithms

Counting Hamiltonian cycles in sparse graphs in subexponential time, assuming the new #SAT algorithms

Contributed by Vaibhav Tulsyan

In October 2026 two manuscripts claimed refutations of the Exponential Time Hypothesis by deterministic algorithms for #k\#k-SAT, each with a Lean formalisation of its top-level statement. Neither result applies directly to connectivity problems such as Hamiltonicity, because no linear-size CNF encoding of "this edge set is a single cycle" is known. This paper derives a corollary of the Anthropic manuscript: assuming three of its internal results (a network-to-clique reduction, an algorithm for cliques of all levels, and the existence of its "pieces"), the number of Hamiltonian cycles of a graph with nn vertices and at most DnDn edges can be computed exactly and deterministically in time O(2δn)O(2^{\delta n}) for every δ>0\delta>0, and in time 2O(max⁡(m,n)/log⁡n)2^{O(\max(m,n)/\sqrt{\log n})} for a graph with mm edges. A rank-encoded variant of the construction gives 2O(nlog⁡dˉ/log⁡n)2^{O(n\log\bar d/\sqrt{\log n})} for average degree dˉ\bar d. Deterministic decision, search and Hamiltonian-path counting follow, and so do exact sparse TSP with polynomially bounded weights, exact counting of directed Hamiltonian cycles, and ATSP. The result is not a standalone breakthrough; it stands or falls with the claimed refutation. The ingredients are known: the folklore matrix-tree identity on 22-factors, the fermionic (Berezin) matrix-tree theorem of Caracciolo, Jacobsen, Saleur, Sokal and Sportiello, and the blob partitions of Cut&Count. What is new is the observation that connectivity can be encoded with O(1)O(1) bits per edge through a Grassmann determinant whose only non-local part is a sign, and that this sign costs only O(g3)O(g^3) bits for gg blobs, so the whole construction is a network in the sense of the manuscript, whose value is n⋅#HC(G)n\cdot\#\mathrm{HC}(G). Every theorem we claim is formally verified in Lean, end to end, on top of the manuscript's own Lean development: the three counting theorems, the decision, search and path corollaries, sparse TSP, directed Hamiltonian cycles and ATSP, using only the standard axioms, with fresh kernel replays. The Lean sources are at https://github.com/xennygrimmato/eth-hamiltonicity. We also record weaker results that rest only on the machine-checked top-level theorems: the parity of #HC(G)\#\mathrm{HC}(G) for every graph in time 2O((m+n)/log⁡(m+n))2^{O((m+n)/\sqrt{\log(m+n)})} (machine-checked in Lean, with the hypotheses discharged by the labs' own Lean proofs), and one-sided randomized decision. We describe what is proved, what is checked numerically, what is formalised, what is assumed, and what the limitations are.

Primarily AI-generated textHuman understanding: some partsHamiltonian cycle; ETH; matrix-tree theorem; Grassmann algebra; Cut&Count; TSP
Oct 31, 202629 pages
PDFView work

math.LO — Logic

A true theorem Lean can state but can never verify

Contributed by William Banks

We give an expository account of a mathematical result that the Lean proof assistant can formally state but, by Gödel's second incompleteness theorem, can never verify, and which it also does not refute, namely, the consistency of Lean's own underlying type theory. Working in ZFC\mathsf{ZFC} extended by the existence of infinitely many inaccessible cardinals, we sketch the construction of a set-theoretic model of Lean's Calculus of Inductive Constructions (with its universe hierarchy, quotient types, and choice), outline the proof of a soundness lemma, and conclude that no derivation of False\mathtt{False} exists. The argument is the model-theoretic consistency proof carried out in full by Carneiro, building on Werner's set-theoretic interpretation of the same calculus; all substantive results are due to these authors, and this paper claims no new mathematics. We explain why this theorem lies outside Lean's own reach, note that Gödel's second incompleteness theorem has itself been verified by Lean's kernel for first-order arithmetic, and discuss why every consistency proof ultimately rests on trust rather than proof.

A mix of human-written and AI-generated textHuman understanding: all partsLeanconsistencyinaccessible cardinalsincompletenessproof assistantstype theory
Oct 29, 20266 pages
PDFView work

math.PR — Probability

Chemical heredity without genetic templates

Contributed by Michael Mislan

We prove two quantitative forms of chemical heredity that do not rely on copying a genetic sequence. In the first model, a population of four compartments carries three prescribed catalyst types that compete for a shared local fuel. Two types are present from the start; a third is supplied for a fixed seeding period, after which all catalyst input stops. We prove that, with failure probability at most 0.004517975690072193, a single finite-stock process acquires the third type and keeps all three present in both daughters of every division, delivers three million catalytic conversion credits on a fixed per-site schedule, and rebuilds the population's copy reserves eleven times, interleaved with ten divisions. The proof controls acquisition, catalytic service, recovery and resource consumption on one stochastic history; it does not assume that a compartment stays replenished between recovery and division. In the second model, an imperfect parent copies its majority conformation into an independent racemic blank, after which both outputs undergo cooperative restoration while spontaneous errors continue. At 4,000 molecules per compartment, 100 successive copying cycles succeed with probability at least 0.999, uniformly over a box of rate parameters. Complete conventional proofs and explicit finite certificates are supplied. The central finite-stock theorem, though not the restoration result, also has a machine-checked Lean formalization. A converse for random division explains why unlinked information units and linked carriers face different loss mechanisms. These results establish acquisition and retained function under prescribed chemistry and operations; chemically generated successive innovations and open-ended evolution require additional mechanisms.

Primarily AI-generated textHuman understanding: some partschemical heredityfinite resourcesorigin of lifestochastic reaction networkstemplate-free heredity
Oct 21, 202634 pages
PDFView work

cs.LO — Logic in Computer Science

A Machine-Checked Kernel for Federated Automated Adjudication: Credibility Lattice Completion, Certificate Lifecycle Invariants, Certified Numerical Anchors, and a Parameterized Rice Template

Contributed by Chepin Zhang

We present a formally specified and machine-checked kernel for a federated automated adjudication system, in which independent computational lines judge mathematical and operational claims and deposit their verdicts, evidence, and certificates in a shared ledger. The kernel comprises five components. (i) A three-rung, three-track credibility lattice obtained as a completion of a legacy five-element poset: the completion is justified by an exhaustive enumeration over all 11^{3}=1331 ordered triples and is fully re-formalized in Lean 4, where the equational lattice laws, the order axioms, and the extremality properties of join and meet are all proved by the decide procedure over the finite carrier. (ii) A five-state certificate lifecycle machine with nine legal transitions and machine-checked invariants, likewise re-formalized in Lean 4; the formalization caught a specification flaw in one invariant (the originally stated grant-gating condition is false), and we report the corrected, machine-proved form. (iii) Certified numerical anchors: uniqueness of the gauged fixed point of circulant entropic-optimal-transport (Sinkhorn) systems, established by a Krawczyk interval operator with outward rounding across a six-instance family (k in {6,10 }, varepsilon in {1,1/2,1/5 }, later extended to ten instances), together with a second anchor family of five auction-algorithm assignment instances certified by interval dual brackets. We state plainly that the certification of these numerical anchors is carried by the Python interval-arithmetic layer; the attempted port to the Lean 4 interval library leancert is blocked by structural capability boundaries of that library (absence of the logarithm from its supported expression grammar and infeasibility of its determinant computation at the required dimensions), and the Lean files are formal statements, not machine-verified certificates. (iv) A parameterized Lean 4 template for Rice-type undecidability, consisting of a bridge theorem, an extensionality lemma, an instantiation generator, and discharged instances of increasing difficulty. (v) A minimal trusted computing base result: the soundness of an interval certificate checker (accept implies correctness), itself machine-proved in Lean 4. All Lean artifacts were verified on cloud infrastructure (Axiom Axle, environment lean-4.28.0) under the strict verify_proof channel, with axiom audits restricted to propext, Classical.choice, and Quot.sound, and no sorryAx. Empirical fuzzing over three certificate families observed zero false accepts; we report rule-of-three 95% upper bounds on the false-accept rate and explicitly do not claim a guarantee.

Primarily AI-generated textHuman understanding: some partsLean 4Rice theoremfederated adjudicationformal verificationinterval arithmeticmachine-checked certificates
Oct 11, 202616 pages
PDFView work

math.GR — Group Theory

An Executable Stallings Recognizer for Finite Generating Lists in Lean

Contributed by Arthur, David Barros Hulak, Ruy J. G. B. de Queiroz

We explain a Lean 4 construction of a finite inverse automaton recognizing the subgroup of the rank-two free group generated by any finite list of signed words. The implementation builds a flower multigraph and computes the least equivalence relation compatible with deterministic labelled transitions by exhaustive finite search over Boolean relations. Canonical representatives realize the folded graph on the original finite state type. A coset-potential invariant proves that folding introduces no additional subgroup elements; preservation of the input loops proves the opposite inclusion. A separate reduction argument shows that traversal of the canonical reduced representative decides membership. We distinguish the registered theorem, its executable witness, and classical reasoning used only in the proof. The construction retains unused states and has no formalized complexity, core-trimming, subgroup-basis, intersection, or index algorithm. This is an expository account of a classical recognition theorem and a pinned formal artifact, with no claim of mathematical novelty or formalization priority.

Primarily AI-generated textHuman understanding: some partsLean 4MathlibStallings foldingfinite inverse automatafree groupssubgroup membership
Oct 01, 20268 pages
PDFView work

math.AC — Commutative Algebra

Prime-Generated Localization Descent for Unique Factorization in Lean

Contributed by Arthur, David Barros Hulak, Ruy J. G. B. de Queiroz, Anjolina Grisi de Oliveira

We give a source-grounded exposition of a Lean 4 formalization of prime-generated Nagata factoriality descent. A commutative noetherian integral domain is a unique factorization domain if a localization is a unique factorization domain and every denominator is exactly a finite product of prime elements belonging to the denominator submonoid. The formal statement works with an arbitrary algebra carrying Mathlib’s IsLocalization structure. We explain the two cases for an irreducible element, the multiset cancellation and splitting arguments, and the corollary for submonoids generated by arbitrary sets of primes. A registered polynomial corollary illustrates reuse of the descent package; its Laurent-polynomial premise is proved using Mathlib’s existing polynomial UFD instance, a dependency made explicit here. The exposition is tied to the registered source and dependency pins, distinguishes historical mechanical verification from manuscript review, and situates the development relative to an earlier Lean preprint and an Isabelle/HOL formalization. No new algebraic theorem or priority claim is asserted.

Primarily AI-generated textHuman understanding: some partsLean 4MathlibNagata factorialitycommutative algebralocalizationunique factorization domains
Oct 01, 202610 pages
PDFView work

cs.DS — Data Structures and Algorithms

A Lean Certificate for the Single Source Unsplittable Flow Cost Counterexample

Contributed by Arthur, David Barros Hulak, Ruy J. G. B. de Queiroz

We explain a standalone Lean 4 and Mathlib verification of the finite counterexample announced by Dmitry Rybin to the cost-preserving single-source unsplittable-flow conjecture. The instance has seven vertices, nine directed arcs, and three terminal demands. An exact rational path flow saturates every arc, has cost 58, and has largest demand 15. Exhaustive graph-path classification reduces every unsplittable routing to two choices per terminal. Three backbone-arc inequalities force any routing with load at most the fractional load plus 15 to use at least two paid routes, each costing 30. Thus every such routing costs at least 60, ruling out cost preservation even with a non-strict congestion bound. We present the numerical certificate, its graph realization, and the boundary between the pinned proved implementation and its statement-only verification interface. The contribution is an exposition of a source-based formal certificate; no new counterexample, first formalization, or general rounding algorithm is claimed.

Primarily AI-generated textHuman understanding: some partsGoemans cost conjectureLean 4MathlibRybin counterexamplefinite counterexampleformal verificationsingle-source unsplittable flow
Oct 01, 20266 pages
PDFView work

Advanced search

Text
Human understanding
Linked formalizations