Browse

Group Theory

math.GR — Group Theory

math.GR RSS feed

Works in math.GR

45 works

math.GR — Group Theory

Which groups are automorphism groups of racks?

Contributed by G. Militaru

Every group is the automorphism group of a graph, of a magma, and even of a set-theoretic solution of the Yang-Baxter equation. We show that this fails for racks and quandles: the quaternion group of order eight is not the automorphism group of any rack, and it is the smallest group with this property. More generally, generalized quaternion groups and Hamiltonian groups are never automorphism groups of racks, and a dicyclic group is the automorphism group of a rack if and only if its order is not divisible by eight. On the positive side, dihedral, alternating and all finite abelian groups are automorphism groups of finite quandles.

Author comments: 19 pages + references. Comments are welcome.

A mix of human-written and AI-generated textHuman understanding: all partsHamiltonian groupautomorphism groupdicyclic groupquandlerackrepresentation problemset-theoretic Yang--Baxter equationuniversal categories
Nov 16, 202622 pages
PDFView work

math.GR — Group Theory

Flat linearity of uniform groups

Contributed by Teo Banica

A uniform group is a quotient ZK∗M→Γ→ZKM\mathbb Z_K^{*M}\to\Gamma\to\mathbb Z_K^M on which SMS_M acts by permuting the generators, and a flat representation is a representation π:Γ→UK\pi:\Gamma\to U_K such that each π(gi)\pi(g_i) has the KK-th roots of unity as eigenvalues. These are the quasi-flat matrix models of the group duals Γ^⊂SKM+\widehat{\Gamma}\subset S_{KM}^+. We show that ZK∗M\mathbb Z_K^{*M} is flat linear, in the sense that its flat representations separate points, and that for finite groups, flat linearity and stationarity reduce to exact covering problems. We use this to compute a census, and to prove results on the Heisenberg and metabelian groups.

Primarily AI-generated textHuman understanding: some partsFlat modelUniform group
Nov 15, 202628 pages
PDFView work

math.GR — Group Theory

Further cases of the inductive Alperin–McKay condition

Contributed by Qiyue Tang

We prove the inductive Alperin–McKay condition at every prime for finite simple groups of types AA, 2A{}^2A, BB, CC, and F4F_4, and for those of type DD in characteristic two. We also prove the corresponding block condition for all unipotent blocks of natural groups of type DD on their prescribed central quotients.

Author comments: I am posting this manuscript to share the mathematical results themselves. In doing so, I do not seek to assert ownership of the results or claim priority. I welcome anyone interested in checking the arguments or preparing a finished account, and I believe the eventual scholarly credit should go to those who undertake that work.

Primarily AI-generated textHuman understanding: no parts
Nov 15, 202665 pages
PDFView work

math.RT — Representation Theory

The inductive Alperin–McKay condition for G2(q)G_2(q) and 3D4(q){}^3D_4(q)

Contributed by Qiyue Tang

We verify the inductive Alperin–McKay condition for G2(q)G_2(q) (q≥3q\geq3) and 3D4(q){}^3D_4(q) (q≥2q\geq2) at every odd prime.

Author comments: I am posting this manuscript to share the mathematical results themselves. In doing so, I do not seek to assert ownership of the results or claim priority. I welcome anyone interested in checking the arguments or preparing a finished account, and I believe the eventual scholarly credit should go to those who undertake that work.

Primarily AI-generated textHuman understanding: no parts
Nov 15, 202615 pages
PDFView work

math.LO — Logic

Self-embedding monoids and the existential Thomas conjecture

Contributed by Dr. András Pongrácz

We give a countable homogeneous finitely bounded Ramsey structure in a finite relational language with finitely many reducts up to first-order interdefinability but infinitely many self-embedding monoids of reducts. The reducts producing these monoids are first-order interdefinable, while their monoids form a strictly increasing chain. This refutes the existential strengthening of Thomas' conjecture even under the Ramsey hypothesis. The example is an ordered expansion of an equivalence-relation structure. Before the order is added, that structure has exactly five reducts up to first-order interdefinability. We also give a revised proof of the classification of self-embedding monoids for reducts of the countable existentially closed binary branching semilinear order. Exactly five monoids occur, refining its three-class first-order classification. The proof transfers the known classification for the homogeneous binary branching CC-relation from antichains to arbitrary finite configurations. The additional step is a connectivity argument on finite labelled trees, using both preservation and reflection of the reduct's basic relations.

Primarily human-written textHuman understanding: all parts
Nov 15, 202634 pages
PDFView work

math.RT — Representation Theory

A proof of Lusztig’s conjectures for extended affine Weyl groups

Contributed by Qiyue Tang

We prove Lusztig’s conjectures P1–P15 for extended affine Weyl groups with positive integer-valued weight functions.

Author comments: I am posting this manuscript to share the mathematical results themselves. In doing so, I do not seek to assert ownership of the results or claim priority. I welcome anyone interested in checking the arguments or preparing a finished account, and I believe the eventual scholarly credit should go to those who undertake that work.

Primarily AI-generated textHuman understanding: no parts
Nov 13, 202657 pages
PDFView work

math.GR — Group Theory

A proof of Brauer's k(B)k(B)-conjecture at the prime two

Contributed by Qiyue Tang

We prove that every 22-block of a finite group has at most as many ordinary irreducible characters as the order of its defect groups.

Author comments: v2(2026/11/17):Version 1 underwent approximately 45 hours of review and revision using GPT-6 Pro. The next version will document the exact prompts and review procedure. I am posting this manuscript to share the mathematical results themselves. In doing so, I do not seek to assert ownership of the results or claim priority. I welcome anyone interested in checking the arguments or preparing a finished account, and I believe the eventual scholarly credit should go to those who undertake that work.

Primarily AI-generated textHuman understanding: no parts
Nov 13, 2026112 pages
PDFView work

cs.IT — Information Theory

The automorphism group of an extremal [72,36,16] code is trivial

Contributed by Tejasvi Singh Tomar

Whether a binary doubly-even self-dual [72,36,16][72,36,16] 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 C2C_2, C3C_3, C2×C2C_2\times C_2 or C5C_5. We prove that such a code has no automorphism of order 22, 33 or 55, and hence no nontrivial automorphism. Each such automorphism reduces the problem to a finite computer search. For order 22 the search runs over symmetric bilinear forms on the 4141 self-dual [36,18,8][36,18,8] codes. An automorphism of order 33 leads to a search over labellings of the Hermitian self-dual [24,12,8][24,12,8] codes over F4\mathbb{F}_4 by the extended Golay code. Order 55 reduces to 7×77\times7 unitary matrices over F16\mathbb{F}_{16}. Along the way we classify the Hermitian self-dual [24,12,8][24,12,8] codes over F4\mathbb{F}_4: there are 26 924 93126\,924\,931 of them up to monomial equivalence.

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

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

math.GR — Group Theory

Finite-length permutation modules for\\free-amalgamation structures of arbitrary arity

Contributed by Dr. András Pongrácz

Let $\A$ be the countable homogeneous limit of a free-amalgamation class in a finite relational language, expanded by a generic linear order. We prove that its tuple permutation modules have finite composition length over every field, also after naming finitely many points. More precisely, each orbit of increasing dd-tuples disjoint from the named points has a permutation module of length 2d2^d. This extends the theorem of Yang--Boja\'nczyk--Klin from unary and binary relations to relations of arbitrary arity. The main step shows that every finitely supported array whose sums over each single coordinate vanish is a linear combination of alternating sums obtained by independently doubling its coordinates. Its proof combines a Ramsey separation theorem with a construction that moves finite configurations into prescribed order intervals. Over a finite field, we also obtain finitely many closed invariant linear subspaces of $\F^{A^k}$; each is generated, in the product topology, by functions definable using at most kk additional parameters.

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

math.CO — Combinatorics

The exact diameter of the symmetric group 𝑆𝑛 with LRX generators

Contributed by Sergei Uskov, Alexander Chervov, Fedor Levkovich-Maslyuk, Ivan Litvak, Andrei Smolensky, Alexander Soibelman, Dia Taha

We consider the undirected Cayley graph of the symmetric group 𝑆𝑛 with respect to the cyclic shift 𝐿, its inverse 𝑅, and the transposition 𝑋 of the first two positions. We prove that its diameter is given by 𝑛(𝑛 − 1)/2 for every 𝑛 ≥ 4, thus settling a conjecture open since at least 2011. This is done by separately establishing sharp upper and lower bounds, invoking a variety of combinatorial and group-theoretic arguments which leave a finite set of special cases that are verified in the accompanying C++ code. We also provide a Lean formalization of the results.

A mix of human-written and AI-generated textHuman understanding: some partsCayley graphsLean 4formal verificationsymmetric groups
Nov 12, 202643 pages
PDFView work

math.RT — Representation Theory

Broué's Abelian Defect Group Conjecture for 2-Blocks

Contributed by Qiyue Tang

We prove that every 2-block of a finite group with an abelian defect group is splendidly Rickard equivalent to its Brauer correspondent.

Author comments: v3(2026/11/14):The mathematical content is unchanged. This revision adds a brief motivation statement and a link to the related research materials on GitHub.

Primarily AI-generated textHuman understanding: no parts
Nov 11, 202648 pages
PDFView work

math.GR — Group Theory

Twisted conjugacy in spherical Artin groups and their crystallographic quotients

Contributed by Jason Davies

A group has property R∞R_\infty if every automorphism has infinitely many twisted conjugacy classes. Let AA be an irreducible spherical Artin group of Coxeter rank at least two, with pure subgroup PP. We classify property R∞R_\infty for the crystallographic quotient Γ=A/[P,P]\Gamma=A/[P,P]. If AA has Coxeter rank at least three, then Γ\Gamma has R∞R_\infty. In type I2(m)I_2(m), this holds exactly when 4∣m4\mid m, or when mm is odd and 3∣m3\mid m. Together with the known dihedral Artin-group cases, the positive quotient results imply that every irreducible spherical Artin group of rank at least two has R∞R_\infty. The positive proofs combine the rational representation theory of the holonomy action with integral lattice constraints and explicit fixed-vector witnesses. In the negative dihedral cases, we construct automorphisms compatible with the crystallographic extension. For type I2(5)I_2(5), we exhibit an automorphism with Reidemeister number 1818, showing concretely that the quotient construction does not preserve R∞R_\infty. This example, including the identification with the presented Artin quotient and the exact Reidemeister count, is formalised in Lean. An alternative proof for seven Artin groups is formalised under explicitly stated external hypotheses.

Primarily AI-generated textHuman understanding: no partsArtin groupsCoxeter groupsReidemeister numberscrystallographic groupsproperty R-infinitytwisted conjugacy
Nov 11, 202622 pages
PDFView work

math.GN — General Topology

Smooth functions with isolated critical values and systems of fibers

Contributed by Naok Kitazawa

In the 2020s, Marzantowicz and Michalak have introduced the notion of system of smooth hypersurfaces and discussed Morse functions compatible with them: the hypersurfaces are regular level sets of the functions. This is a kind of fundamental theory on Morse functions and related differential topology and geometric topology. We extend this to a certain case: we discuss systems of regular level sets and critical level sets (regular fibers and singular fibers) of smooth functions with isolated critical values.

Primarily human-written textHuman understanding: all parts
Nov 11, 20268 pages
PDFView work

math.LO — Logic

Definability and Lifting in Model Subgroupoids

Contributed by Zhenyu Sun

Restriction to a wide subgroupoid of a model groupoid can introduce invariant relations, maps, and objects. For open topological groupoids, a map between restricted objects lifts exactly when its graph is invariant under the full groupoid, and a specified quotient presentation lifts exactly when its kernel relation is invariant. Under coherent restriction, these criteria recover definable maps and coherent quotient presentations. For finite continuous actions of a group with an open subgroup of finite index, coinduction identifies extensions with invariant subsets on which evaluation is bijective. For a finite group GG and a normal subgroup NN, we classify extensions of finite NN-sets by normalizer extensions of their orbit types. Multiplicities must be constant on conjugacy orbits of types; within each such block, the liftable multiplicities form the additive monoid generated by indices of subgroups over which the normalizer extension splits. The same subgroup data determine the groupoid of lifts and its isomorphism-class and mass generating functions. This classification also applies to finite continuous actions of profinite groups with an open normal subgroup. For a fixed action, a centralizer extension gives the splitting obstruction, with an H2H^2 obstruction and an H1H^1 classification when its kernel is abelian. The center of SL2(F5)\mathrm{SL}_2(\mathbb F_5) gives the monoid ⟨12,20⟩\langle12,20\rangle; Heisenberg groups over fields of odd prime order give unbounded lifting indices at fixed cohomological period. Finite torsor theories and infinite pure sets realize the definability criteria. For profinite extensions with finite kernel, one finite quotient detects all liftable multiplicities, though it need not carry every lift.

Author comments: 37 pages. Exact finite-group computations and their output are included as ancillary files.

Primarily human-written textHuman understanding: all partsBurnside ringscoherent toposesdefinabilityfinite group actionsgroup extensionsmodel groupoids
Nov 11, 202637 pages
PDFView work

math.QA — Quantum Algebra

Prime factors of fusion-category dimensions: weak group-theoreticity, rank and decomposition

Contributed by Sebastian Burciu, Jingcheng Dong, Sebastien Palcoux

Let DD be the Frobenius–Perron dimension of a weakly integral fusion category and Q(D)Q(D) its square-full part. For a divisor-minimal braided obstruction to weak group-theoreticity, we bound the conductors of character fields by formal codegrees and relate residue blocks to primary twists through local Weyl operators. For primes p<q<r<sp<q<r<s these restrictions give weak group-theoreticity whenever Q(D)Q(D) divides p5qarbp^5q^ar^b or p3q3rasbp^3q^3r^as^b, with a,ba,b arbitrary. Fixing the cofactor of a prime power gives a finite test even when its exponent is unrestricted. A braided category is weakly group-theoretical for Q(D)<29 160 000Q(D)<29\,160\,000 and solvable for odd Q(D)<6 087 156 075Q(D)<6\,087\,156\,075. The corresponding bounds without a braiding are D<5400D<5400 and odd D<121 275D<121\,275. Combining the dimension families with an exhaustive degree search gives rank at least 3232 for a non-pointed simple integral modular category, at least 3333 in nonsquare dimension, 5757 in odd dimension and 7575 in odd nonsquare dimension. We also obtain rank bounds without simplicity and prime-divisor criteria for a braided product decomposition.

Author comments: Strengthened the general rank bound to 32, incorporating the optimized degree search with dimension-family pruning. Unified verification code and certificates through rank 31, refreshed the manuscript–GitHub links, and preserved the 252-page length.

Primarily AI-generated textHuman understanding: some partsFusion categoriesmodular categoriesweak group-theoreticity
Nov 10, 2026252 pages
PDFView work

math.PR — Probability

Nonuniqueness of site percolation on nonamenable quasi-transitive graphs

Contributed by Yan Ru Pei

Benjamini and Schramm conjectured in 1996 that site percolation on every nonamenable quasi-transitive graph has pc<pup_c<p_u. We prove this in Hutchcroft's operator form: for Bernoulli site percolation on every connected, locally finite, nonamenable quasi-transitive graph, the critical two-point operator is bounded on ℓ2\ell^2, pc<p2→2≤pup_c<p_{2\to2}\le p_u, and in the standard monotone coupling infinitely many infinite clusters coexist at every parameter of a nondegenerate interval. Since bond percolation is site percolation on the line graph, this contains OpenAI's recent bond theorem. For unimodular automorphism groups we adapt OpenAI's proof: cut vertices replace bridges, a pruning lemma handles retained contact vertices, a rejection step controls the junctions created by opening a vertex, and pivotal corridors become induced paths. For nonunimodular groups we extend Tran and Nguyen's site argument from vertex-transitive to quasi-transitive graphs.

Author comments: 60 pages: main text pp. 1-28, appendices A-G. An earlier version is on Zenodo, doi:10.5281/zenodo.24023209; this version differs only in adding the companion paper's DOI to its bibliography entry. The proof uses three unrefereed inputs, listed in the introduction: OpenAI's manuscript on nonuniqueness of bond percolation (both cases), Section 5 of Tran and Nguyen, arXiv:2609.07026 (nonunimodular case), and the companion paper "Critical site percolation dies on (almost) every quasi-transitive graph", doi:10.5281/zenodo.24023188 (critical finiteness and the nonunimodular case).

A mix of human-written and AI-generated textHuman understanding: some partsBenjamini-Schramm conjecturenonamenable graphsnonuniquenessoperator normquasi-transitive graphssite percolation
Nov 10, 202660 pages
PDFView work

math.RT — Representation Theory

Lusztig's sharp bound for Hecke algebras

Contributed by Qiyue Tang

We prove Lusztig's sharp boundedness conjecture for Hecke algebras of finite-rank Coxeter systems with positive integer-valued weight functions.

Author comments: v2(2026/11/11):Version 1 passed the Rethlas-OSV review, which used GPT-6-Astra at high reasoning effort with four concurrent workers. The review reported no mathematical issues. By posting this manuscript on this platform, I do not seek to assert ownership of the results or claim priority. I welcome anyone interested in preparing a finished account or checking the arguments; the eventual scholarly credit should go to those who undertake that work.

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

math.RT — Representation Theory

Lusztig's conjectures for BnB_n, B~n\widetilde B_n, and C~n\widetilde C_n

Contributed by Qiyue Tang

We prove Lusztig's conjectures P1\mathrm{P1}–P15\mathrm{P15} for every positive integer-valued weight function on the finite Coxeter group of type BnB_n and the nonextended affine Weyl groups of types B~n\widetilde B_n and C~n\widetilde C_n.

Author comments: I have made no changes to the mathematical content of the paper. I do not plan to add new mathematical results to it, but I will correct any errors that come to light. I have made the research materials from all 18 rounds of work on Lusztig’s P1–P15 conjectures publicly available on GitHub:https://github.com/tqyqiqi1509/Lusztig-P1-P15/releases/tag/rounds-1-18 The rounds had a combined research window of about 171 hours. The archives include partial results that go beyond the two papers I posted here (https://hexagonmath.org/2611.00205v2 and https://hexagonmath.org/2611.00411v1). I think some of these results are worth pursuing, and I welcome anyone working on the problem to build on them. I would be glad if this work helped bring the problem closer to a solution.

Primarily AI-generated textHuman understanding: some parts
Nov 10, 202678 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.GR — Group Theory

Three-Relator Universal Group, Four-Relator Adian–Rabin Family, and Unrecognizability of #2(S2×S2)\#^2(S^2\times S^2)

Contributed by Qiuyu Ren

We construct a universal group with 2 generators and 3 relators, and an Adian–Rabin family with 2 generators and 4 relators whose nontrivial groups are universal. The resulting presentations show that the standard smooth manifold #n(S2×S2)\#^n(S^2\times S^2) is unrecognizable up to homeomorphism or diffeomorphism for every fixed n ≥ 2.

Primarily AI-generated textHuman understanding: some partsAdian-Rabinuniversal groupword problem
Nov 05, 202625 pages
PDFView work

math.GR — Group Theory

Soluble subgroup pairs in symmetric and alternating groups

Contributed by Qiyue Tang

We prove that every pair of soluble subgroups of the symmetric group SnS_n or the alternating group AnA_n has trivially intersecting conjugates whenever n≥21n\ge21. This answers the second question of Anagnostopoulou-Merkouri and Burness in Problem 21.3 of the Kourovka Notebook.

A mix of human-written and AI-generated textHuman understanding: some parts
Nov 03, 202618 pages
PDFView work

math.CO — Combinatorics

Exact diameter of the symmetric group with LX generators

Contributed by Sergei Uskov, Alexander Chervov, Fedor Levkovich-Maslyuk, Ivan Litvak, Andrei Smolensky, Alexander Soibelman

We prove an exact formula for the diameter of the directed Cayley graph for the symmetric group SnS_n with generators LL (left cyclic shift) and XX (exchange of the first two elements). For every n≥5n \geq 5, we show that the diameter equals (3n2−8n+12)/4(3n^2-8n+12)/4 for even nn and (3n2−8n+9)/4(3n^2-8n+9)/4 for odd nn. This resolves a longstanding question first proposed in the 1960's and refined in more recent work. The proof is AI-assisted and is based on a variety of combinatorial arguments. We also describe the agentic system we developed that led to this proof and looks highly promising for attacking other questions of this type. An accompanying Lean 4 formalization rigorously verifies the result.

A mix of human-written and AI-generated textHuman understanding: some partsCayley graphsGlushkov conjectureLean 4directed diameterformal verificationsymmetric groups
Nov 03, 202636 pages
PDFView work

math-ph — Mathematical Physics

Geometric Computation: Twin Helices and the Algebra of Flow

Contributed by Benjamin Kaminsky

This work constructs a manifold consisting of twin helices to investigate the existence of computational geometric bordisms, as part of the broader program of the Cobordism Hypothesis. We use these structures to define a class of deterministic computational substrates, termed Geometrically Computable Manifolds, and study their geometric, algebraic, and computational properties. We show that, in a discrete regime, these manifolds encode arbitrary cyclic groups and support universal computation. This leads to a hypothesis describing the structural trade-offs in physical computation across distinct computational phases. We then analyze a regime in which abelian gauge computation is modeled with ordinary differential equations, linking the construction to continuous geometric dynamics. This signals a new research direction in physical mathematics at the intersection of geometry, gauge theory, and computability theory, termed Geometric Computability Theory, in which computation is treated as a property of geometric compositions. This perspective opens avenues for future investigation, motivating the development of a constructive computational gauge theory with applications to Yang–Mills theory. As of this writing, no complete unified compositional semantics yet exists for the full range of these manifolds; future work will develop such a formalism.

Author comments: Updates: ---Specified the correct Lie algebra for conical helices in 1.1. ---Corrected "helicity" to "helices" in A.1.

A mix of human-written and AI-generated textHuman understanding: all partsYang-Mills theorycobordism hypothesisgeometric computationheliceshigher gauge theoryprequantum geometrytopological quantum field theory
Nov 03, 2026163 pages
PDFView work

math.FA — Functional Analysis

Weak amenability and Cowling’s conjecture for almost connected groups

Contributed by Cédric ARHANCET

We characterize weak amenability for arbitrary connected Lie groups and prove the product formula for the Cowling--Haagerup constant in terms of the simple factors of a Levi decomposition. Consequently, the constant is invariant under local isomorphism and decreases under quotients of connected locally compact groups. We also prove that a locally compact group GG with amenable component group G/G0G/G^0 has the Haagerup property if and only if it is weakly amenable with constant one. This proves Cowling's conjecture for connected Lie groups and almost connected locally compact groups. For groups with amenable component group, the Cowling--Haagerup constant is unchanged by every closed central quotient. We deduce applications to lattices and their central quotients. The proof combines Ozawa's invariant-state obstruction with averaging over central characters and the tensor identity for induced representations.

A mix of human-written and AI-generated textHuman understanding: some partsCowling--Haagerup constantHaagerup propertycentral extensionsconnected Lie groupsweak amenability
Oct 29, 202625 pages
PDFView work

math.GR — Group Theory

The Unbalanced Group Theorem

Contributed by Colin Defant, Ken Ono

The classification of finite simple groups (CFSG) identifies the basic building blocks of all finite groups. It grew from nineteenth-century work of Galois and Jordan into a collective effort involving many mathematicians, with Gorenstein playing a central organizing role. Its proof is a vast network of interdependent results such as the Feit--Thompson odd-order theorem, the signalizer functor theorem, and Aschbacher's classical involution theorem. The original papers make up the first-generation proof. The second-generation treatment, initiated by Gorenstein, Lyons, and Solomon, reorganizes and simplifies much of this work. A key structural result in the first-generation program is the Unbalanced Group Theorem (UGT). Under the inductive hypotheses of the classification, it says that a nontrivial subgroup of odd order normal in the centralizer of an involution forces the ambient simple group to be a group of Lie type in odd characteristic or one of the alternating groups of certain degrees. While formalizing the first-generation proof, we found counterexamples to a closure assertion used in a published route to UGT. This obstruction concerns that particular argument. UGT also has other proofs. Here we explain the obstruction and develop an alternative argument for the simple-group case using Solomon's 1976 theory of maximal 22-components, which provides a framework for comparing the simple pieces arising in different involution centralizers.

Primarily human-written textHuman understanding: all parts
Oct 27, 202635 pages
PDFView work

math.GR — Group Theory

Explicit Finite pp-Group Counterexamples to the Amit--Ashurst Conjecture

Contributed by Shihao Wang, Zhiwei Zheng

For every prime pp, we construct a finite pp-group GG of order p498p^{498} and nilpotency class two for which the word w=∏j=112[x2j−1,x2j]w=\prod_{j=1}^{12}[x_{2j-1},x_{2j}] admits a value g≠1g\ne1 whose fibre has size strictly less than ∣G∣23|G|^{23}. This gives counterexamples to the Amit--Ashurst conjecture for every prime. We determine the exact fibre size by reducing the word equation to matrix equations over Fp\mathbb{F}_p and counting their solutions.

Primarily AI-generated textHuman understanding: all parts
Oct 26, 202610 pages
PDFView work

math.GR — Group Theory

A Counterexample to Huppert's Conjecture

Contributed by Shihao Wang, Zhiwei Zheng

Let S=PSL4(5)S = \mathrm{PSL}_4(5) and let GG be the unique subgroup of PGL4(5)\mathrm{PGL}_4(5) containing SS with [G:S]=2[G:S] = 2. We prove that GG and SS have the same set of irreducible complex character degrees. Meanwhile, GG is centerless and is not isomorphic to S×AS \times A for any finite abelian group AA. This provides a counterexample to Huppert's conjecture.

Primarily AI-generated textHuman understanding: all parts
Oct 26, 20269 pages
PDFView work

math.AG — Algebraic Geometry

Weil classes on abelian sixfolds of Weil type for Q(i)\mathbb{Q}(i) with discriminant −3-3

Contributed by Benjamin Severn

Let K=Q(i)K=\mathbb{Q}(i). We prove that the Weil classes of every polarized complex abelian sixfold of Weil type for KK whose Hermitian discriminant is the non-split class [−3][-3] are algebraic, and that every Hodge class on every power of such a sixfold is algebraic when its Hodge group is the full special unitary group. The proof starts from Galois covers of the projective line with monodromy group W(E8)⋅μ4W(E_8)\cdot\mu_4, branched over twelve points: the multiplicity space of the natural representation in the cohomology of such a cover is the first cohomology of an abelian sixfold of Weil type, and a certified rank computation at one explicit cover shows that these sixfolds fill an open set of the nine-dimensional moduli space. Algebraic cycles reach these sixfolds through Milne's theorem on Lefschetz classes, from two sources: Schoen's cycles on cyclic covers, which a computer search shows do not suffice here, and products of determinant lines of characters on abelian covers of curves. For the second source we prove a general theorem (Theorem C): if such a product is of Hodge type at every Galois conjugate, and each of the cyclic covers involved has at least two branch points and order dividing 1212 after removing the common factor of its branch exponents, then the product spans a space of algebraic classes. Its proof runs Schoen's symmetric-product construction on each factor, localises at a special fibre, transfers to a product of Fermat hypersurfaces, and applies Shioda's theorem on products of Fermat varieties. This version is archived on Zenodo: https://doi.org/10.5281/zenodo.23566607; its computational certificates: https://doi.org/10.5281/zenodo.23549514

Primarily AI-generated textHuman understanding: some partsFermat varietiesHodge conjecturePrym-Tyurin varietiesWeil classesabelian coversabelian varieties of Weil type
Oct 22, 202653 pages
PDFView work

math.GT — Geometric Topology

The bridge index and the nonorientable four-genus of knots with at most thirteen crossings

Contributed by Deep Bhattacharjee

We determine two invariants for knots that the KnotInfo database leaves open. KnotInfo lists the bridge index of \btotal{} prime knots with thirteen crossings as either 33 or 44; we prove that \bclosed{} of them have bridge index and meridional rank 44, so the meridional rank conjecture holds for them. The lower bound comes from representations of the knot group in $\GL_4(\F_q)$ that send a meridian to a transvection or a reflection and fix no nonzero vector. KnotInfo leaves the smooth nonorientable four-genus open for \ntotal{} prime knots with eleven to thirteen crossings; we determine it for \nsettled{} of them and narrow the interval for \nnarrowed{} more. Upper bounds come from pinch moves, lower bounds from the Goeritz-lattice obstructions of Jabuka and Kelly evaluated by an exhaustive search for lattice embeddings. Every bound is a certificate checked by a program independent of the search that found it.

A mix of human-written and AI-generated textHuman understanding: some partsDonaldson diagonalisationGoeritz latticesKnotInfobridge indexmeridional ranknonorientable four-genuspinch movestransvections
Oct 22, 202617 pages
PDFView work

math.GT — Geometric Topology

Inscribed Square Problem and an Embedding of M¨obius Band in a Family of Solid Toruses

Contributed by Faris ELmikdad

In this paper, we relate the space of line segments induced by a Jordan curve in the plane to the space of line segments induced by the plane by embedding the M¨obius band associated with the curve into the family of toruses associated with the plane; we further demonstrate how the geometric ”square condition” of the curve translates into a topological property through this embedding.

Primarily human-written textHuman understanding: all partsM¨obius bandRotationSquare.Torus
Oct 22, 20269 pages
PDFView work

math.CT — Category Theory

The third unit in the adjoint tower of group involutions

Contributed by Zhenyu Sun

The functor G↦Hom⁡(C2,G)G\mapsto\operatorname{Hom}(C_2,G) determines an adjoint tower through successive Eilenberg--Moore comparison functors. We prove that the unit of the third adjunction need not be an isomorphism, answering a question of Bergman. For the generalized dihedral group H=(C4×C4)⋊C2H=(C_4\times C_4)\rtimes C_2, with inversion action, we compute F3V3H≅H×C2F_3V_3H\cong H\times C_2, with counit the first projection. The unit at V3HV_3H is injective, with underlying domain and codomain of cardinalities 2020 and 4040. For an arbitrary group GG, let E(G)=F2V2GE(G)=F_2V_2G and let KGK_G be the kernel of the second counit. We prove that KGK_G is central and that F3V3G≅E(G)/KG[2]F_3V_3G\cong E(G)/K_G[2], where KG[2]K_G[2] consists of the elements of KGK_G whose square is one. The third unit at V3GV_3G is an isomorphism precisely when KGK_G has no element of order four. A central extension of HH of order 128128 supplies such an element and yields the stated description of F3V3HF_3V_3H.

A mix of human-written and AI-generated textHuman understanding: all partsadjoint towercentral extensiongeneralized dihedral groupinvolutory quandlemonadic decomposition
Oct 20, 202616 pages
PDFView work

math.AG — Algebraic Geometry

Weil classes on every abelian sixfold of Weil type for Q(−3)\mathbb{Q}(\sqrt{-3})

Contributed by Benjamin Severn

We prove that the Weil classes of every polarized complex abelian sixfold of Weil type for K=Q(−3)K=\mathbb{Q}(\sqrt{-3}), of every Hermitian discriminant, are algebraic. The same holds for every abelian eightfold of Weil type for KK of signature (4,4)(4,4) with split discriminant, and every power of such a sixfold whose special Mumford--Tate group is SUHSU_H satisfies the Hodge conjecture. The proof applies the transfer theorem of the companion preprint to the Shephard--Todd group G34G_{34} with twenty reflections as local monodromies, and passes from eightfolds to sixfolds by a compensation argument. Two general tools are proved on the way. If every local monodromy of a transfer datum is conjugate to its inverse, the lattice condition of the transfer theorem follows from Brauer's induction theorem. Dominance of the period map follows from exact data at a maximal degeneration, by the nilpotent orbit theorem. We also give an explicit higher-dimensional form of Schoen's compensation argument, which shows that one decided cell of 2n2n-folds, n≥4n\ge4, decides every cell of sixfolds over the same imaginary quadratic field. No outside unrefereed manuscript is used. This version, with its computational certificates, is archived on Zenodo: https://doi.org/10.5281/zenodo.23422649

Primarily AI-generated textHuman understanding: some partsBrauer inductionHodge conjectureWeil classesabelian varieties of Weil typecomplex reflection groupsnilpotent orbits
Oct 20, 202631 pages
PDFView work

math.AG — Algebraic Geometry

A transfer theorem for Weil classes on Prym--Tyurin factors of Galois covers

Contributed by Benjamin Severn

Let KK be an imaginary quadratic field, GG a finite group, σ\sigma an irreducible representation of GG with character field KK, and SS a connected component of a Hurwitz space of GG-covers of P1\mathbb{P}^1 with fixed local monodromy. When the σ\sigma-isotypic factors of the Jacobians are abelian 2n2n-folds of Weil type for KK, we prove that the Weil classes of every polarized abelian 2n2n-fold of Weil type for KK with Hermitian discriminant d\mathfrak{d} are algebraic, provided three conditions hold: a lattice condition (L) on the characters of a group of multiplicative type attached to the cover, dominance (D) of the period map of SS, and the equality of the Hermitian discriminant of the family over SS with d\mathfrak{d}. None of the conditions refers to a particular group. The Hodge conjecture for every power of a member AA follows when the special Mumford--Tate group of AA itself is SUHSU_H; a statement about the generic member of the family does not suffice, and members with smaller Hodge group are not treated here. Positive instances of the conditions are verified by finite input certificates, so a new example needs new certificates, whose validation may need its own arguments, and no new transfer proof. The theorem recovers the case G=G32G=G_{32}, K=Q(−3)K=\mathbb{Q}(\sqrt{-3}), d=−2\mathfrak{d}=-2 of the author's earlier preprint (hexagon:2610.00246), with every step of that proof an instance of a general lemma. A second source of cycles, balanced combinations of several characters of one subgroup, is available conditionally on a theorem of an unrefereed manuscript on abelian covers. With it the datum (Q(i),[−3])(\mathbb{Q}(i),[-3]) carried by W(E8)⋅μ4W(E_8)\cdot\mu_4 satisfies every hypothesis, so, conditionally on that theorem, the Weil classes of every abelian sixfold of Weil type for Q(i)\mathbb{Q}(i) with discriminant −3-3 are algebraic. For this datum the Schoen-only condition (L) fails. A companion preprint applies the transfer theorem, with new tools, to prove that the Weil classes of every abelian sixfold of Weil type for Q(−3)\mathbb{Q}(\sqrt{-3}), of every Hermitian discriminant, are algebraic. We also state what the theorem cannot reach. This version, with its computational certificates, is archived on Zenodo: https://doi.org/10.5281/zenodo.23422651

Primarily AI-generated textHuman understanding: some partsGalois coversHodge conjecturePrym-Tyurin varietiesShimura varietiesWeil classes
Oct 20, 202631 pages
PDFView work

math.AG — Algebraic Geometry

Algebraicity of Weil classes on non-split abelian sixfolds of Weil type over Q(−3)\mathbb{Q}(\sqrt{-3}) with Hermitian determinant −2-2

Contributed by Antti Hippeläinen

Let K=Q(−3)K=\mathbb{Q}(\sqrt{-3}). We give a proof that every Weil class is algebraic on every complex abelian sixfold of Weil type for KK whose Hermitian form has signature (3,3)(3,3) and determinant −2-2 modulo norms. These forms are not split, so neither Schoen's theorem on sixfolds nor the theorem on sixfolds claimed in a preprint of Markman, both of which concern split forms, applies. We model the sixfolds by the part of the Jacobian of a cover C→P1C\to\mathbb{P}^1, branched at thirteen points, on which its group, the complex reflection group G32G_{32}, acts through its reflection representation. A degeneration argument with a ball-arithmetic certificate shows that this family dominates the nine-dimensional Shimura variety. On every member, an integral relation among characters induced from linear characters of subgroups, realized by correspondences with coefficients in the group algebra, reduces the Weil classes to the determinants of eigenspaces of eleven cyclic subcovers. A theorem of Schoen makes these determinants algebraic for the three étale subcovers; for the eight ramified ones we prove it for all cyclic covers of curves of degree at least 33 with at least 33 branch points and fully paired branching data, through a cone over a Fermat variety and Shioda's results. Specialization and isogenies then reach every sixfold. The determinant of the Hermitian form and the relation among characters are exact computations.

Primarily AI-generated textHuman understanding: no partsFermat varietiesHodge conjectureHurwitz spacesWeil classesabelian varieties of Weil typecomplex reflection groupsperiod maps
Oct 20, 202624 pages
PDFView work

math.CO — Combinatorics

A graph with three card types and five vertex orbits

Contributed by Deep Bhattacharjee, Ushashi Bhattacharya

We prove that the answer to part~(b) of Problem~20.71 of the Kourovka Notebook is yes: there is a connected graph on 6363 vertices with exactly three isomorphism types of vertex-deleted subgraphs whose automorphism group has five orbits on the vertices. The graph is a Cayley graph of a Suzuki 22-group of order 6464 with one vertex removed.

A mix of human-written and AI-generated textHuman understanding: some partsCayley graphSuzuki 2-groupdivisible design graphpseudosimilar verticesvertex-deleted subgraph
Oct 17, 202611 pages
PDFView work

math.GT — Geometric Topology

Integral tail signatures and the Hilbert--Smith conjecture

Contributed by Alexander Dabrowski

The obstruction to an effective pp-adic manifold action is an integer signature tail. On asymptotically controlled rational modules over one fixed free CpC_p-space, finite-cover Mayer--Vietoris makes the difference between pp copies and quotient-permutation tensoring nilpotent. Every degree-four class therefore has eventually pp-divisible signatures. An effective action gives a class of signature 11: coordinate averaging provides degree-one sphere control, free sheets turn quotient representatives into a compatible homotopy idempotent, and its normalized Poincar\'e corner forgets to a scalar manifold germ. Successive localization boundaries recover one copy of $\CP^2$, up to sign. The resulting contradiction proves the Hilbert--Smith conjecture.

Primarily AI-generated textHuman understanding: some partsHilbert–Smith conjectureHilbert’s fifth problemLie groupsalgebraic L-theorycontrolled topologylocally compact groupsp-adic group actionssignaturestransformation groups
Oct 16, 202617 pages
PDFView work

math.GR — Group Theory

A universal group with thirteen relators

Contributed by Qiuyu Ren

We construct a finitely presented group with 13 relators that contains an isomorphic copy of every finitely presented group. This improves Valiev's bound of 21 relators for universal groups. The proof combines Valiev's construction, subgroup calculations of Kegel--Li--Ren, and small-cancellation theory.

Primarily AI-generated textHuman understanding: some partsfinitely presented groupuniversal group
Oct 16, 202614 pages
PDFView work

math.CO — Combinatorics

The Coloured Sand Theorem: the p-part of the sandpile group of the Hamming graph, for every prime p dividing q and every dimension d

Contributed by Rafael Amichis Luengo

Let H(d,q)=KqdH(d,q)=K_q^{d} be the Hamming graph and K(H(d,q))K(H(d,q)) its sandpile group (critical group, Jacobian). For primes p∤qp\nmid q its pp-part was determined by Jacobson, Niedermaier and Reiner in 2003, who wrote that the other primes appear "to be difficult, due to bad behavior of its pp-primary structure". We determine the Sylow pp-subgroup of K(H(d,q))K(H(d,q)) for every prime pp dividing qq and every dd, by an explicit rule. After the splitting of Jacobson, Niedermaier and Reiner, the group is a sum of cokernels of operators q(c+H)+Uq(c+H)+U on the Boolean lattice (Theorem A). These split over the indecomposable tilting modules T(λ)T(\lambda) of SL2SL_2 in characteristic pp that occur in a tensor power of the natural module. The contribution of T(λ)T(\lambda) consists of explicit small cyclic factors and of 2∣I∣2^{|I|} large ones, where II is the set of positions of the nonzero base-pp digits of λ+1\lambda+1 below the leading one. The large ones are obtained by pooling explicit integers, built from binomial valuations and base-pp carries, into a non-increasing sequence (Theorems I and J). The proof writes down explicit Zp\mathbb{Z}_p-lattices for all tilting modules of SL2SL_2, one move per base-pp digit; it reduces each contribution to the Smith form of an explicit 2∣I∣×2∣I∣2^{|I|}\times2^{|I|} matrix, and computes that form as in our proof for the hypercube (The Dancing Sand Theorem), the case p=2p=2. We also give closed formulas that need no pooling: for p>dp>d with ballot numbers (B), for the exponent with every prime (C), and for the number of cyclic factors (D). This proves Conjecture I of version 3 of this paper. Every result of the paper, Theorems A–J, is checked in Lean 4 with Mathlib, for every prime, and the Lean project was rebuilt from its sources on GitHub's machines, on Mathlib's published build. This work has not been refereed by a human expert.

Primarily AI-generated textHuman understanding: some partsHamming graphLean 4Smith normal formcritical groupsandpile grouptilting modules
Oct 15, 202624 pages
PDFView work

math.AG — Algebraic Geometry

Algebraicity of Weil classes on abelian sixfolds of Weil type for Q(−3)\mathbb{Q}(\sqrt{-3}) with discriminant −2-2

Contributed by Benjamin Severn

Let K=Q(−3)K=\mathbb{Q}(\sqrt{-3}). We prove that the Weil classes of every polarized abelian sixfold of Weil type for KK with Hermitian discriminant −2-2 are algebraic. This is a non-split discriminant, to which the theorems of Schoen and of Markman on split Weil classes do not apply. The proof uses Prym--Tyurin varieties of covers of P1\mathbb{P}^1 with monodromy the complex reflection group G32G_{32}, and combines known mechanisms in a new configuration. First, on every such variety the Weil classes of the six-dimensional isotypic factor are algebraic. They are obtained, by a Lefschetz-class correspondence supplied by Milne's theorem, from Schoen's algebraic Weil classes on fifty-one cyclic intermediate quotients; the choice of quotients is governed by an integral identity among characters of a torus, verified by an exact computation. Second, the ten-dimensional family of these covers dominates the nine-dimensional moduli space: we exhibit an explicit cover at which the period map has rank nine, by a certified computation. Third, a Hilbert-scheme and Baire-category argument spreads algebraicity from an open set to the whole moduli space. The discriminant of the family is identified exactly. All computations are supplied as reproducible certificates. For the members whose special Mumford--Tate group is the full special unitary group, an invariant-theoretic lemma then gives the Hodge conjecture for every power. This version, with its computational certificates and review bundle, is archived on Zenodo: https://doi.org/10.5281/zenodo.23377274

Primarily AI-generated textHuman understanding: some partsHodge conjecturePrym-Tyurin varietiesWeil classesabelian varieties of Weil typecomplex reflection groupsperiod maps
Oct 14, 202637 pages
PDFView work

math.CO — Combinatorics

The Dancing Sand Theorem: the 2-part of the sandpile group of the hypercube, for every n

Contributed by Rafael Amichis Luengo

Let K(Qn)K (Q_{n}) be the sandpile group (critical group, Jacobian) of the nn-dimensional hypercube graph QnQ_{n}. Its odd part was determined by Bai in 2003; its 22-part has been open since then. Gao, Marx-Kuo, McDonald and Yuen determined its n−1n - 1 largest cyclic factors, and Betzer the nn-th, through a remark of theirs stated without proof. We determine the whole 2-part of K(Qn)K (Q_{n}) for every nn, by an explicit rule. The group splits over the indecomposable tilting modules T(λ)T (\lambda) of SL2\mathrm{SL}_{2} in characteristic 22 that occur in V⊗nV^{\otimes n}, with their multiplicities. The contribution of T(λ)T (\lambda) at the shift i=(n−λ)/2i = (n - \lambda) / 2 consists of explicit small cyclic factors and of 2∣I∣2^{| I |} large ones, where II is the set of binary digits of λ+1\lambda + 1 below the leading one. The large ones are obtained by pooling a sequence of explicit integers — binomial valuations and carries — into a non-increasing sequence, in the manner of isotonic regression. The proof reduces each contribution, by elimination inside explicit 22-adic lattices, to the Smith form of an explicit 2∣I∣×2∣I∣2^{| I |} \times 2^{| I |} integer matrix, and computes that Smith form from the valuations of its entries. It needs a unique cheapest matching for an upper bound and an inductive potential for a lower bound. As consequences we recover Bai's counts and the theorems of Gao, Marx-Kuo, McDonald and Yuen on the largest factors, we prove their Conjecture 4.14 without that remark, and we prove their Conjecture 5.4 and the formula for the (n+1)(n + 1)-th factor stated in the 2019 poster of three of them. We also prove the fold law: the 2-part of the sandpile group of the folded cube Qn/⟨(1,…,1)⟩Q_{n} / \langle (1, \dots, 1) \rangle is 2⋅Syl⁡2K(Qn)2 \cdot \operatorname{Syl}_{2} K (Q_{n}), the group obtained by lowering every exponent by one. With the results above this gives the whole 22-part of the sandpile group of the folded cube, and, with the known odd part, its whole sandpile group. The whole proof has been checked in the proof assistant Lean 4 with the Mathlib library, with nothing cited. This work has not been refereed by a human expert.

Primarily AI-generated textHuman understanding: some partsLeanSmith normal formcritical groupfolded cubehypercubesandpile grouptilting modules
Oct 12, 202658 pages
PDFView work

math.CO — Combinatorics

A characterization of cut-percolating bigraphs

Contributed by Václav Rozhoň

Conlon and Lee introduced reflection bigraphs and cut-percolation in their study of graph norms. We prove that, for connected bigraphs, these two notions coincide, confirming their prediction.

Primarily AI-generated textHuman understanding: some partsCoxeter groupsSidorenko's conjectureblock designscut-percolationgraph isomorphismgraph normsreflection groupsweakly norming graphs
Oct 11, 202655 pages
PDFView work

math.GR — Group Theory

Bruck loops with abelian inner mapping groups: a short proof

Contributed by Bartosz Naskrecki

Phillips and Stanovský proved that a Bruck loop with abelian inner mapping group has central nilpotency class at most two and asked for a human-friendly proof. We give a short self-contained proof: a displacement cocycle produces a commutant-valued endomorphism, right alternativity for commutant elements forces its image to be fixed, and cocycle rigidity makes that image central. This yields the abelian center quotient.

Primarily AI-generated textHuman understanding: all partsBruck loopsFormalized mathematicsLoop theory
Oct 11, 20263 pages
PDFView work

math.DS — Dynamical Systems

Uniform Kazhdan Monsters and Schmidt's Property M

Contributed by Mehdi Moradi

Let GG be an infinite finitely generated group whose proper subgroups are finite. We prove that a positive Kazhdan constant uniform over all finite generating sets forces every unit vector in every representation without invariant vectors to have a cofinite displacement gap. For ergodic probability-measure-preserving actions this gives \[ \liminf_{g\to\infty}\mu(gA\mathbin\triangle A) \geq \ku(G)^2\mu(A)(1-\mu(A)), \] and hence Schmidt's Property~MM. A tensor-square argument also gives a uniform gap from modulus one for diagonal matrix coefficients. Conditional on the graded-diagram package underlying the Osin--Sonkin construction, the theorem shows that their infinite finitely generated simple ICC group of bounded exponent has Property~MM. We include a corrected, constant-tracked proof of the Osin--Sonkin deduction from that package and conclude with questions about Ozawa's quasifinite Kazhdan quotients.

Primarily AI-generated textHuman understanding: some parts
Oct 07, 202612 pages
PDFView work

math.GR — Group Theory

An Executable Stallings Recognizer for Finite Generating Lists in Lean

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

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

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