Matching works

70 works

math.NT — Number Theory

The reciprocal cube sums of Lucas sequences of quadratic units are irrational

Contributed by Shawn Krisman

Let η>1\eta>1 be a unit of a real quadratic order and Un=(ηn−ηˉn)/(η−ηˉ)U_n=(\eta^n-\bar\eta^n)/(\eta-\bar\eta) its Lucas sequence. We prove that ∑n≥1Un−3\sum_{n\ge1}U_n^{-3} is irrational. Equivalently, ∑n≥1Un(P,Q)−3∉Q\sum_{n\ge1}U_n(P,Q)^{-3}\notin\mathbb{Q} for the Lucas sequences with Q=−1Q=-1, P≥1P\ge1, and with Q=1Q=1, P≥3P\ge3. In particular the sums of the reciprocal cubes of the Pell numbers and of the numbers FknF_{kn}, for every k≥1k\ge1, are irrational. The case of the Fibonacci numbers was treated in earlier work of the author; the proof here is the same Hankel-determinant construction, carried out for a general unit and for both signs of its norm. The constants of the argument do not depend on η\eta once they are measured in units of log⁡η\log\eta. The whole argument is formalised in Lean 4 with Mathlib.

Primarily AI-generated textHuman understanding: no partsFibonacci numbersHankel determinantsLeanLucas sequencesPell numbersirrationalityq-series
Nov 15, 202613 pages
PDFView work

math.CA — Classical Analysis and ODEs

Bounds for the sign uncertainty constant in dimension one

Contributed by Tejasvi Singh Tomar

Bourgain, Clozel and Kahane proved that a nonzero even real function ff on R\mathbb{R} with ff and f^\widehat{f} integrable, f(0)≤0f(0)\le0 and f^(0)≤0\widehat{f}(0)\le0 cannot have ff and f^\widehat{f} both nonnegative outside an arbitrarily small neighborhood of the origin. The sharp constant in this sign uncertainty principle is A+(1)A_+(1), the infimum of A(f)A(f^)\sqrt{A(f)A(\widehat{f})} over all such ff, where A(f)A(f) is the radius beyond which ff is nonnegative; its square is the constant of Problem 6.11 in the list of Georgiev, Gómez-Serrano, Tao and Wagner. We prove 0.5502<A+(1)≤0.55090.5502<A_+(1)\le0.5509, improving the previous bounds 0.45≤A+(1)≤0.30890.45\le A_+(1)\le\sqrt{0.3089}; in particular A+(1)<0.555A_+(1)<0.555, as conjectured by Gonçalves, Oliveira e Silva and Ramos. The lower bound comes from a weight in the spirit of the summation formulas of Cohn and Gonçalves, built from Gaussians and cosines and corrected near the origin by an approximate solution of a Fredholm integral equation, and the upper bound from an explicit self-dual combination of Gaussians. The numerical inequalities in both proofs are verified in ball arithmetic, and the bounds 0.5502≤A+(1)≤0.55090.5502\le A_+(1)\le0.5509 also have formal proofs in Lean 4.

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

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

math.NT — Number Theory

Bounds for the smallest limit point of the areal Mahler measure of totally positive algebraic integers

Contributed by Tejasvi Singh Tomar

Pritsker's areal analog ∥P∥0\|P\|_0 of the Mahler measure replaces the integral of log⁡∣P∣\log|P| over the unit circle by its integral over the unit disc with respect to normalized area. For an algebraic number α\alpha of degree nn with minimal polynomial P∈Z[x]P\in\mathbb{Z}[x], taken primitive with positive leading coefficient, let N0(α)=∥P∥01/nN_0(\alpha)=\|P\|_0^{1/n}. Flammang proved that N0(α)≥1.380047N_0(\alpha)\ge1.380047 for every totally positive algebraic integer α\alpha outside an explicit finite set. We prove that the smallest limit point of the values of N0N_0 on totally positive algebraic integers and their essential minimum lie between 1.38301341.3830134 and 1.38395791.3839579. The lower bound improves on Flammang's constant: it holds for all but finitely many totally positive algebraic numbers, not only integers, although the exceptions are not determined. Infinitely many totally positive algebraic integers satisfy N0(α)<1.3839579N_0(\alpha)<1.3839579. The lower bound comes from an auxiliary function with a logarithmic energy term, and the upper bound from an explicit measure that, by a criterion and a theorem of Smith, is a limit of distributions of conjugates of totally positive algebraic integers. The inequalities behind both bounds are verified in ball arithmetic, and both bounds are also proved in Lean, the upper one assuming Smith's theorem.

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

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

math.CA — Classical Analysis and ODEs

Bounds for the weak type (1,1) constant of the centred maximal operator over squares

Contributed by Tejasvi Singh Tomar

Let c2c_2 be the best constant in the weak type (1,1)(1,1) inequality for the centred Hardy–Littlewood maximal operator over axis-parallel squares in the plane. We prove 1.7027237335≤c2≤3.591231.7027237335\le c_2\le3.59123, improving the bounds 1.6855…≤c2<3.6157491.6855\ldots\le c_2<3.615749 obtained by Lin. The upper bound comes from a new kernel in Lin's comparison principle, which bounds c2c_2 by half the integral of a suitable kernel; closed forms for the fractional operator in this principle make its conditions checkable. The lower bound comes from a periodic measure obtained by modifying Lin's lattice of point masses. Both proofs are computer-assisted and formally verified in Lean.

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

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

math.MG — Metric Geometry

An upper bound of 2√2 for the three-dimensional sofa problem in a snake-shaped corridor

Contributed by Tejasvi Singh Tomar

The moving sofa problem in a snake-shaped corridor, posed by O'Rourke and by Georgiev, Gómez-Serrano, Tao and Wagner, asks for the largest volume of a connected body that can be moved through a corridor of unit-square cross-section with two turns that are far apart, one in the xx–yy plane and one in the yy–zz plane. The largest reported body has volume at least 1.85584041.8558404, and Tang obtained upper bounds for this problem, the best of which is 3.40833.4083. We prove by hand that the largest volume is at most 222\sqrt2 whenever the straight section between the turns is longer than 2+22+\sqrt2. The main new tool is a sharp bound: two infinite tubes of unit-square cross-section whose axes make an angle θ\theta meet in volume at most 1/sin⁡θ1/\sin\theta. With it, Hammersley's argument for the planar moving sofa problem carries over to three dimensions. The same argument gives explicit bounds for shorter straight sections; these and the main bound have also been proved in Lean 4 with Mathlib.

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

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

math.PR — Probability

A certified upper bound for the beat the average game

Contributed by Tejasvi Singh Tomar

Let CC be the supremum of P[X1+X2+X3<2X4]\mathbb{P}[X_1+X_2+X_3<2X_4] over all probability measures on [0,∞)[0,\infty), where X1,…,X4X_1,\dots,X_4 are independent with the given law. Determining CC is Problem 6.39, the beat the average game, in the list of Georgiev, Gómez-Serrano, Tao and Wagner. Bellec and Fritz proved 0.4006953≤C≤673/16150.4006953\le C\le 673/1615 and conjectured that the lower bound, 0.4006953723…0.4006953723\ldots, is the exact value. We prove C≤0.40069634C\le0.40069634, less than 10−610^{-6} above the conjectured value. The proof applies Razborov's flag algebra method to samples of nine points. Since the points are independent, the positivity constraints of flag algebras hold for every single measure, so that no limit objects are needed. An exact certificate is checked in rational arithmetic, and the bound is also proved in the Lean 4 proof assistant, with Lean's kernel checking the certificate.

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

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

math.MG — Metric Geometry

A lower bound for Moser's worm problem with rotations and translations

Contributed by Tejasvi Singh Tomar

In its convex form, Moser's worm problem asks for the least area of a convex set in the plane that contains a copy of every arc of length 11. For the version in which the copies may be rotated and translated but not reflected, we prove that this least area M+M^{+} satisfies M+≥0.2414M^{+}\ge0.2414; the best bound before, 0.2390.239, follows from Keller's bound for the version with reflections. The proof bounds the area of the convex hull of copies of five polygonal arcs, among them two zigzags that turn in opposite directions, so that without reflections the hull must contain a zigzag turning each way. A branch and bound over the placements of the arcs, with second-order Taylor bounds for signed areas of polygons, produces a certificate, which is checked in ball arithmetic and in the Lean proof assistant.

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

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

math.NT — Number Theory

The sum of the reciprocal cubes of the Fibonacci numbers is irrational

Contributed by Shawn Krisman

We prove that ζF(3)=∑n≥1Fn−3\zeta_F(3)=\sum_{n\ge1}F_n^{-3} is irrational, where FnF_n are the Fibonacci numbers. To our knowledge the only odd value of the Fibonacci zeta function previously known to be irrational was ζF(1)\zeta_F(1). The proof is a Hankel-determinant construction over Z[φ]\mathbb{Z}[\varphi], φ=(1+5)/2\varphi=(1+\sqrt5)/2, adapted from a recent unrefereed construction for the qq-zeta value ∑n2/(pn−1)\sum n^2/(p^n-1) at integers p≥2p\ge2. Four estimates are combined: a real decay of size exp⁡(−29K3log⁡φ)\exp(-\tfrac29K^3\log\varphi), a smallness exp⁡(−K3log⁡φ)\exp(-K^3\log\varphi) at the Galois conjugate, which replaces the base-prime content gain of the integer case, local cyclotomic denominator bounds at the twisted roots of unity that occur, and nonvanishing by rational interpolation. The whole argument is formalised in Lean 4 with Mathlib.

Primarily AI-generated textHuman understanding: no partsCyclotomic PolynomialsFibonacci zeta functionHankel determinantsLambert seriesLean 4Padé approximationformal verificationirrationalityq-zeta valuesreciprocal Fibonacci sums
Nov 15, 202613 pages
PDFView work

math.CV — Complex Variables

An explicit bound below 2/π for the maximum term of an entire function

Contributed by Tejasvi Singh Tomar

For a transcendental entire function ff let μ(r)\mu(r) be its maximum term and M(r)M(r) its maximum modulus on ∣z∣=r|z|=r. Erdős asked for the largest possible value BB of lim inf⁡r→∞μ(r)/M(r)\liminf_{r\to\infty}\mu(r)/M(r). An argument of Clunie gives B≤2/π=0.636619…B\le 2/\pi=0.636619\ldots, and Clunie and Hayman proved B≤2/π−cB\le 2/\pi-c for an absolute constant c>0c>0 that they did not compute. We prove B≤0.63005B\le0.63005. We make the stability argument of Clunie and Hayman quantitative by testing ff against trigonometric polynomials at one or both of two consecutive radii where the central index jumps. The proof is computer-assisted, and the theorem is also proved in the Lean proof assistant.

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

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

math.PR — Probability

Certified upper bounds for the Chvátal–Sankoff constant

Contributed by Tejasvi Singh Tomar

Let γ2\gamma_2 be the Chvátal–Sankoff constant, so that the expected length of a longest common subsequence of two independent uniformly random binary strings of length nn is γ2n+o(n)\gamma_2n+o(n). Lueker proved γ2≤0.826280\gamma_2\le0.826280 with a finite automaton that reads a pair of strings as a sequence of minimal match pairs and remembers the last hh symbols of each string, for h=8h=8. We carry out his method up to h=13h=13 and prove γ2≤0.821963\gamma_2\le0.821963. For h=13h=13 the certificate lists 165,695,219,469165{,}695{,}219{,}469 states of the automaton, reduced by a symmetry. The bound rests on an explicit positive vector for the weighted transition matrix of the automaton; a checker rebuilds every transition with its own code and verifies the required inequalities in exact integer arithmetic. We also give a complete proof that the automaton accepts the truncated canonical decomposition of every pair of strings, the property on which the method depends. The bound γ2≤0.821963\gamma_2\le0.821963 is also proved in the Lean 4 proof assistant, with a computation evaluated by compiled code, and the bounds γ2≤0.825101\gamma_2\le0.825101, γ2≤0.824120\gamma_2\le0.824120, γ2≤0.823290\gamma_2\le0.823290 and γ2≤0.822579\gamma_2\le0.822579 for h=9h=9, 1010, 1111 and 1212 by formal proofs that are checked entirely by the Lean kernel.

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

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

math.NT — Number Theory

Irrationality of χ2(1/q)\chi_2(1/q), Ti2(1/q)\mathrm{Ti}_2(1/q) and χ2(2/q)\chi_2(2/q)

Contributed by Shawn Krisman

Let χ2(z)=∑n≥0z2n+1/(2n+1)2\chi_2(z)=\sum_{n\ge0}z^{2n+1}/(2n+1)^2 be Legendre's chi function and Ti2(z)=∑n≥0(−1)nz2n+1/(2n+1)2\mathrm{Ti}_2(z)=\sum_{n\ge0}(-1)^nz^{2n+1}/(2n+1)^2 the inverse tangent integral. We prove three theorems: χ2(1/q)\chi_2(1/q) is irrational for every integer q≥3q\ge3 with q≠4q\ne4; Ti2(1/q)\mathrm{Ti}_2(1/q) is irrational for every integer q≥5q\ge5; and χ2(2/q)\chi_2(2/q) is irrational for every odd integer q≥175q\ge175. All three come from one construction: the Hankel determinants of a moment functional with half-integer poles and geometric weight ww, read at w=q−2w=q^{-2}, w=−q−2w=-q^{-2} and w=4q−2w=4q^{-2}. Their denominators are bounded prime by prime, their size by a discrete log-gas argument against explicit dual certificates, and their nonvanishing by a reduction modulo an auxiliary prime. The three cases differ at the prime 22, where each needs its own lemma, in the certificates, and in how the nonvanishing lemma is transferred. For large qq the three statements follow from the linear independence criteria of David, Hirata-Kohno and Kawashima; for the first two, a 1990 criterion of Hata, which we could not consult, also applies from a threshold unknown to us. Below these ranges the results are new as far as we know. All three theorems are formalised in Lean 4 with Mathlib and checked by the Lean kernel, using only Lean's three standard axioms.

Primarily AI-generated textHuman understanding: no partsHankel determinantsLeanLegendre chi functionPadé approximationdilogarithmformal verificationinverse tangent integralirrationalitylogarithmic potential theory
Nov 13, 202646 pages
PDFView work

cs.LO — Logic in Computer Science

A formal proof in Lean of the finiteness of planar five-body central configurations for all positive masses

Contributed by Tejasvi Singh Tomar

Smale's sixth problem asks whether, for every choice of positive masses, there are finitely many central configurations up to similarity. For five bodies in the plane, Albouy and Kaloshin proved finiteness outside a set of masses of codimension two. In a companion paper the author proved finiteness for every choice of five positive masses by their method, adding steps that cannot be checked by hand: exact computer algebra, rational certificates and a branch and bound. We formalize this theorem in Lean 4 with Mathlib without assuming the results of Albouy and Kaloshin that the informal proof uses. Instead we prove what the proof needs of their rules on limit diagrams, of their classification of these diagrams and of their mass conditions. We do so at places of complex algebraic curves, taken as valuations of the function field rather than points of a projective model. Almost every computation becomes data for a checker that we write in Lean, prove sound with respect to Mathlib's real and complex numbers, and run in the kernel (proof by reflection). The main theorem depends on about 680,000680{,}000 theorems proved in this way, and Mathlib's tactics prove the few other computations. The proof uses only Lean's three standard axioms, and two independent Lean kernels, nanoda and lean4lean, accept it.

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

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 12, 202619 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

Formal Verification of a Computer-Assisted Proof in Celestial Mechanics

Contributed by Tejasvi Singh Tomar

Albouy, Fu and Sun conjectured in 2008 that four positive masses admit, for each cyclic order of the bodies, exactly one convex central configuration up to similarity; the question is Problem 10 of a 2012 list of open problems on the nn-body problem. We recently proved the conjecture by reducing it to an inequality for a trace at the real zeros of an equation in four variables; a branch and bound that starts from a grid of 136,448 boxes establishes the inequality. In this paper we describe a formalization of the whole proof in Lean 4 and Mathlib in which Lean's kernel checks the computation, using decide +kernel, so that no compiler has to be trusted. Our checker stores an interval as two natural numbers in a biased fixed-point format. The kernel can then hand all the arithmetic to GMP. Functions are enclosed over boxes by first-order slopes. An unverified search records the decisions for each box in one natural number, and the checker replays them. We write each formula once over a type class; evaluating it at a type that pairs a real number with an interval then proves the enclosure correct. Checking the 3418 certificate theorems takes 7.6 hours of processor time, and the independent type checker nanoda accepts the proof. A version rebuilt on one eighth of the boxes passed three type checkers in 2.9 hours on a public registry of formal proofs.

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

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

cs.DS — Data Structures and Algorithms

Sorting networks on 13 inputs need at least 44 comparators

Contributed by Tejasvi Singh Tomar

Let S(N)S(N) be the least number of comparators in a sorting network on NN inputs. We prove S(13)≥44S(13)\ge44, one more than the previously best proved lower bound. We also prove P(2,N)=⌈log⁡2F(N)⌉P(2,N)=\lceil \log_2 F(N)\rceil for 3≤N≤323\le N\le32, where P(2,N)P(2,N) is the least worst-case number of comparators met by the two largest inputs in a network that delivers them to fixed outputs and FF is an explicit function of Van Voorhis; the lower bound comes from a finite search based on the structure of the paths of these two values. Starting from Harder's S(11)=35S(11)=35 and S(12)=39S(12)=39, these values of P(2,N)P(2,N), the two-value bound S(N)≥S(N−2)+P(2,N)S(N)\ge S(N-2)+P(2,N) and the one-value bound S(N)≥S(N−1)+⌈log⁡2N⌉S(N)\ge S(N-1)+\lceil \log_2 N\rceil give the twenty lower bounds on S(N)S(N) for 13≤N≤3213\le N\le32 in Dobbelaere's table; these bounds rested on Van Voorhis's inequality P(2,N)≥⌈log⁡2F(N)⌉P(2,N)\ge\lceil \log_2 F(N)\rceil, whose published proof is invalid. The bound S(13)≥44S(13)\ge44 is also proved in Lean 4, with every step checked by Lean's kernel.

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

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

math.MG — Metric Geometry

The 24-cell conjecture in the all-contact case and near D4

Contributed by Tejasvi Singh Tomar

The 24-cell conjecture states that every Voronoi cell of a packing of unit balls in R4\mathbb{R}^4 has volume at least 88, the volume of the regular 24-cell. It implies that no packing of equal balls in R4\mathbb{R}^4 is denser than the lattice packing D4D_4. We prove the conjecture for two classes of cells; in each class, equality holds only for the D4D_4 root configuration. The first consists of the cells whose ball touches every ball centred at distance less than 222\sqrt2 from its centre, and its proof uses a certificate at the second level of the Lasserre hierarchy. The second consists of the cells whose 2424 nearest centres lie in an explicit neighbourhood of the D4D_4 configuration, whatever the other centres are. For them the volume is at least 88 plus a fixed multiple of the total outward displacement of the 2424 centres, which we prove by a quantitative rigidity estimate and a second-order expansion of the volume about D4D_4. Our proofs for both classes are computer-assisted and partly formalised in Lean.

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

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

math.PR — Probability

The L¹ Poincaré constant of the Hamming cube

Contributed by Tejasvi Singh Tomar

Let CC be the smallest constant such that E∣f−Ef∣≤C E∣∇f∣\mathbb{E}|f-\mathbb{E} f|\le C\,\mathbb{E}|\nabla f| for every real-valued function ff on every Hamming cube {−1,1}n\{-1,1\}^n, where ∣∇f∣|\nabla f| is the Euclidean length of (D1f,…,Dnf)(D_1f,\dots,D_nf) and Djf(x)=(f(x)−f(x(j)))/2D_jf(x)=(f(x)-f(x^{(j)}))/2. Ben Efraim and Lust-Piquard proved C≤π/2C\le\pi/2, the Gaussian case gives C≥π/2C\ge\sqrt{\pi/2}, and Ivanisvili, Li, van Handel and Volberg asked whether C=π/2C=\sqrt{\pi/2}. We prove that it is, with an explicit constant cn<π/2c_n<\sqrt{\pi/2} in dimension nn. The proof turns on an integral of first absolute moments of sums of independent biased random signs: we compute it exactly when the coefficients are nonnegative, and show, with a sampled Fejér kernel, that it can only grow when the coefficients are replaced by their absolute values. The equality C=π/2C=\sqrt{\pi/2} is also proved in Lean 4 with Mathlib.

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

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

math.MG — Metric Geometry

A lower bound of 0.8366 for Lebesgue's universal covering problem

Contributed by Tejasvi Singh Tomar

A universal cover is a convex set in the plane that contains a congruent copy of every set of diameter at most 11. Lebesgue asked in 1914 for a universal cover of least area; before this work, the infimum Λ\Lambda of the areas of universal covers was known to satisfy 0.83474≤Λ≤0.84410.83474\le\Lambda\le0.8441. Lower bounds come from test sets: Λ\Lambda is bounded below by the least area of a convex hull of congruent copies of given sets of diameter at most 11. The best earlier lower bounds used the disk, the Reuleaux triangle and the Reuleaux pentagon, but these three bodies are known to admit a placement with hull area below 0.834790.83479, so they cannot give a much better bound. Adding the regular Reuleaux heptagon and nonagon of width 11, we improve the lower bound to Λ≥0.8366\Lambda\ge0.8366. Without the nonagon, the other four bodies already give Λ≥0.836\Lambda\ge0.836. The proof is a computer-assisted branch and bound over the relative placements of the bodies. Its certificates are checked in interval arithmetic, and separate proofs of both bounds in Lean 4, with their own certificates, are checked entirely by Lean's kernel.

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

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

math.CO — Combinatorics

The Steiner ratio is at least 0.8564

Contributed by Tejasvi Singh Tomar

The Steiner ratio is the infimum, over finite sets of points in the Euclidean plane, of the length of a Steiner minimal tree divided by the length of a minimum spanning tree. Gilbert and Pollak conjectured in 1968 that it equals 3/2≈0.8660\sqrt3/2\approx0.8660, and the conjecture is open. We prove that it is at least 2141/2500=0.85642141/2500=0.8564, improving the bound 0.85590.8559 of Ke, Huang, Shu, He, Gai and Wang. Their method reduces the induction step of Du and Hwang's 1983 proof of the bound 0.80.8 to finitely many inequalities on boxes in a space of local configurations of a Steiner minimal tree, which are checked by computer. These inequalities use estimates for the positions of terminals outside the local configuration. We prove all the geometric lemmas that our certificate uses, filling gaps in two proofs of Ke et al., and we add two such estimates that hold for more parameter values than the published ones. Within this method some new estimate is necessary: with the published estimates, no certificate of this kind reaches 0.8560.856, whatever the boxes. The computer-assisted part is also verified in Lean 4, by a proof whose checks all run in Lean's kernel; the rest of the argument enters the formal proof as hypotheses.

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

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

math.DS — Dynamical Systems

Smale's sixth problem for six bodies in the plane: finiteness of central configurations for generic masses, with a proof formalized in Lean

Contributed by Tejasvi Singh Tomar

Smale's sixth problem asks whether, for every choice of positive masses, the number of central configurations up to similarity is finite. We prove that it is finite for six bodies in the plane and all positive masses outside a proper algebraic subset of the mass space. This subset, which we describe only in part, contains every mass vector with three equal masses or with one mass equal to the sum of two others. Finiteness for all positive masses remains open. Infinitely many central configurations would give a curve of complex solutions; following Albouy and Kaloshin, we exclude such a curve using the valuations of the mutual distances at its points at infinity. The proof is computer-assisted and uses linear programs, Gröbner bases and interval arithmetic. The theorem is proved in the Lean proof assistant, whose kernel checks the computations as well.

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

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

math.MG — Metric Geometry

The kissing numbers in dimensions five and seven are at most 43 and 132

Contributed by Tejasvi Singh Tomar

The kissing number τn\tau_n is the largest number of non-overlapping unit balls in Rn\mathbb{R}^n that can touch a common unit ball. The best bounds so far were 40≤τ5≤4440\le\tau_5\le44 and 126≤τ7≤134126\le\tau_7\le134; both upper bounds come from high-precision floating-point computations of the three-point bound by Mittelmann and Vallentin. We prove τ5≤43\tau_5\le 43 and τ7≤132\tau_7\le132. Each proof is an exact rational solution of the second level of the Lasserre hierarchy for spherical codes at degrees (d1,d2,δ)=(14,20,20)(d_1,d_2,\delta)=(14,20,20). We use the formulation of de Laat, Leijenhorst and de Muinck Keizer and check the solutions with their verification program. Each certificate is obtained by rounding a convex combination of two dual iterates of the interior-point method, one on each side of the target value. Exact certificates for the same hierarchy also give A(4,arccos⁡13)≤14A(4,\arccos\frac13)\le14, A(5,arccos⁡13)≤22A(5,\arccos\frac13)\le22 and A(6,arccos⁡13)≤34A(6,\arccos\frac13)\le34 for spherical codes, improving the previous bounds 1515, 2323 and 3535; with a known code, A(4,arccos⁡13)=14A(4,\arccos\frac13)=14. The largest number of points at angle π/3\pi/3 from a point of a kissing configuration in Rn\mathbb{R}^n equals A(n−1,arccos⁡13)A(n-1,\arccos\frac13), so in R5\mathbb{R}^5 this number is 1414. We also prove the five bounds in the Lean proof assistant, assuming only the positivity of the zonal kernels given by the zonal polynomial files: once by checking the exact certificates with compiled code, and once, with every computation done by Lean's kernel, from the certificates rounded to 3030 decimal places.

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

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

math.RA — Rings and Algebras

Local optimality of rank-47 schemes for 4×4 matrix multiplication over F2

Contributed by Tejasvi Singh Tomar

The tensor ⟨4,4,4⟩\langle 4,4,4\rangle of 4×44\times4 matrix multiplication has rank at most 47 over F2\mathbb{F}_2, and as it is not known whether 47 is optimal, we ask how far the known decompositions of rank 47 are from one of rank 46. A decomposition is locally optimal to depth DD if no DD or fewer of its rank-one terms can be replaced by fewer rank-one terms. We prove that five pairwise inequivalent decompositions of rank 47 over F2\mathbb{F}_2 are locally optimal to depth 18, as is every decomposition equivalent to one of them, so a decomposition of rank 46 over F2\mathbb{F}_2 shares at most 28 terms with any decomposition in these five classes. The five classes include the scheme of Fawzi et al. and every public decomposition of rank 47 over F2\mathbb{F}_2 known to us; one of them, found in our flip-graph searches, is new. The proof rests on a peeling lemma and, for four sets of terms that resist the other bounds, on a refinement of the substitution method, which we call substitution over subspaces with lifting. Local optimality to depth 18 is also proved in Lean 4.

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

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 12, 202625 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.RA — Rings and Algebras

The rank of 4×4 matrix multiplication over F2 is at least 35

Contributed by Tejasvi Singh Tomar

We prove that the rank of the 4×44\times4 matrix multiplication tensor over F2\mathbb{F}_2 is at least 3535; the previous lower bound was 3434. The bound follows by substitution from RF2(⟨3,3,4⟩)≥27\mathrm{R}_{\mathbb{F}_2}(\langle 3,3,4\rangle)\ge27, which also gives RF2(⟨3,4,4⟩)≥31\mathrm{R}_{\mathbb{F}_2}(\langle 3,4,4\rangle)\ge31. Each of the three bounds is one more than what follows from RF2(⟨3,3,3⟩)=23\mathrm{R}_{\mathbb{F}_2}(\langle 3,3,3\rangle)=23. A flattening argument reduces the bound for ⟨3,3,4⟩\langle 3,3,4\rangle to lower bounds for two quotients of the tensor, by the span of a matrix of rank two and by the span of a matrix of rank three. These come from exhaustive searches over the possible patterns of a short decomposition, pruned by lower bounds for quotients by larger subspaces. The whole argument, including every step of the searches, is checked in the proof assistant Lean 4, with one compiled evaluation of a verified certificate checker.

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

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

quant-ph — Quantum Physics

Certified lower bounds on the optimal-decoding threshold of the surface code

Contributed by Tejasvi Singh Tomar

Under independent bit flips, rigorous lower bounds on the threshold of the surface code from earlier work stay below 0.040.04, while numerical estimates place the optimal threshold near 0.1090.109. By counting labelled failure paths with exact transfer-matrix certificates, we prove without sampling that every minimum-weight decoder has threshold at least 0.04650.0465 on the planar and rotated codes. We then give statistical certificates that, with confidence 1−10−91-10^{-9} each, the optimal threshold of the planar code is at least 0.1030.103 under bit flips and at least 0.020.02 under phenomenological noise. Each statistical certificate bounds the failure probability of an auxiliary decoder that divides the code into blocks and corrects each block using a window around it; optimal decoding does at least as well, so the bound also holds for optimal decoding. A deterministic lemma shows that the auxiliary decoder fails only if bad blocks, in which the window corrections leave a defect or a long residual path, form a sparse hierarchy that joins the two rough boundaries. This gives an explicit bound once every block is bad with probability below a limit, about 4×10−44\times10^{-4} under bit flips, and a pre-registered Monte Carlo experiment bounds these probabilities. The confidence rests on a binomial model of the counts of bad blocks and on two tested properties of each decoding program. All these results are proved in the proof assistant Lean 4, the statistical ones with the binomial model and the two properties as hypotheses.

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

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

math.MG — Metric Geometry

On the local geometry of the tight 39-point code in the octonionic projective plane

Contributed by Robert R. MacGregor

Cohn, Kumar and Minton constructed a four-parameter family of tight 3939-point codes in the octonionic projective plane. We show that near each member outside a closed nowhere-dense set of resonant parameters, the labeled tight codes modulo F4F_4 form exactly four ten-dimensional families, any two meeting in the four-parameter family, although the first-order deformations of the member form a 2828-dimensional space modulo F4F_4. The originally constructed code is resonant, and we do not determine the tight codes near it; but every neighborhood of it in the space of unlabeled tight 3939-point codes modulo F4F_4 contains a nonempty open subset homeomorphic to an open subset of R10\mathbb R^{10}, so any neighborhood of it that is a manifold has dimension ten.

Author comments: 55 pages, 5 figures. Ancillary files: anc/native-data.json holds the exact coefficients of Appendix C, and anc/finite-identities.py replays the finite identities of Proposition 6.5 from it in exact arithmetic. Lean source: https://github.com/macgregor-sudo/tight-39-code at commit 46f01c1.

Primarily AI-generated textHuman understanding: no partsAlbert algebraF4Leandeformationmutually unbiased basesoctonionic projective planetight code
Nov 12, 202655 pages
PDFView work

math.CO — Combinatorics

Sharp thresholds for five-colour cube assemblies

Contributed by Jason Davies

We determine the least pool sizes guaranteeing a frame or a complete a×b×ca\times b\times c box from unit cubes whose faces use all five colours of a fixed palette, for every a,b,c≥2a,b,c\ge2. Proper rotations are allowed; the target has monochromatic exterior faces using all five colours. The frame threshold is max⁡{15,4(a+b+c)−16,2(a+b+c)+1}\max\{15,4(a+b+c)-16,2(a+b+c)+1\}, and the complete-box threshold is max⁡{abc,15,2(a+b+c)+1}\max\{abc,15,2(a+b+c)+1\}. The proof combines a certified fifteen-cube corner theorem with elementary Hall arguments and a uniform three-variety obstruction. It completes the five-colour frame column left open by Berkove, Eickemeyer and Schulman (2018). All threshold statements are formalised in Lean. A fixed-size flow formulation decides feasibility and constructs assemblies in time linear in the explicit source list. We also determine the corner thresholds when the number of source varieties is bounded, and classify all fourteen-cube obstructions into 56 classes under common colour relabelling and simultaneous reflection, described by three structural forms. The minimum size of a collection capable of reproducing every 2×2×22\times2\times2 target is also fifteen.

Primarily AI-generated textHuman understanding: some partsHall's theoremLean formalisationMacMahon puzzlescoloured cubescomputer-assisted proofextremal combinatoricsinterval certificates
Nov 10, 202634 pages
PDFView work

math.CO — Combinatorics

Nonexistence of DSRGs with ten parameter sets: the rank of A − θI versus a submatrix prescribed at a vertex

Contributed by Iurii Ivanov

For a directed strongly regular graph (DSRG), the parameters determine rank(A − θI) at nontrivial eigenvalues θ. For small λ or t = λ + 1 they almost determine a piece of this matrix at a vertex: a piece needing more rank excludes the graph, and a small margin leaves finitely many cases. We exclude (50, 11, 7, 0, 3), (68, 13, 7, 0, 3), (100, 16, 7, 0, 3), (108, 19, 9, 0, 4), (48, 9, 5, 0, 2), (55, 16, 12, 1, 6), (66, 10, 5, 4, 1) and (91, 12, 6, 5, 1), open in Hobart and Brouwer's table, and their complements. Counting twin classes reproves (96, 15, 10, 9, 1) and (28, 6, 3, 2, 1): for the first, rank replaces one counting bound; for the second, it is unused. Lean 4 with Mathlib proves nine exclusions; for (28, 6, 3, 2, 1) its kernel also checks a SAT certificate. (48, 9, 5, 0, 2) ends with a search by two separately written programs, the second certified by CaDiCaL unsatisfiability proofs checked by drat-trim.

Primarily AI-generated textHuman understanding: some partsBrouwer tabledirected strongly regular graphmatrix ranknonexistencespectral graph theorytwin vertices
Nov 10, 202632 pages
PDFView work

cs.LO — Logic in Computer Science

Formalizing the interpolation lemma of the openai/math Landau–Siegel paper and substituting it into a Comparator-accepted proof

Contributed by Joseph Reilly

OpenAI’s openai/math release includes a Lean formalization of “Uniform exclusion of Landau–Siegel zeros” (OpenAI, October 1, 2026). Its Comparator challenge has two checked theorems, whose statements we prove equivalent in Lean. OpenAI proves them by two routes, neither through the paper’s proof of Lemma 3. The catalogued main result, exists_absolute_real_zero_gap, gets its spanning step from a local Bézout argument and does not use OpenAI’s Corollary 4 theorem. The second theorem, dirichletRealZeroBound_proof, proves Corollary 4 by a multiplicity estimate. We formalized the paper’s proofs of Lemma 3 and Corollary 4 in Lean. By reading, the Lean statements match the paper’s, and the declarations use only the axioms propext, Classical.choice and Quot.sound. A +2/-1 substitution puts the paper’s Corollary 4 into dirichletRealZeroBound_proof. Comparator accepts the result with both kernels at openai/math fd4aeeb under a deny list of all 45 socket address families, and that theorem’s closure no longer contains the three named OpenAI lemmas. Our replay of the corpus agrees with an independent replay on all 402 configurations where both have a verdict.

Primarily AI-generated textHuman understanding: some parts
Nov 10, 202620 pages
PDFView work

math.AG — Algebraic Geometry

The tangent line at a marked point on M0,n/Sn−1M_{0,n}/\mathfrak S_{n-1}, after a table of Grothendieck

Contributed by Michel Hua

Let LnL_n be the line bundle on M0,nM_{0,n} whose fibre is the tangent line to P1\mathbb P^1 at the last marked point, and LL the tensor product of the tangent lines at all of them. We show that, in characteristic zero, the Picard group of the quotient stack [M0,n/Sn−1][M_{0,n}/\mathfrak S_{n-1}] is cyclic of order (n−1)(n−2)(n-1)(n-2) for every n≥3n \ge 3, generated by LnL_n, and that LL has order n−1n-1 in Pic⁡[M0,n/Sn]\operatorname{Pic}[M_{0,n}/\mathfrak S_n]. For even n≥6n \ge 6 the group was known, through the integral Chow ring computed by Edidin and Hu; the odd case does not seem to be in print. The question comes from a table in Grothendieck’s working notes, which gives these orders for four points and only guesses for five and six. The proof takes a few lines once the stack is written as monic squarefree polynomials modulo the affine group. An elementary version, with explicit trivialisations and fixed configurations, is formalised in Lean.

Primarily AI-generated textHuman understanding: some partsGrothendieckLean 4MathlibMontpellier archivePicard group of a quotient stackbinary formsdiscriminantformalisationmoduli of pointed rational curvestangent line bundle
Nov 07, 20265 pages
PDFView work

math.CO — Combinatorics

A bigon-free dichotomy for pseudoline arrangements, after a note of Grothendieck

Contributed by Michel Hua

A pseudoline of an arrangement in the real projective plane is bigonal when it carries exactly two vertices of the arrangement. In an undated folder of working notes from the early 1980s, Grothendieck states that every arrangement without bigonal pseudolines is either four pseudolines in general position or contains one of three configurations: five pseudolines in general position, a pencil of three and a pencil of two without the line joining their centres, or the complete quadrangle. The notes derive this from a statement that is false as written, and they give no independent proof. We give a short proof, together with the ordering of the pseudolines that the notes ask for, and we deduce that for n ≥ 6 the near-pencils are the only arrangements of n pseudolines containing none of the three configurations. The dichotomy has been checked by an exhaustive enumeration of all arrangements of at most nine pseudolines, and it is formalised in the proof assistant Lean for a combinatorial model of arrangements, generalised maps of Euler characteristic one.

Primarily AI-generated textHuman understanding: some partsGrothendieckLean 4MathlibMontpellier archiveSylvester–Gallaicomplete quadrangleformalisationgeneralised mapsnear-pencilpseudoline arrangements
Nov 07, 20267 pages
PDFView work

math.DS — Dynamical Systems

Globally periodic rational difference equations of arbitrary order

Contributed by John Rudge

A rational difference equation of order kk with nonnegative coefficients is globally periodic if every solution with positive initial data repeats with a common period. Five such equations have long been known, among them the Lyness equation xn+2=(1+xn+1)/xnx_{n+2}=(1+x_{n+1})/x_n, and a problem of Gasull asks whether every globally periodic equation of this kind is obtained from one of the five by rescaling and unfolding. The answer was known to be yes for k∈{1,2,3,4,5,7,9,11}k\in\{1,2,3,4,5,7,9,11\}. Here I show that it is yes at every order. The proof rests on two ideas. The first is a tropical degeneration: global periodicity forces an associated min-plus recursion to be periodic, and this is refuted, for every choice of coefficients at once, by an unbounded solution of the min-plus recursion linearised along a periodic orbit. The second is the σ\sigma-bump, a linearised solution whose existence reduces to a combinatorial condition on residues modulo 2k2k; in the hardest case that condition comes down to a lemma on three-term progressions under unit multipliers modulo 2k2k. The proof, including its finite computations, has been formalised in the Lean proof assistant.

Primarily AI-generated textHuman understanding: some parts
Nov 07, 202663 pages
PDFView work

math.NT — Number Theory

A Lean formalization of Waldschmidt's subgroup theorem with period term for groups with elliptic factors

Contributed by Shawn Krisman

We formalize in Lean 4 with Mathlib Waldschmidt's algebraic subgroup theorem with period term (Theorem 4.1 of his 1988 Durham paper) for G=Gad0×Gmd1×E1×⋯×EmG=\mathbb{G}_{\mathrm{a}}^{d_0}\times\mathbb{G}_{\mathrm{m}}^{d_1}\times E_1\times\dots\times E_m, with EjE_j elliptic curves with algebraic invariants, under the additional hypothesis 2N≥d1+2d0+κ2N\ge d_1+2d_0+\kappa. The proof uses only Lean's three standard axioms. Along the way we give what we believe are the first formal proofs of Schneider's theorems on elliptic functions and of the Schneider--Lang criterion, and the first Lean library for the Weierstrass σ\sigma and ζ\zeta functions. Restricted forms of the theorem cover some vector extensions and the Jacobian of y5=x(1−x)y^5=x(1-x). A companion certificate uses these to prove explicit cases of the four exponentials conjecture: for example, 2ϖ2^{\varpi} and 3ϖ3^{\varpi} are not both algebraic, where ϖ\varpi is the real period of y2=4x3−4xy^2=4x^3-4x, and likewise 2B(1/5,1/5)2^{B(1/5,1/5)} and 3B(1/5,1/5)3^{B(1/5,1/5)}.

Primarily AI-generated textHuman understanding: no partsLeanSchneider's theoremSchneider-Lang criterionalgebraic subgroup theoremelliptic functionsformal verificationmultiplicity estimatestranscendence
Nov 07, 202631 pages
PDFView work

cs.LO — Logic in Computer Science

Proof-Carrying Modernization: LLM Translations of COBOL Batch Programs, Each Proved Against the Original in Lean

Contributed by Tejasvi Singh Tomar

Large language models translate legacy code quickly, but a translation can differ from the original on inputs that no test exercises. We show that LLM translations of whole, unmodified COBOL programs into Rust and Java can be proved in Lean 4 to behave like our semantics of the originals on every admissible input: a bounded number of well-formed records, among other premises. The COBOL semantics is executable; it computes record layouts, decimal arithmetic and file handling from our front end’s output for the unmodified source. For the eight standalone batch programs of AWS CardDemo covered by that front end, all 16 translations are proved, as equivalences for Rust and as refinements with partial correctness for Java. The statements are generated from the programs except for a few small parts, LLM agents write the proofs, and Lean’s kernel checks them. Before any proof, 35% of the first running translations differed from our semantics of the original on a generated input, and no proof found a difference that this testing had missed.

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

cs.LO — Logic in Computer Science

Formalization of Robust Strictly Positive Real Synthesis for Fourth-Order Interval Polynomial Families

Contributed by Tiancheng Xu, Wensheng Yu

That every robustly Hurwitz-stable fourth-order interval polynomial family admits a common strictly positive real (SPR) numerator was conjectured by Anderson et al. and proved by Yu and Wang. In this paper, we present a complete formalization of this classical synthesis theorem in the Lean~4 interactive theorem prover.

Primarily AI-generated textHuman understanding: all partsHurwitz stabilityLean 4formal verificationinterval polynomial familyproof reconstructionstrictly positive real synthesis
Nov 06, 202613 pages
PDFView work

math.HO — History and Overview

Grothendieck Montpellier. Énoncés des lectures modernisées démontrés.

Contributed by Michel Hua

Working notes of Alexandre Grothendieck, put online by the University of Montpellier, have been transcribed and restated in current notation with a language model; the restatements may contain errors. This appendix proves statements taken from these restatements in seventy-five folders, in commutative algebra, algebraic geometry, plane affine geometry, general and tame topology, category and group theory, homotopical algebra, order theory, algebra and finite combinatorics. Each proof follows a proof checked in the Lean 4 proof assistant with its library mathlib. For each statement the text gives the context of the leaf, the proof, the hypotheses that are superfluous or necessary, and the corrections made to the restatement or to the page. It ends with the list of statements the sections report without a Lean check.

Author comments: v2. Part 1 (Lean appendix): a section on Venken's 1971 example, a non-effective finite equivalence relation that answers a question of the 1973 Buffalo lectures, checked in Lean (part Descente). A section on the "serene" objects and dualisable objects of the IHÉS manuscript "Motifs" (fonds Grothendieck–Illusie), checked in Lean. In the IHÉS notes on K of a triangulated category, the exact sequence K(D) → K(C) → K(C/D) → 0 for a thick subcategory and its Verdier quotient is proved in Lean, with Thomason's counterexample without thickness. Nine figures of the edition beside the statements of folders 70, 74, 78, 79, 80, 84, 86 and 154, each pointing to the facsimile page. Four new references (Dold–Puppe 1980, Lewis–May–Steinberger 1986, FGA III, Venken 1971). Part 2 (open questions): the Buffalo effectivity problem (Problem 14) is answered by Venken's example, with a second example of length 15 (16 in characteristic 2); a figure for the stable graphs of folder 147.

Primarily AI-generated textHuman understanding: some partsGrothendieckLean 4MathlibMontpellier archiveformalisationworking notes
Nov 05, 2026409 pages
PDFView work

math.NT — Number Theory

The parity of the prime-counting function in time xo(1)x^{o(1)}

Contributed by Vaibhav Tulsyan

Computing the prime-counting function π(x)\pi(x) exactly takes x1/2+o(1)x^{1/2+o(1)} steps by the analytic method of Lagarias and Odlyzko, and to our knowledge its parity is known faster only on short intervals: Tao, Croot and Helfgott decide whether an interval of length at most x1/2+cx^{1/2+c} near xx contains an odd number of primes in time x1/2−c+o(1)x^{1/2-c+o(1)}. However, their identity needs the Mobius function μ(d)\mu(d) for all d≤xd\le\sqrt x, and we know of no bound of the form xo(1)x^{o(1)} for the parity, even conditionally. We present deterministic algorithms that output π(x) mod 2\pi(x) \bmod 2 and the parity of the number of primes in any interval [A,B][A,B] in time 2O(n/log⁡n)=xo(1)2^{O(n/\sqrt{\log n})}=x^{o(1)}, where nn is the input bit length. Our approach replaces μ(d)\mu(d) by its residue modulo 2, which is the squarefree indicator again: the number of chains d12∣md_1^2\mid m, d22∣d1,…d_2^2\mid d_1,\dots of depth LL is odd exactly when mm is squarefree, for m<22Lm<2^{2^L}. The parity of π\pi on [A,B][A,B] is then the parity of one count of tuples satisfying O(log⁡n)O(\log n) multiplications, which Anthropic's counting engine evaluates through a network whose variables have geometrically shrinking widths. We prove both theorems in Lean 4 (piParity_TM_rate, piIntervalParity_TM_rate; axioms propext, Classical.choice, Quot.sound). The result does not give deterministic prime finding or the exact value of π(x)\pi(x): the parity can be even on every interval one queries, and exact counts seem to need iterated products, for whose product-tree verifiers we prove a lower bound in Lean. The constants are astronomical, and the result rests on Anthropic's Lean development of its claimed refutation of the Exponential Time Hypothesis, which is under review.

Primarily AI-generated textHuman understanding: some partsExponential Time HypothesisMobius functiondeterministic prime findingdivisor chainsparity of pi(x)prime-counting functionsquarefree numbers
Nov 05, 20269 pages
PDFView work

math.NT — Number Theory

Class numbers, square roots and quadratic non-residues in time 2O(n/log⁡n)2^{O(n/\sqrt{\log n})}, assuming the new #SAT algorithms

Contributed by Vaibhav Tulsyan

Basic counting problems of computational number theory have proven deterministic bounds that are fixed powers of the input. The class number h(D)h(D) of an imaginary quadratic discriminant takes ∣D∣1/2+o(1)|D|^{1/2+o(1)} steps unconditionally and ∣D∣1/5+o(1)|D|^{1/5+o(1)} under the generalised Riemann hypothesis (GRH); exact divisor sums ∑m≤xτ(m)\sum_{m\le x}\tau(m) take x1/3+o(1)x^{1/3+o(1)}. However, none of these bounds is of the form Xo(1)X^{o(1)}, even conditionally. We present deterministic algorithms in time 2O(n/log⁡n)2^{O(n/\sqrt{\log n})}, where nn is the input bit length, for the number of reduced forms of discriminant −N-N (for fundamental discriminants, h(−N)h(-N)) and for ∑m≤xτ(m)\sum_{m\le x}\tau(m), ∑m≤xσ(m)\sum_{m\le x}\sigma(m) and the Gauss circle count. Our approach writes each answer as a count of solutions of equations with one or two products and evaluates it with Anthropic's counting engine through one network library with O(n)O(n) shared bits. The same library gives the least square root modulo any mm and the least quadratic non-residue modulo a prime. These are not new bounds (OpenAI's results on the quasi-Riemann hypothesis and on deterministic polynomial factorisation over Fp\mathbb{F}_p give polynomial time modulo a prime), but they are machine-checked. We prove the seven resulting theorems in Lean 4 (for example hForm_TM_rate; axioms propext, Classical.choice, Quot.sound): a finite-alphabet Mathlib Turing machine outputs the answer within ⌊C⋅2Cn/log⁡2(n+2)⌋\lfloor C\cdot2^{Cn/\sqrt{\log_2(n+2)}}\rfloor steps on every input. Lean proves the count of Gauss's reduced forms; its equality with the ideal class number is classical and not formalised. The constants are astronomical, the machines use exponential space, and every result rests on Anthropic's Lean development of its claimed refutation of the Exponential Time Hypothesis, which is under review. Version 2 corrects the claims of version 1 about non-residues and square roots.

Primarily AI-generated textHuman understanding: some parts
Nov 05, 202612 pages
PDFView work

cs.DS — Data Structures and Algorithms

Counting Eulerian circuits in subexponential time, assuming the new #SAT algorithms

Contributed by Vaibhav Tulsyan

Counting the Eulerian circuits of an undirected graph is #P-complete, even for planar 4-regular graphs, while for directed graphs the BEST theorem counts them in polynomial time. However, we are unaware of any exact algorithm for undirected graphs of bounded degree that runs in time 2o(m)2^{o(m)}, where mm is the number of edges. We show that such an algorithm follows from the exact counting of Hamiltonian cycles that we proved earlier on top of Anthropic's claimed #SAT algorithm. The reduction is classical: by Kotzig's description, the Eulerian circuits of GG are in bijection with the Hamiltonian cycles of the line graph of the double subdivision of GG, which has 3m3m vertices and at most (Δ+1)m(\Delta+1)m edges. We prove in Lean 4 (theoremEuler, theoremEuler_noIso, theoremEuler_rate; axioms propext, Classical.choice, Quot.sound) that for every δ>0\delta>0 and Δ\Delta a finite-alphabet Mathlib Turing machine outputs the number of Eulerian circuits of every graph of maximum degree at most Δ\Delta within ⌊C(n+2)C2δm⌋\lfloor C(n+2)^C 2^{\delta m}\rfloor steps, and within ⌊C2δm⌋\lfloor C 2^{\delta m}\rfloor steps when there is no isolated vertex; and that one machine does so for all graphs within ⌊C(n+2)C2Cmlog⁡2(Δ+2)/log⁡2(m+2)⌋\lfloor C(n+2)^C 2^{Cm\log_2(\Delta+2)/\sqrt{\log_2(m+2)}}\rfloor steps. The factor (n+2)C(n+2)^C pays for reading the n2n^2-bit adjacency matrix and cannot be dropped. The bijection is checked by brute force on twelve small graphs, for example 132 circuits for K5K_5. The formal object is Kotzig's transition-system definition; its agreement with Mathlib's Eulerian walks is not formalised. The constants are astronomical, and the proof rests on Anthropic's Lean development of its claimed refutation of the Exponential Time Hypothesis, which is under review.

Primarily AI-generated textHuman understanding: some parts#P-completenessEuler toursEulerian CircuitsHamiltonian cycleexact countingline graph
Nov 04, 20268 pages
PDFView work

math.CO — Combinatorics

Three-colour cuboids from four-colour cubes

Contributed by Jason Davies

We determine the least number of four-colour cubes that guarantees a cuboid with monochromatic faces using exactly three colours. Each source uses all four colours of a fixed palette; only proper rotations are allowed, and interior faces need not match. For integer side lengths 2≤a≤b≤c2\le a\le b\le c, the sharp threshold for the corner-and-edge frame is max⁡{16a−3,4(a+b+c)−16,⌊(24c−1)/5⌋}\max\{16a-3,4(a+b+c)-16,\lfloor(24c-1)/5\rfloor\}, and the complete-cuboid threshold is max⁡{abc,16a−3,⌊(24c−1)/5⌋}\max\{abc,16a-3,\lfloor(24c-1)/5\rfloor\}. The three frame bounds arise from colour-bucket capacity, the number of positions and balanced checkerboards. The upper bound combines corner containment, a weighted graph selecting edge directions, and Hall's theorem. For cubic frames the threshold is 16n−316n-3, with exactly two failing collections of size 16n−416n-4. For n≥3n\ge3 we classify every failure of size at least 14n14n and count these collections and the inclusion-maximal ones. The case n=2n=2 answers the threshold question in Problem 2 of Berkove, Eickemeyer and Schulman (2018). All threshold, stability and counting results are formalised in Lean.

Primarily AI-generated textHuman understanding: some partsHall's theoremLean formalisationMacMahon cubescolour cubescuboidsextremal combinatorics
Nov 04, 202616 pages
PDFView work

math.CO — Combinatorics

Kernel Dimension of the Z/2 Connection Laplacian on a Finite Simple Graph (A Formalisation in Lean 4 / Mathlib v4.11.0)

Contributed by Jesus Vilela Jato

We present a Lean 4/Mathlib v4.11.0 formalization of the kernel-dimension theory of the Z/2\mathbb{Z}/2 connection Laplacian on finite simple graphs equipped with designated wrap edges. Each edge carries either the identity or the coordinate-swap matrix. A Hadamard–Kronecker change of basis decomposes the resulting rank-two connection Laplacian into the ordinary and signed graph Laplacians. An analogous splitting holds for the scalar Laplacian of the associated two-sheeted cover. A connected component is balanced precisely when its covering preimage has two connected components, equivalently when its sign holonomy is trivial along every closed walk. Consequently, the nullity of the signed Laplacian equals the number of balanced connected components, while the nullity of the full connection Laplacian equals the number of connected components plus the number of balanced components. For the flat connection, the nullity is twice the number of connected components. We also formalize exact characteristic polynomials and eigenvalue multisets, including multiplicities, for explicit ordinary and one-wrap signed cycle matrices for n≥3n \geq 3. Transfer to general connection-graph encodings remains conditional on specified matrix-reindexing identities. The contribution is a machine-checked formalization, exposition, and documented verification of results rooted in classical signed-graph spectral theory, rather than a claim of priority for those identities. The accompanying repository preserves proof artifacts, computational cross-checks, historical verification evidence, and documented corrections.

Primarily AI-generated textHuman understanding: some partsAI-assisted mathematicsLean 4connection Laplacianformal verificationgraph coverssigned graphsspectral graph theory
Nov 04, 202618 pages
PDFView work

math.CO — Combinatorics

The inverse problem for the number of connected induced subgraphs

Contributed by Lucas Almeida Almeida

For a finite graph GG, let c(G)c(G) be the number of nonempty vertex sets that induce a connected subgraph. We show that a positive integer kk equals c(G)c(G) for some finite connected graph GG if and only if k∉{2,4,5,8,9,16}k\notin\{2,4,5,8,9,16\}. Every attainable value k≠25k\ne25 is attained on ⌊log⁡2k⌋+1\lfloor\log_2 k\rfloor+1 vertices, the least possible number, and 2525 needs six vertices. More precisely, for every m≥6m\ge6 each integer from 2m−12^{m-1} to 2m−12^m-1 is the value of cc on a connected graph with exactly mm vertices. The proofs of these results are short and use no computer; computer calculations serve only as independent checks, and for two auxiliary results: the values on six to eight vertices, and the result on all connected subgraphs described below. The value 1616 falls into a gap above the path: a connected graph on n≥4n\ge4 vertices other than the path PnP_n has at least n−3n-3 more connected sets than PnP_n. The values k≥17k\ge17 are realized by a recursive construction from cones, disjoint unions and a family of graphs that we call near-cones, starting from seven small graphs; it produces a graph with c(G)=kc(G)=k in time polynomial in log⁡k\log k. The question arose from a problem of Ordoñez in continuum theory, through a reduction by Camargo, Ordoñez and Ramírez, who found the values up to 255255 by a computer search. The proof is formalized in Lean 4. We also observe that a theorem of Czabarka, Székely and Wagner on subtrees reduces the corresponding problem for the number of all connected subgraphs to a finite computation, and we report its outcome. We did not find these results in the literature, but we make no claim of novelty or priority.

A mix of human-written and AI-generated textHuman understanding: all partsLean 4connected induced subgraphsconnected setsformal verificationgraph invariantsinverse problem
Nov 03, 202621 pages
PDFView work

math.NT — Number Theory

A 7/8 zero-free half-plane for angular Hecke L-functions over the Eisenstein field

Contributed by Troy Winarski

We reconstruct the argument recorded in a frozen Lean development establishing nonvanishing of the unit-compatible angular Hecke LL-functions over Q(−3)\mathbb{Q}(\sqrt{-3}) in the strict half-plane ℜ(s)>7/8\Re(s)>7/8, apart from the genuine principal pole. The family includes every admissible integer angular order, all nonzero finite ideal moduli, primitive and imprimitive presentations, and real unitary norm twists. This strengthens the earlier 15/1615/16 result for the same angular family. The proof compares two estimates for a single normalized physical probe: a low bound with exponent 3/16+ω3/16+\omega and an approximation by a reciprocal Mellin signal with error exponent βn−11/16−σ\beta_n-11/16-\sigma, where βn\beta_n is the supremum of the real parts of zeros within a finite angular cap. Crucially, the positive saving σ\sigma is chosen before the target character. Mellin continuation converts these estimates into a strict improvement of the zero supremum. Induction on angular order, together with conjugation, establishes nonvanishing for the full family. The repaired public proof closure passed a clean compilation of 8,213 Lean modules and fresh native Lean kernel replay. An independent AI-assisted audit recorded five ACCEPT verdicts for the repaired package, following the identification and correction of a reproducibility defect in the original archive. We document the mathematical argument, formal verification evidence, and remaining limitations. This manuscript is an expository reconstruction, not independent human mathematical certification. We describe the formally verified proof as a *xenoproof* and the result provisionally as a *xenotheorem*, distinguishing machine-checkable correctness from established human mathematical understanding.

Primarily AI-generated textHuman understanding: some partsEisenstein integersHecke L-functionsLeananalytic number theoryangular Hecke charactersformal verificationxenoproofxenotheoremzero-free regions
Nov 02, 202616 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

math.NA — Numerical Analysis

Low-discrepancy quasi-uniform digital sequences in every dimension

Contributed by Leonhard Gruenschloss

A sequence of points in the unit cube is quasi-uniform if its first NN points are spread like a grid for every NN: no two of them are closer, and no empty ball between them is larger, than a constant times N−1/sN^{-1/s} in dimension ss. Dick, Goda and Suzuki asked for such sequences among the digital sequences of quasi-Monte Carlo integration, and Goda, Hofer and Suzuki asked whether any Halton-type sequence is quasi-uniform. We show that in dimension two and higher no Halton-type sequence, no Sobol' sequence, no classical Niederreiter sequence and no Faure sequence is quasi-uniform, and that linear scrambles of all coordinates but one do not help: a carry in the last digits of one coordinate leaves the leading digits of all others unchanged, giving explicit pairs of points that are far too close. We then show that one fixed linear scramble of a generalized Faure sequence, the same for all numbers of points, repairs this. In it, the digits of all coordinates at one scale are residues of one rational function, each taken at the coordinate's own point of the projective line, so the residue theorem ties the coordinates together and a carry in one coordinate is seen by the others. For every dimension ss and every prime base p>2sp>2^s this gives explicit quasi-uniform digital (0,s)(0,s)-sequences, hence of low discrepancy, whose first N=psK−1N=p^{sK-1} points are at least (1−2p−1/s)N−1/s(1-2p^{-1/s})N^{-1/s} apart, for every KK; in dimensions two and three, for every prime p≥5p\ge5, a variant keeps its first NN points at least (1−2/p)N−1/s(1-2/p)N^{-1/s} apart whenever NN is a power of ps2p^{s^2}. For such scrambles, exact linear rules that place every point inside its cell as a function of the last few digits of the cell's index can hold at no more than about one in ss of the sizes psKp^{sK}; with allowed ranges instead of exact rules we certify all of these sizes, with points at least (1−O(1/p))N−1/s(1-O(1/p))N^{-1/s} apart for large pp. Quasi-uniform digital sequences follow in every prime base p≥3p\ge3 in dimension three, and in every prime base in dimension two, base two included. Some steps are computer-assisted.

A mix of human-written and AI-generated textHuman understanding: some partsHalton sequencesLean 4 formalizationcovering radiusdigital sequenceslow discrepancyminimum distancequasi-Monte Carloquasi-uniformityresidue theorem
Oct 31, 2026102 pages
PDFView work

cs.CC — Computational Complexity

Deterministic Factoring in Time No(1)N^{o(1)}

Contributed by Isaac Rudich, Louis-Martin Rousseau

The current best upper bound for deterministic factoring is N1/5+o(1)N^{1/5+o(1)}. We provide a Lean certificate that there exists a deterministic Turing machine that computes the smallest prime factor of every NN in No(1)N^{o(1)} steps: for every k≥1k\ge 1 it runs within Ck 2n/kC_k\,2^{n/k} steps on nn-bit inputs. The algorithm reduces factoring to counting divisors with prescribed leading bits, and counts them by leveraging the counting engine used to refute the Exponential Time Hypothesis (ETH). The Lean statement that a reader must check to verify the proof is only 13 lines and only uses Mathlib. The full proof is about 35,000 lines. This note was written less than 24 hours after the ETH refutations were posted. No human-readable explanation of these results exists yet, and their Lean proofs are long: Anthropic's alone runs to about 152,000 lines. Our proof re-proves only the part of the counting engine it needs and imports nothing from those developments. We hope this application, with its short statement, serves as a stepping stone for those working to understand the engine; a follow-up paper will explain this proof in detail.

A mix of human-written and AI-generated textHuman understanding: some partsExponential Time HypothesisLeancounting algorithmsdeterministic factoringformal verificationinteger factorization
Oct 29, 20266 pages
PDFView work

math.CO — Combinatorics

The maximum Laplacian ratio of a tree: a complete answer to a question of Brualdi and Goldwasser, kernel-checked in Lean

Contributed by Peter W. Murphy, MD

For a tree TT with Laplacian L(T)L(T), Brualdi and Goldwasser (1984) introduced the Laplacian ratio π(T)=per⁡L(T)/∏vdeg⁡v\pi(T)=\operatorname{per} L(T)/\prod_v\deg v and asked which tree on nn vertices maximizes it. We answer the question for every nn. For every n≥4n\ge 4 the maximum is attained by a spider of cherry arms: a centre carrying pendant paths of length two (cherries) and arms, an arm being a vertex that carries cherries. For n≥492n\ge 492 the centre carries only arms, almost all with five cherries, and the exceptional arms are fixed by 6(n−1) mod 116(n-1)\bmod 11 through an explicit rule; for 4≤n≤4914\le n\le 491 the maximizer is given by an explicit table. Along the way we determine the exact exponential growth rate of the maximum, 64621ρn≤max⁡∣T∣=nπ(T)≤2ρn−1\tfrac{64}{621}\rho^{n}\le\max_{|T|=n}\pi(T)\le 2\rho^{n-1} with ρ=(621/64)1/11\rho=(621/64)^{1/11}, and prove the sharp inequality behind it: every pendant subtree bb has matching weight at most ρ∣b∣\rho^{|b|}, with equality exactly for the five-cherry arm. The whole argument is formalized in Lean 4 with Mathlib and checked by the Lean kernel, depending only on Lean's three standard axioms. Large parts of it are certificates: exact data produced by untrusted generators and checked by the kernel. We explain the mathematics, show where each piece lives in the formal development and why it is organized that way, and discuss what the answer and the method suggest. Code, certificates and the Lean formalization: https://github.com/DrMurphyIsIn/brualdi-goldwasser (release v1.4.4; Zenodo doi:10.5281/zenodo.22983412).

A mix of human-written and AI-generated textHuman understanding: some partsLaplacian permanentLean 4Mathlibextremal graph theoryformal verificationtrees
Oct 27, 202631 pages
PDFView work

math.NT — Number Theory

One of ζ(7),ζ(9),…,ζ(21)\zeta(7),\zeta(9),\dots,\zeta(21) is irrational

Contributed by Shawn Krisman

We prove that at least one of the eight numbers ζ(7),ζ(9),…,ζ(21)\zeta(7),\zeta(9),\dots,\zeta(21) is irrational. The previous best result of this kind not involving ζ(5)\zeta(5), a consequence of a theorem of Lai and Zhou, was that one of ζ(7),…,ζ(35)\zeta(7),\dots,\zeta(35) is irrational. We use Zudilin's hypergeometric construction: sums of fourth derivatives of rational functions with quintuple zeros give linear forms in 1,ζ(7),…,ζ(21)1,\zeta(7),\dots,\zeta(21) with no ζ(3)\zeta(3) or ζ(5)\zeta(5) term. The improvement comes from spreading the poles over eighteen blocks with nearby offsets, a sharper pp-adic bound on the denominators, and a saddle-point analysis of a cotangent contour integral. The estimates rest on exact rational and interval-arithmetic certificates. The whole proof, including these certificates, is formalised in Lean 4 with Mathlib and checked by the Lean kernel using only the standard axioms.

Author comments: Updated the paper to acknowledge that this result was found by CoolRmal several weeks earlier.

Primarily AI-generated textHuman understanding: no partsLeanRiemann Zeta Functionformal verificationhypergeometric linear formsirrationalityodd zeta valuessaddle-point method
Oct 26, 202634 pages
PDFView work

math.NT — Number Theory

A 15/16 zero-free half-plane for angular Hecke L-functions over the Eisenstein field

Contributed by Troy Winarski

We describe the argument recorded in a frozen Lean development for nonvanishing of the unit-compatible angular Hecke L-functions over Q(−3)\mathbb Q(\sqrt{-3}) in the strict half-plane ℜ(s)>15/16\Re(s)>15/16, apart from the genuine principal pole. The family includes imprimitive finite parts, every integer angular type allowed by the unit relation, and real unitary norm twists. The proof route passes through a mean-square estimate for the actual sextic rows, sixth-power averaging, a smoothed Möbius estimate with a totient factor, and Mellin continuation. We reconstruct the angular reflection, quadratic energy estimate, finite descent, and the calculation producing the 15/1615/16 exponent, while identifying the technical source lemmas inherited from OAI-003 that remain to be independently reconstructed. The theorem is formally verified in Lean and the frozen source/evidence package has undergone statement comparison, axiom audit, recursive kernel replay, quotient postchecking, and separate AI-assisted review. This manuscript is an expository reconstruction rather than a claim of independent human certification. We describe the formally verified proof as a xenoproof, and the theorem provisionally as a xenotheorem, to distinguish formal mathematical correctness from human mathematical understanding.

Primarily AI-generated textHuman understanding: some partsEisenstein integersHecke L-functionsLeananalytic number theoryangular Hecke charactersformal verificationxenoproofxenotheoremzero-free regions
Oct 22, 202636 pages
PDFView work

math-ph — Mathematical Physics

Beyond the Event Horizon: An Operator-First Theory of Persistent Geometry and Black Hole Dynamics

Contributed by Jeromie Beasley

A black hole carries one wall of each kind. Its horizon is a geometric fold: in the right coordinate it is smooth, and nothing breaks there. Its innermost stable circular orbit is a spectral wall, a Jordan block where steady circling turns into a plunge. This paper builds both kinds of wall exactly in a setting where every step can be proved and computed, and then compares them, structurally, with black holes. The setting is the shape space of four bodies. Its kinetic metric is the Bures metric of a real qutrit, and its one genuine wall, the coplanar configurations, is a fold at finite distance. Across it a tetrahedron meets its mirror image. The transport operator A(H) = TH + HT − 2Tr(TH)G is self-adjoint in the kinetic metric. Read in the Gram frame, its back-coupling vanishes like σ₃², and it forms a Jordan block whose square-root branch is exactly the orientation double cover. Lifted to the cover, it is analytic, and the wall point is a plain double point at the tip of a cone with slope 2|t₁−t₂|√(1−δ²). Both readings are exact. What a single eigenvector reports can fail at the wall; the eigenvalue pair and its trace-log ledger come through exact, and a loop through the mirror leaves a sign. New in edition 10 - Reflection and refraction on the projector metric. A wave meeting a step in the metric reflects through the metric along the step and the Clairaut constant C alone: Γ = (√(a₁−C) − √(a₂−C)) / (√(a₁−C) + √(a₂−C)). The transverse metric drops out at a sharp step. Total reflection begins exactly where a geodesic turns, so the optical threshold is a turning point. A change of spectral gap reflects with the peel coordinate tanh(½ ln Δ₂/Δ₁). - One Gram determinant does two jobs: it sets the wave admittance, and it caps the Berry curvature a path can feel (the angle safeguard of the intrinsic quantum geometric tensor). - Mirror and matched load. The polar stratum is a perfect mirror, |Γ| = 1. A Killing horizon, polar in the same sense, is a matched load, Γ = 0. - The photon ring, read by the same generator as the ISCO: each half orbit dims an image by e^−π = 0.0432, a value that belongs to the uncharged hole alone; charge lowers it. - The fermion record: its offset is a point on the same reflection chart, tanh(ħω/2k_BT_H). - The reflection tests were pre-registered before they ran, and each was pushed several ways: 400 random sharp steps, three smooth profiles, reciprocity, flux balance, the transverse metric in a thick layer, total reflection, and the gap form. Main results - The coplanar wall is a fold, and its distance is a Bures angle: arcsin√ε = arccos√F. - Quantum Fisher information on the shape space is eight times the shape kinetic energy wherever the rank is constant, and fidelity is blind to the mirror. - Two kinds of wall: spectral (a Jordan block in every frame) and geometric (a fold that a signed coordinate unfolds). The ISCO is spectral, at the point where gravity's effective power p = 2 + 6M/r reaches the inverse cube. The horizon is geometric. - Any distance potential is even across the wall, with stiffness 2∂V/∂w₃. A thin disk holds the shape at its own frequency ν. Gravity holds the square at ω = √(2(2√2−1)); its exact potential along the lifted square is given in closed form, and its stiffness turns over for a rhombus thinner than diagonal ratio k* = 0.144557. - Structural comparisons: Petrov types through Majorana stars (Kerr is type D), merging ringdown overtones, the horizon's surface resistance as a matched load (376.73 Ω), Bell violation by a Hawking pair, Ramanujan's mock theta functions, and the mirror rule for knots. The metric throughout is the intrinsic kinetic metric of the shape space, never a spacetime metric. Every statement about black holes is a structural comparison, and every claim carries its grade (derived, measured, cited, or structural) where it is made. Files - bh_paper_v10_1.pdf: the paper (56 pages). - bh_paper_v10_1.html: the web edition, with its cover; it runs no scripts. - bh_mixer_v10.html: the Event Horizon Mixer, edition 10. It runs offline in any browser and computes every curve live: the photon-ring orbits, the layered step, the reflection chart with the horizon and the fermion record, the sine guard, and the tip-and-tail matrices. Its Synchronize mode drives every eye from one wall dial, and its "Synchronize the universe" eye shows the connection energy draining as a ring of fields falls into step. - bh_v10_1_code_and_sources.zip: LaTeX source, figures, every check script with its saved output, the pre-registrations, the proof log and the ideas ledger, and a README. Each script states its kill condition before it runs (Python 3: numpy, scipy, sympy, mpmath, matplotlib). AI-assisted: the ideas and research direction are the author's; AI tools were used for literature search, computation, drafting and typesetting, and every number was checked by the scripts in the archive.

A mix of human-written and AI-generated textHuman understanding: some parts
Oct 20, 202656 pages
PDFView work

Advanced search

Text
Human understanding
Linked formalizations