math.AG — Algebraic Geometry
The Shapiro–Shapiro conjecture for ordered positive flags
We prove the Shapiro–Shapiro conjecture for ordered totally positive flags in Grassmannians.
Browse
Browse the Hexagon catalog.
math.AG — Algebraic Geometry
We prove the Shapiro–Shapiro conjecture for ordered totally positive flags in Grassmannians.
math.RT — Representation Theory
We prove the relative and traditional scheme-theoretic Humphreys conjectures for connected reductive groups over algebraically closed fields of positive characteristic exceeding the Coxeter number of every simple factor. We also prove that the self-extension support scheme of every finite-dimensional tilting module is reduced.
math.PR — Probability
This is an expository note on the asymptotics of the Wasserstein distance between the empirical measure of infinite-dimensional random paths and their common distribution. We present the classical proof for these asymptotics in the case of the Wiener measure, unifying quantization arguments from Dereich and coauthors or Boissard and Le Gouic, and we adapt it for It\^o diffusions sampled through the Girsanov theorem. More precisely, let be the law of the solution of a stochastic differential equation with a bounded Lipschitz drift. Let be independent Brownian paths, and let be their Girsanov weights for . The reweighted empirical measure $$\widehat\mu_n=\frac{\sum_{i=1}^n Z_i\delta_{W_i}}{\sum_{i=1}^n Z_i}$$ approximates when is large. We prove that the Wasserstein cost is of order , in expectation and almost surely, for every fixed . In the Brownian case where these results show that is asymptotically sandwiched between and , where is the first eigenvalue of the Laplacian operator in the unit ball. We provide numerical experiments to estimate the (conjectured) limiting constant in dimension .
math.RT — Representation Theory
We prove Conjectures A, A, and B of Bonnafé, Geck, Iancu, and Lam on Kazhdan–Lusztig cells in type .
math.PR — Probability
We determine the information and physical waiting needed to predict a rare intervention response with error smaller than its occurrence probability in a one-dimensional growth process with renewed Poisson interval catastrophes. Deletions of initial sources in macroscopic intervals define a mixed response, with all intervention arms sharing the same stationary past and future forcing. A fixed number of growing submacroscopic gaps determines its rare-event probability scale. We identify the response probability and amplitude, characterize when terminal extinction bits lose predictive information, and construct a gate that recovers this information from the recovery trajectory. For absolute and squared loss, a deterministic-age Bayes-risk expansion holds uniformly with additive error smaller than the rare-event probability. Our main waiting theorem covers every honest causal stopping rule, allowing the complete realized catastrophe history. Its average-time benchmark is the sum of each ordered gap length weighted by the extinction probabilities of preceding gaps. Prediction error smaller than the rare-event probability requires mean waiting divided by this benchmark to diverge; every prescribed diverging multiplier is achievable using actual recovery records. With gap scales and and integrated catastrophe tail , deterministic observation requires age larger than the scale, whereas a stopping rule achieves mean waiting . The proofs preserve the rare-event scale through weighted response approximation, risk transfer over arbitrary information fields, and posterior lower bounds on rare history branches.
math.AG — Algebraic Geometry
We prove that for every nonempty smooth projective variety over an arbitrary field and every Brauer class , the twisted derived category admits a Bridgeland stability condition with full numerical support. Based on Chunyi Li's construction and its extension to arbitrary fields, we establish uniform phase control under tensoring by an Azumaya algebra and calibrate the resulting slicing to the induced central charge. We further show that the constructed stability condition is geometric and satisfies a mass-Hom bound, which persists throughout its connected component.
math.NT — Number Theory
Let be a split semisimple group whose simple factors are of classical type, over a global function field of arbitrary positive characteristic. We prove that every semisimple elliptic Langlands parameter is the parameter of a cusp form on , in the sense of V. Lafforgue's excursion operators; we call such a form an automorphic realization of the parameter. Neither nor its field of constants is extended. We start from L. Lafforgue's theorem for general linear groups and use automorphic descent and the theta correspondence. The work is to prove that the descent does not vanish over , to carry out the computations with root subgroups in small characteristic, in particular in characteristic two, and to identify the parameter itself and not only its unramified Hecke eigenvalues. This is the third of three papers. Together with the first, which contains the arithmetic foundations, and the second, which treats the exceptional types by a geometric method, it gives automorphic realizations of semisimple parameters on all split reductive groups, with a restriction on the characteristic for the exceptional types only.
math.MG — Metric Geometry
Let be the polar projection body of a convex body in . In dimension , we prove that is a positive dilate of exactly when is an origin-centred ellipsoid, settling Petty's polar projection conjecture. The same classification holds under the weaker assumption that is a positive dilate of . The proof uses a distributional Laplacian identity to compare two integrals of central section volumes. Equality supplies contractive hyperplane projections with every kernel direction, and James's theorem gives ellipsoidal rigidity. The argument applies to arbitrary convex bodies and yields the translative constant volume conjecture of Horv\'ath and L\'angi.
math.CT — Category Theory
We study the restriction data carried by dependent-product extension along a monomorphism. In a locally cartesian closed category, the extended map is an isomorphism after a change of base if and only if the input map is an isomorphism on the restricted base. In a topos, its isomorphism locus is therefore the universal quantification of the input locus. A terminal characterization gives coherent comparisons for base change and successive extension, together with formulas for intersections and unions. Under explicit homotopical, cartesian, and universe hypotheses, this construction gives equivalence extension and preserves the boundary identifications used to prove fibrancy of a universe. Graph comparisons and strict fillers of a fixed universe boundary are represented by trivially fibrant objects. A single realignment over the comparison object induces a weak equivalence between these parameter objects, and both admit extensions of every finite cubical boundary. A finite-groupoid example shows that graph comparisons cannot be selected naturally under all isomorphisms of unstructured input.
math.NT — Number Theory
Let be a split simply connected semisimple group over a global function field whose characteristic does not divide the order of the Weyl group of . We prove that every semisimple elliptic Langlands parameter is the parameter of a cusp form on , in the sense of V. Lafforgue's excursion operators; we call such a form an automorphic realization of the parameter. The parameter may be ramified at finitely many places and may have finite monodromy, and neither nor its field of constants is extended. The starting point is the geometric Langlands correspondence in characteristic zero. It provides a sheaf, and the function which the trace of Frobenius attaches to a nonzero sheaf can vanish identically. The main point of the construction is to arrange that the trace in question is a determinant with no zero factor, and that it stays nonzero under specialization to the given field. This is the second of three papers. Together with the first, which contains the arithmetic foundations, and the third, which treats classical groups in every characteristic, it gives automorphic realizations of semisimple parameters on all split reductive groups, with a restriction on the characteristic for the exceptional types only.
math.NT — Number Theory
Let be a split connected reductive group over a global function field . V. Lafforgue decomposed the space of cusp forms on according to semisimple Langlands parameters. This is the first of three papers which prove a converse: every semisimple elliptic parameter is the parameter of a cusp form on over itself, which we call an automorphic realization of the parameter. This holds in every positive characteristic for classical groups, in characteristic greater than for and , greater than for , and greater than for and . A parameter that is not elliptic is the parameter of an automorphic form which is not cuspidal, under the bound for the smallest Levi subgroup through which the parameter factors. The form has the prescribed eigenvalue for every excursion operator, and we determine for which lattices in the centre it can be taken invariant. The present paper contains the arithmetic part of the proof. It defines excursion operators on functions that are not assumed cuspidal, proves their compatibility with constant terms, shows that a function on which they act through an elliptic parameter is a cusp form, and passes from simply connected groups to isogenous groups and from Levi subgroups to the group. This reduces the theorems to the existence of a cusp form with a given elliptic parameter on a simply connected simple group. That is proved in the second paper by a geometric method, when the characteristic does not divide the order of the Weyl group, and in the third paper for classical groups, by descent from general linear groups.
math.DS — Dynamical Systems
We study predator--prey systems with a fixed globally linear functional response and a strictly concave prey per-capita growth rate. For every and , we construct a growth polynomial of degree with exactly positive periodic orbits, all hyperbolic. The construction retains a chosen center -jet and the low-density growth rate and carrying capacity of its limiting profile, subject to an explicit relation between the center height and curvature. A limiting Lyapunov function and return-map estimates at three amplitude scales exclude additional cycles. A dissipative extension gives exact global counts with prescribed limiting center energies. We also prove that profiles with at least hyperbolic cycles are -dense in the admissible class, while preserving the entire germ at the maximum and both ecological endpoint values. The first nonzero canonical odd term determines the sharp differentiability threshold. Further results give parity restrictions for fixed focus jets, degree lower bounds, quantitative polynomial approximation under concavity and interpolation constraints, and amplitude and multiplicity interpolation by Abelian integrals. Finally, a single smooth strictly concave profile has infinitely many nested hyperbolic cycles converging to coexistence.
math.OC — Optimization and Control
We characterize factorizations in which and are stable, minimum-phase, biproper real-rational functions with simple poles and zeros and positive gains at infinity, and is a quadratic strictly positive real function. Classical rational decomposition identifies the quadratic right-factor classes with real Möbius involutions fixing . Within each class, we parameterize all normalized representatives and eliminate the scaling parameter and the frequency variable. The resulting sign conditions involve univariate polynomials of degree at most four. They determine all feasible denominator intervals and all factorizations in the class; for real-algebraic input, they give an exact decision procedure. We also give a scaling that maximizes the smaller of the inner positive-real margin and the outer spectral margin for a fixed denominator. For quadratic input, existence is equivalent to strict positive realness of and to an explicit coefficient inequality. Examples exhibit a disconnected feasible parameter set, separate algebraic and analytic obstructions, and a quartic input with exactly three admissible classes.
math.CA — Classical Analysis and ODEs
Let be the largest constant such that for every nonnegative function on the real line. We prove , improving the bound of Kim and Pilanci, by a spatial branch-and-bound over the masses of on equal bins. Consequently, for every large , every -Sidon set in has fewer than elements once is large enough in terms of . For real-valued supported in , let and be the analogous constants for the essential suprema of and of ; no lower bound better than the trivial bound was recorded for them. We prove with the argument principle. Both proofs are computer-assisted, and both theorems are also proved in Lean 4.
cs.LO — Logic in Computer Science
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 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.
cs.LO — Logic in Computer Science
In three-dimensional 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.
cs.LO — Logic in Computer Science
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 -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.
cs.DS — Data Structures and Algorithms
Let be the least number of comparators in a sorting network on inputs. We prove , one more than the previously best proved lower bound. We also prove for , where is the least worst-case number of comparators met by the two largest inputs in a network that delivers them to fixed outputs and 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 and , these values of , the two-value bound and the one-value bound give the twenty lower bounds on for in Dobbelaere's table; these bounds rested on Van Voorhis's inequality , whose published proof is invalid. The bound is also proved in Lean 4, with every step checked by Lean's kernel.
math.MG — Metric Geometry
The 24-cell conjecture states that every Voronoi cell of a packing of unit balls in has volume at least , the volume of the regular 24-cell. It implies that no packing of equal balls in is denser than the lattice packing . We prove the conjecture for two classes of cells; in each class, equality holds only for the root configuration. The first consists of the cells whose ball touches every ball centred at distance less than from its centre, and its proof uses a certificate at the second level of the Lasserre hierarchy. The second consists of the cells whose nearest centres lie in an explicit neighbourhood of the configuration, whatever the other centres are. For them the volume is at least plus a fixed multiple of the total outward displacement of the centres, which we prove by a quantitative rigidity estimate and a second-order expansion of the volume about . Our proofs for both classes are computer-assisted and partly formalised in Lean.
math.CO — Combinatorics
Whether a projective plane of order 12 exists is open. A subplane of order 3 of such a plane is a case of equality in Bruck's bound ; the 27 points on no line of the subplane then form a maximal arc of degree 3, and together with the subplane a maximal arc of degree 4. We show that every line of a subplane of order 3 contained in lies in at most two such subplanes, whereas in , which like has 40 points, a line lies in four planes; the proof uses Egan and Wanless's classification of triples of mutually orthogonal Latin squares of order 9. We also show that is not the design of any maximal arc of degree 3 in a plane of order 12, and that a permutation of the points that maps a subplane of order 3 onto itself and each line meeting it onto a line cannot have prime order other than 3. The proofs are computer-assisted, and their SAT refutations are certified.
cs.CC — Computational Complexity
Alman and Vassilevska Williams have refuted the 3SUM and APSP hypotheses. Their algorithms rest on counting the triangles through prescribed edges of lopsided tripartite graphs, whose middle part has vertices for a small . Majdoddin extended the method to every . We determine which of the main conditional lower bounds derived from the refuted hypotheses survive. We also prove that the method extends to every when the prescribed edges are known in advance and there are at most of them, which confirms Majdoddin's numerical estimate. Whether a bound survives depends mostly on the instances that its reduction produces. The reductions behind most bounds produce instances outside the range of the new algorithms: balanced graphs, or lopsided graphs with a larger middle part. Most of the set-disjointness, dynamic-graph and triangle bounds therefore follow from hypotheses that no known algorithm contradicts. These hypotheses, however, concern mainly such instances, and for several bounds the hypothesis is the bound itself, stated for these instances. Their evidence came largely from the refuted hypotheses. A few bounds are false, among them a lower bound of Goldstein, Lewenstein and Porat for Set Disjointness over small universes; the Strong SetDisjointness Conjecture also fails at small polynomial query times. Other bounds have lost their support, such as the Set Disjointness trade-offs of Kopelowitz, Pettie and Porat over small universes apart from constant query time. Finally, we collect the known obstacles to a larger closed-form range with a different base identity and use border-rank lower bounds to exclude several natural candidates.
quant-ph — Quantum Physics
The PPT conjecture asserts that the composition of two completely positive and completely copositive (PPT) maps is entanglement breaking. A recently announced counterexample, with PPT maps , is certified by the range criterion: the range of the composite Choi matrix contains no nonzero product vector. We ask how small a counterexample certified in this way can be. For PPT maps and with and we prove that the range of the Choi matrix of contains a nonzero product vector whenever or . Hence the range criterion cannot certify a counterexample on or , and among the types with all three dimensions at most six only remains open. Since the range is spanned by products of Kraus operators, the question is when such a span can avoid the matrices of rank one. The computer-assisted proof combines rank bounds for PPT maps with Chern class and excess intersection computations; its computed facts are checked in Lean 4, modulo classical, quoted or hand-proved inputs. The announced counterexample lifts through exterior powers a map on built from a pencil of real matrices (a map of pencil type). When the map of pencil type loses rank transversally at finitely many points, its lifts through any Schur functor, exterior powers included, put product vectors into the kernel of the composite Choi matrix. When the composite is also nonzero, these product vectors form an unextendible product set only for exterior powers, and then one of the three dimensions is at least ten.
quant-ph — Quantum Physics
The PPT conjecture asserts that the composition of two completely positive and completely copositive maps is entanglement breaking. A counterexample in dimension ten has recently been announced, and for maps on the conjecture is open. Let be the real span of the identity and five pairwise anticommuting Hermitian unitaries . It is a spin factor whose positive cone is a Lorentz cone. We prove the conjecture for all compositions of completely positive maps and , with arbitrary, such that the ranges of and of the adjoint lie in invertible congruences of the complex span of . Such maps are automatically completely copositive, and the class contains maps whose Choi matrices are entangled. A theorem of Hildebrand on separability for pairs of Lorentz cones reduces the claim to one trace inequality between the coefficient matrices of the two Choi matrices. We derive this inequality from the operator inequality , valid whenever and , which in turn follows from the Kadison–Schwarz inequality. As a corollary, is entanglement breaking whenever is such a map and is a completely positive map with Kraus operators of rank at most two.
math.PR — Probability
Let be the smallest constant such that for every real-valued function on every Hamming cube , where is the Euclidean length of and . Ben Efraim and Lust-Piquard proved , the Gaussian case gives , and Ivanisvili, Li, van Handel and Volberg asked whether . We prove that it is, with an explicit constant in dimension . 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 is also proved in Lean 4 with Mathlib.
math.CO — Combinatorics
A thrackle is a drawing of a graph in the plane in which every two edges meet exactly once, either at a common endpoint or at a proper crossing. Conway conjectured that a thrackle with vertices has at most edges. We prove that a thrackle with vertices has at most edges, improving the bound obtained by Tóth and, independently, by Scoppetto. The proof combines Xu's discharging argument with two computer searches, by the method of Fulek and Pach, showing that two generalized dumbbells in the sense of Fulek and Pach are not thrackleable: is a -cycle and an -cycle sharing one edge; is a -cycle and a -cycle sharing a path of three edges. A formal proof in Lean 4 derives the bound from five properties of thrackles and checks the computational facts it uses; Section 6 states what this proof trusts.
math.MG — Metric Geometry
A universal cover is a convex set in the plane that contains a congruent copy of every set of diameter at most . Lebesgue asked in 1914 for a universal cover of least area; before this work, the infimum of the areas of universal covers was known to satisfy . Lower bounds come from test sets: is bounded below by the least area of a convex hull of congruent copies of given sets of diameter at most . 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 , so they cannot give a much better bound. Adding the regular Reuleaux heptagon and nonagon of width , we improve the lower bound to . Without the nonagon, the other four bodies already give . 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.
math.PR — Probability
Let be the Beardwood–Halton–Hammersley constant: the shortest tour through independent uniform random points in the unit square has length asymptotic to almost surely. Dong and Cao proved from an inequality , where is an integral over configurations of points in the plane that form a connected graph when points at distance at most are joined. For , and , sharper bounds come from a first-order expansion of the area of the union of the unit disks on boxes of configurations. For , which Dong and Cao did not use, a lower bound comes from comparing each point only with the three points before it in the order of their first coordinates. We obtain , and if the exponential function of the C library used to evaluate the bound for has a relative error below . The proofs are computer-assisted; the bound is proved in Lean 4, with finite checks evaluated by compiled code, from the inequality of Dong and Cao and two statements about unions of disks that we prove but do not formalize.
cs.IT — Information Theory
Whether a binary doubly-even self-dual code exists is a question raised by Sloane in 1973. A series of papers, surveyed by Borello, shows that the automorphism group of such a code is trivial or isomorphic to , , or . We prove that such a code has no automorphism of order , or , and hence no nontrivial automorphism. Each such automorphism reduces the problem to a finite computer search. For order the search runs over symmetric bilinear forms on the self-dual codes. An automorphism of order leads to a search over labellings of the Hermitian self-dual codes over by the extended Golay code. Order reduces to unitary matrices over . Along the way we classify the Hermitian self-dual codes over : there are of them up to monomial equivalence.
math.CO — Combinatorics
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 , and the conjecture is open. We prove that it is at least , improving the bound of Ke, Huang, Shu, He, Gai and Wang. Their method reduces the induction step of Du and Hwang's 1983 proof of the bound 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 , 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.
math.DS — Dynamical Systems
For four positive masses in the plane we determine the number of central configurations, counted up to rotation, translation and scaling, in terms of one fold surface, whose certified enclosures decide for all masses outside a closed null set. Of these configurations, are collinear, by Moulton's theorem, and are convex, by the existence theorem of MacMillan and Bartky and the uniqueness proved in the author's preprint arXiv:2609.35632. Through Dziobek's relations, the concave configurations with inner body form the fibre of a proper mass map of degree . Their number , counted up to reflection, is , , or , and we read it off from the position of the mass ratios relative to this surface. Altogether , an even number with . Moreover exactly at Palmore's masses, and every even value in this range occurs. For four equal masses we recover Albouy's count . The proof shows with interval certificates that the mass map is injective where its Jacobian is not positive, obtains its degree from the restricted problem, and analyses its folds, cusps and Palmore's umbilic. A formalization in Lean also proves these results.
math.DS — Dynamical Systems
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.
math.MG — Metric Geometry
The kissing number is the largest number of non-overlapping unit balls in that can touch a common unit ball. The best bounds so far were and ; both upper bounds come from high-precision floating-point computations of the three-point bound by Mittelmann and Vallentin. We prove and . Each proof is an exact rational solution of the second level of the Lasserre hierarchy for spherical codes at degrees . 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 , and for spherical codes, improving the previous bounds , and ; with a known code, . The largest number of points at angle from a point of a kissing configuration in equals , so in this number is . 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 decimal places.
math.RA — Rings and Algebras
The tensor of matrix multiplication has rank at most 47 over , 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 if no 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 are locally optimal to depth 18, as is every decomposition equivalent to one of them, so a decomposition of rank 46 over 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 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.
cs.DS — Data Structures and Algorithms
We study -selection networks, which move the largest of inputs to given lines in any order, and the least number of comparators in such a network. Alekseev showed that . For we raise this bound by for every , and by when ; as far as we know, these are the first improvements at powers of two. The proofs follow the weights of the lines, and a pruning step of Yao extends the gain to every . For , Yao's upper bound is exact for . For the new bound is for all , and the value that Knuth expected is exact for . Their lower bounds rest on exhaustive searches at a few sizes and on the fact that one more input costs at least two more comparators. Most of the results are also proved in Lean 4, some through compiled checks.
cs.LO — Logic in Computer Science
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.
math.RA — Rings and Algebras
We prove that the rank of the matrix multiplication tensor over is at least ; the previous lower bound was . The bound follows by substitution from , which also gives . Each of the three bounds is one more than what follows from . A flattening argument reduces the bound for 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.
quant-ph — Quantum Physics
Under independent bit flips, rigorous lower bounds on the threshold of the surface code from earlier work stay below , while numerical estimates place the optimal threshold near . By counting labelled failure paths with exact transfer-matrix certificates, we prove without sampling that every minimum-weight decoder has threshold at least on the planar and rotated codes. We then give statistical certificates that, with confidence each, the optimal threshold of the planar code is at least under bit flips and at least 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 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.
quant-ph — Quantum Physics
Trillo and Navascués showed that the Diósi–Penrose model, in the Tilloy–Diósi form with the same smearing length in force and noise, entangles two masses in superposition when they are closer than about , and asked whether gravitationally induced entanglement can be observed beyond that distance. We answer for two rigid bodies whose branches are position eigenstates on finite sets, without kinetic term, for noise strength . One kernel, the Coulomb energy of the smeared bodies, sets both the Newtonian coupling and the correlated noise, and the question becomes a single geometric comparison: a product state becomes entangled if and only if the largest canonical correlation between neutral charge patterns on the two branch sets exceeds . Below this threshold the evolution is a separable operation at all times. The published critical distances are two-branch cases of the criterion: for parallel two-branch superpositions the supremum is at , and a straddling geometry reaches . With many branches there is no critical distance. What limits the effect is the model's own dephasing, which sits in the same quadratic form. For bodies of effective size ( for point masses) separated by a slab of width , the entangling rate at is at most times the single-body dephasing rate, to leading order in . For branches more than apart the entanglement is therefore transient and, if well separated, a fraction of order of what unitary Newtonian gravity gives; below it can last for days. Entanglement of the size unitary gravity predicts still excludes the model; the inference from any detected entanglement beyond a fixed multiple of does not hold.
math.NT — Number Theory
We prove that every positive integer congruent to modulo is a sum of two positive integers whose prime factors are all congruent to modulo , with admitted as a summand. Euler proposed this statement in a letter to Goldbach dated May 6, 1747. The proof counts representations by four squares and bounds those containing a common prime divisor congruent to modulo in either coordinate pair. An average over a nonsplit torus normalizer converts the quaternionic Hecke bound into an error independent of the sieving prime. Elementary estimates then give the explicit threshold . An exact finite arithmetic certificate covers the remaining integers in the required residue class.
math-ph — Mathematical Physics
King constructed the continuum, infinite-volume limit of three-dimensional scalar quantum electrodynamics, the (abelian) Higgs model, along Neumann–Dirichlet cubes. For his state at fixed photon mass we prove the Osterwalder–Schrader axioms: regularity with absolute constants, invariance under the full Euclidean group, reflection positivity about every plane, symmetry, and the measure with its ergodic decomposition, on whose components the cluster axiom holds in all its forms. Rotation invariance is proved by comparing King's cubes with periodic tori carrying a smooth mass wall on two lattices whose orientations differ by . With real scalar sources, the joint field of the curvature and the renormalised Wick square satisfies, on a tube of small Wick amplitudes, the axioms: regularity, invariance under translations and the lattice point group, Euclidean invariance of the joint field outside an exceptional set of couplings, reflection positivity for Wick amplitudes below a threshold, symmetry, and the measure with the cluster axiom in its weak form; above the threshold the Euclidean clause is open. The curvature results hold on King's whole coupling range; the Wick results hold under a one-sided sign clause of the Wick leg, which we prove on explicit coupling regions. The limit of vanishing photon mass is treated in a subsequent paper.
math.PR — Probability
We study the complex Hermitian Gaussian band matrix whose variance profile is the inverse of , where is the Neumann Laplacian on , in the critical regime . We prove that, for energies in a neighborhood of zero, the unfolded eigenvalue process converges to a stationary point process, whose law depends only on the limit of and is given by the partition functions of a supersymmetric sigma model on an interval. We also determine the macroscopic law of the mass of an eigenvector selected near a given energy. Its density is the normalized exponential of a Brownian motion with drift, under the law tilted by its total mass; the same law describes the eigenvectors of the critical one-dimensional random Schrödinger operator. Further, we compute the limits of the two-energy correlations of the local densities of states at all pairs of interior sites, of the mean eigenvector profile at the scale of single sites, and of times the mean inverse participation ratio, which is . As and , we recover the pair statistics of the GUE and of a Poisson process, and in the localized limit we obtain an explicit random shape for the eigenvectors. The number variance in a window of length grows like as at every fixed , and we describe the crossover to Poisson statistics in windows of length of order . Several of these results confirm predictions that physicists obtained from the sigma model. The proof starts from the supersymmetric representation of averages of ratios of characteristic polynomials, which for this profile is a transfer operator on a one-dimensional chain. We show that the transfer chain converges to the heat semigroup of the sigma model, whose noncompact direction produces the Brownian motion in the eigenvector law.
math.PR — Probability
We study the complex Hermitian Gaussian band matrix whose variance profile is the inverse of , where is the Neumann Laplacian on , in the critical regime . We prove that, for energies in a neighborhood of zero, the unfolded eigenvalue process converges to a stationary point process, whose law depends only on the limit of and is given by the partition functions of a supersymmetric sigma model on an interval. We also determine the macroscopic law of the mass of an eigenvector selected near a given energy. Its density is the normalized exponential of a Brownian motion with drift, under the law tilted by its total mass; the same law describes the eigenvectors of the critical one-dimensional random Schrödinger operator. Further, we compute the limits of the two-energy correlations of the local densities of states at all pairs of interior sites, of the mean eigenvector profile at the scale of single sites, and of times the mean inverse participation ratio, which is . As and , we recover the pair statistics of the GUE and of a Poisson process, and in the localized limit we obtain an explicit random shape for the eigenvectors. The number variance in a window of length grows like as at every fixed , and we describe the crossover to Poisson statistics in windows of length of order . Several of these results confirm predictions that physicists obtained from the sigma model. The proof starts from the supersymmetric representation of averages of ratios of characteristic polynomials, which for this profile is a transfer operator on a one-dimensional chain. We show that the transfer chain converges to the heat semigroup of the sigma model, whose noncompact direction produces the Brownian motion in the eigenvector law.
math.RT — Representation Theory
We give a computer-assisted proof of Lusztig's Fourier matrix conjecture for all finite noncrystallographic Coxeter groups. For every two-sided cell, the normalized -matrix of the Drinfeld center of its asymptotic Hecke category, equipped with the inherited pivotal structure, equals the corresponding Fourier matrix in the modular convention. In particular, we establish the exact matrix identity for the middle cell of type .
math.NT — Number Theory
This paper studies a question of Erdős about how the total number of divisors of Mersenne numbers grows when the range is doubled. We prove that the doubling ratio is always at least 3, sharp, and nearly 4 whenever the relevant Fermat numbers are composite, as all known ones are. We also reduce the open question of whether the ratio tends to infinity to a statement about indices with few divisors. This leads to a new conjecture on the prime factors of Mersenne numbers next to near-Wagstaff numbers, which we study through implications, barrier results and a proven polynomial analogue.
math.NA — Numerical Analysis
Abelian integrals, holomorphic differentials, period matrices and the Schottky--Klein prime function of a Riemann surface uniformized by a classical Schottky group are given by Poincar\'e theta series, which are sums over the elements of a free group. The algorithms that evaluate these series sum a truncated, possibly adaptively pruned, portion of the Cayley tree of the group, and the number of terms needed grows exponentially with the number of correct digits. We observe that the sum over all group elements starting with a fixed generator is a holomorphic function on the complement of a disc, and that these functions satisfy an exact linear functional equation coming from the self-similarity of the Cayley tree, given by a transfer operator built from the generators. Representing them by truncated Taylor expansions turns the evaluation of the series into a finite-dimensional linear problem, which we solve iteratively. The resulting algorithm computes the integrals , the period matrix and the prime function to bits of precision; for a fixed Schottky datum the number of arithmetic operations is cubic in and in the genus. We prove that it converges geometrically under a standard Schottky-type hypothesis on the group, which is closely related to the absolute convergence of the series. Along the way we give a complete proof of the cross-ratio formula for the period matrix, including a term that is missing from one version of it in the literature. We compare with the existing algorithms, and illustrate the method by reproducing a published value of the prime function and computing it to digits, and by computing period matrices of genus up to six to about digits.
math.NT — Number Theory
Independent audit and coefficient verification of C. Soulé's preprint "On the abc conjecture" (arXiv:2611.05217, 2026). This work neither proves nor disproves the abc conjecture; all No-Go statements are internal to the audited construction, and every statement that uses Soulé's Theorem A is explicitly tagged as conditional on it. We axiomatise the DIC framework and prove three stratified groups of results on Kodaira–Parshin arithmetic surface fibrations. (i) Unconditional geometric theorems: the adjunction identity , the Riemann–Hurwitz intersection numbers, the invariants of the general construction, and a Deligne–Riemann–Roch decomposition of the arithmetic coefficient. (ii) A meta-theorem: integrality of torsion lengths forces the coefficient of Theorem A onto the discrete set , (at the literature point ; for varying this is an arithmetic coincidence, not a structural barrier). A local hyperelliptic model gives , as the unique transverse output; second-order torsion gives , hence , leaving as the sole lattice candidate. The unified criterion has the unique solution ; the height is the canonical-bundle height of a fixed genus- curve (, confirmed by in Section 7.3.2 of the source), so requires genus and lies outside the theorem's hypotheses: the last cell is empty. (iii) Controlled weak abc: all unconditional bounds known for abc are of exponential type (; Stewart–Yu); the exponent below is of polynomial type, and its existence is what Theorem A supplies. We derive , unify the exponent as , and obtain . A discriminant stratification sharpens this to ; bootstrapping to exponent is impossible (); the discriminant-to-degree ratio is tower-monotone; is an Artin conductor identity; and the isometry step (32) of the source contributes only , derived unconditionally from a finite Čech complex, leaving , , , and unchanged. A verbatim check of the source confirms twelve items, including the statement and scope of Theorem A; the constant decomposes as , and Route 1 is closed. Appendices N–Z complete the audit: changing the type of external inequality yields a trichotomy; enlarging the prime set restores the bridge unconditionally but the resulting bound is vacuous, and a fixed finite is logically impossible by -unit finiteness; the five degrees of freedom are exhaustive, with the /-ring loophole closed at the bridging layer; a complete self-contained proof of density-one abc is given; the Szpiro-side verbatim check (Theorem 3, Moret-Bailly 6.4, Robin constants, and the Section 7.2/Section 7.3 partition) repairs the zero-degree-class applications of Corollary 1; and the remaining geometric gap is resolved: is a Prym map, , the -torsion ambiguity is completely classified, and translation invariance forces all Harder–Narasimhan slopes to coincide. Consequently is excluded unconditionally, with and inside the construction; on the Szpiro side , and are three scalings of the same discrete lattice, and the only remaining room is a single discrete factor at . There are twelve independent No-Go reasons; after Appendices G–Z only two conditional items remain: Theorem A (unremovable) and the strict isometry in (32) (no coefficient consequences). No Diophantine conjecture enters the derivations. We neither prove nor disprove the abc conjecture; all conclusions are internal to the construction under its listed hypotheses.
cs.LO — Logic in Computer Science
An investigation into the existence of a selection principle governing computational behaviour, in the form of the Expressiveness, Verifiability, Tractability (EVT) Hypothesis, is undertaken. The hypothesis is motivated by a simple observation: mechanisms that increase what a system can directly express, powerful control, effects, reflection, meta-programming, and self-interpretation, tend to undermine what can be verified uniformly and mechanically, while regimes that maximize static guarantees typically do so by restricting expressiveness or relocating effort into compilers, proof artifacts, or human interpretation. We analyze canonical failure modes that arise when one attempts to push beyond this frontier, distinguishing collapse of correctness, collapse of compilability, and collapse of comprehensibility. We then develop an order-theoretic model for comparing languages and verification disciplines and define an “E/V boundary” as a Pareto frontier in a partially ordered design space. Finally, we sketch how analogous tradeoffs appear in other computational domains, suggesting that “thermodynamic” boundary behaviour may be a recurring feature of expressive formalisms that demand strong global guarantees and within physical methods of information processing.
math.DG — Differential Geometry
We study spectral sequences in supergeometry and construct the Gysin sequence within the supermanifold framework. First, the foundational definitions are established and utilized to develop differential forms and de Rham cohomology on supermanifolds. We then apply a standard de Rham-to-Cech cohomology isomorphism to assemble a spectral sequence that accounts for the ˇ Z2-graded nature of supermanifolds. Finally, we explore additional properties arising from this construction, leading directly into Gysin sequences.
math.CO — Combinatorics
Let A be a finite abelian group. A nowhere-zero A-flow of a graph can be changed along a cycle: going around the cycle, add a fixed non-zero element of A to the value of every edge that points forward and subtract it from the value of every edge that points backward. The Cranston–Li–Su–Wang–Xu (2026) conjecture on the reconfiguration of nowhere-zero flows states that if A has at least four elements, then in every graph in which all degrees are even, any two nowhere-zero A-flows are joined by a chain of such changes through nowhere-zero A-flows. It also states that, for every integer k ≥ 4, the same holds for integer flows whose values are between 1 and k − 1 in absolute value, where each change adds a non-zero integer. We prove this conjecture. The proof is by induction on the number of edges. If a flow enters a vertex along one edge and leaves it along another edge with the same value, the two edges can be replaced by a single edge; this gives a smaller graph. The main step is to change every flow into a flow with such a pair of edges. For A-flows we do this when all degrees are at most 4; repeatedly replacing a vertex of degree at least 6 by a triangle, following Cranston et al., reduces the general case to this one. For integer flows, we show that, in a graph in which all degrees are even, any two nowhere-zero flows with values in the cyclic group Z_k, k ≥ 4, are joined by changes that add only 1, −1, 2 or −2, and that such changes lift to integer flows. All theorems of this paper are also proved in the Lean 4 proof assistant.
math.RT — Representation Theory
We prove the Humphreys support conjecture for connected reductive groups over algebraically closed fields of characteristic .