Browse

Category Theory

math.CT — Category Theory

math.CT RSS feed

Works in math.CT

24 works

math.LO — Logic

Bounded Presentations and Normalization in Arithmetic Reconstruction

Contributed by Zhenyu Sun

We study bounded presentations of selected constructions in absolute anabelian geometry and Frobenioid theory. In bounded Zermelo set theory with Choice, we prove uniform recursion for a common state space and a uniformly supplied transition rule. Under explicit index bounds, membership-table codes place the states and their histories at the same finite type level. We construct coherent comparisons for representative quotients, fiberwise full skeletons, isofibrational base changes, and countable towers, and verify the lifting properties for model Frobenioids and angular presentations. For nonzero numerical observables transforming by positive scalars, compatible normalization exists exactly when the associated character is trivial on every isotropy group. A self-equivalence of the realified arithmetic Frobenioid over Q\mathbb{Q} preserves degree and every object isomorphism class but does not lift to the unit-trivialized perfection. The structural results give a relative uniform interpretation theorem: the weak theory constructs the bounded presentations and comparison maps, and specified arithmetic recognition theorems identify the resulting structures.

Author comments: 25 pages.

A mix of human-written and AI-generated textHuman understanding: some partsFrobenioidsarithmetic reconstructionbounded recursioncategorical equivalencenormalizationweak set theory
Nov 13, 202625 pages
PDFView work

math.CT — Category Theory

Isomorphism Loci and Coherence in Equivalence Extension

Contributed by Zhenyu Sun

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.

Primarily human-written textHuman understanding: all partsBeck–Chevalleydependent productequivalence extensionfibrant universeisomorphism locusrealignment
Nov 12, 202624 pages
PDFView work

math.RT — Representation Theory

Lusztig's Fourier matrix conjecture for finite noncrystallographic Coxeter groups

Contributed by Qiyue Tang

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 SS-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 74×7474\times74 matrix identity for the middle cell of type H4H_4.

Author comments: 37 pages. Supplementary computational data and verification materials are available at https://github.com/tqyqiqi1509/lusztig-fourier-conjecture 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 12, 202631 pages
PDFView work

cs.LO — Logic in Computer Science

Expressiveness, Verifiability, Tractability: Toward a Computational Thermodynamics

Contributed by Benjamin Kaminsky

An investigation into the existence of a conservation law 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.

A mix of human-written and AI-generated textHuman understanding: all partsEVT hypothesiscomputationprogramming languagesresource theory
Nov 12, 202639 pages
PDFView work

math.RT — Representation Theory

The Benson-Etingof-Ostrik conjecture

Contributed by Kevin Coulembier, Pavel Etingof, Johannes Flake, Joseph Newton, Victor Ostrik

We prove the conjecture of Benson-Etingof-Ostrik (2023): every symmetric tensor category of moderate growth over an algebraically closed field of positive characteristic admits a symmetric tensor functor to a higher Verlinde category, possibly of infinite height. Using maximal nilpotence and geometric reductivity, we reduce the problem to proving that finitely generated maximally nilpotent tensor categories are finite. The main ingredients are the construction of generic points using alternating norms and a Frobenius reduction of the fundamental coend to an ordinary Hopf subalgebra.

Author comments: The contributors plan to turn this AI generated proof into a human paper. v2: Updated citations of [CFNO] which is on the arxiv now.

Primarily AI-generated textHuman understanding: some partsBenson-Etingof-OstrikTensor categoriesfiber functorspositive characteristic
Nov 11, 202617 pages
PDFView work

math.CT — Category Theory

Higher Galois Recognition and Parameter Descent

Contributed by Zhenyu Sun

Let n≥0n\geq0 and let X\mathcal X be a bounded coherent ∞\infty-topos. Suppose that finitely many noninitial coherent nn-truncated objects cover its terminal object, and that every coherent nn-truncated object in each of their slices has a finite covering family of sections. We identify X≤ncoh\mathcal X^{\mathrm{coh}}_{\leq n} with Fun⁡(M,Sπ,≤n)\operatorname{Fun}(M,\mathcal S_{\pi,\leq n}) for a π\pi-finite (n+1)(n+1)-type MM, recovered by all finite models preserving finite limits, finite coproducts, and effective epimorphisms. Descent uses degrees through n+2n+2 for objects and n+1n+1 for maps; both bounds are sharp for finite homotopy actions. Every exact functor FF between recognized categories has a universal parameter PF=F!(1)P_F=F_!(1) and a canonical factorization through its slice with fully faithful second functor. This parameter characterizes full faithfulness, conservativity, and all exact slice factorizations. For successive abelian Postnikov layers, we identify the space of marked exact lifts with a path space of Eilenberg--Mac Lane sections with local coefficients. The obstruction, classes of lifts, and relative automorphisms occur in degrees r+1r+1, rr, and r−1r-1. We compute a twisted parity obstruction and, for odd primes, classify cyclic self-equivalence components by a pp-adic valuation. A nonzero Postnikov class can persist in the identity component. For continuous finite families over a profinite (n+1)(n+1)-type, we prove that a uniform finite-section atlas exists precisely when the complete model space is π\pi-finite. Exact functors from finite model semantics, together with their lift spaces, satisfy finite-stage descent, while explicit profinite examples separate objectwise trivialization from uniform parameter elimination.

Author comments: 49 pages. Second paper in the series Model groupoids and finite homotopy semantics. Includes two verification scripts and their outputs.

A mix of human-written and AI-generated textHuman understanding: some parts
Nov 11, 202649 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.HO — History and Overview

The Rising-Sea Theses: Twelve Theses on Mathematics and Machine Reasoning

Contributed by Vincent Liu

The Grothendieckian Programme is a set of seven works on machine reasoning about mathematics (34 volumes, 26,021 pages), released openly in October 2026 as first drafts that have not been peer-reviewed. This paper draws from them twelve theses on how mathematics and machine reasoning should be combined. Each thesis is stated in one sentence, argued, tied to the passages of the seven works on which it rests, related to existing work, and paired with an observation that would refute it. The theses concern the unit of mathematical knowledge for a reasoning system, the place of epistemic status, the latent space of mathematical reasoning, attention, failure, authority, and the method of discovery. The paper adds no mathematical result to the seven works; none of them claims a proof of the Riemann Hypothesis, the Birch and Swinnerton-Dyer conjecture, the Hodge conjecture, the abc conjecture or the Langlands correspondence.

Author comments: 26 pages, 5 figures. Version 1.0 of 28 October 2026; the same text is deposited at Zenodo, DOI 10.5281/zenodo.23734424 (all versions: 10.5281/zenodo.23734423). This copy was typeset with pdfLaTeX for Hexagon: its text is identical to version 1.0 at Zenodo, whose sealed PDF was typeset with LuaLaTeX, except that a broken cross-reference on page 3 ("igref{works}") is corrected to "Figure 1"; a few line and page breaks differ. The twelve theses are also set out at https://github.com/AlienMuse/grothendieckian-problems/blob/main/THESES.md; the seven works on which they rest, each with its DOI, are listed at https://github.com/AlienMuse/grothendieckian-programme. Corrections recorded since version 1.0 to the seven works and to the papers: https://github.com/AlienMuse/grothendieckian-problems/blob/main/ERRATA.md. Companion papers: The Grothendieckian Programme: An Overview (DOI 10.5281/zenodo.23734421) and The 57 Grothendieckian Problems (DOI 10.5281/zenodo.23734426).

A mix of human-written and AI-generated textHuman understanding: all partsGrothendieckian Programmedescentepistemic statusformal verificationmachine reasoningrecursive mathematical discovery
Nov 10, 202626 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.HO — History and Overview

The Grothendieckian Programme: An Overview — Seven Open Works on Mathematics and Machine Reasoning

Contributed by Vincent Liu

The Grothendieckian Programme is a series of seven works on machine reasoning about mathematics (34 volumes, 26,021 pages), released openly on Zenodo in October 2026 with an overview volume. Two of the works specify a reasoning architecture — a core that holds mathematical worlds as typed, versioned and verifiable objects, and a kernel that reasons inside such worlds by sites, sheaves and descent. Five apply one method, recursive mathematical discovery, to the Riemann Hypothesis, the conjecture of Birch and Swinnerton-Dyer, the Hodge conjecture, the abc conjecture and the Langlands programme, and record what it proves, what it reduces to stated hypotheses and what it leaves open. This paper describes the architecture, the five research subjects, the method, the published corpus and the open process by which the works are to be reviewed and continued. None of the works claims a proof of any of these conjectures; they are first drafts and have not been peer-reviewed.

Author comments: 10 pages, 3 figures. Version 1.0 of 28 October 2026; the same text is deposited at Zenodo, DOI 10.5281/zenodo.23734422 (all versions: 10.5281/zenodo.23734421). This copy was typeset with pdfLaTeX for Hexagon: its text, and its line and page breaks, are the same as in version 1.0 at Zenodo, whose sealed PDF was typeset with LuaLaTeX. The seven works it describes, each with its DOI, are listed at https://github.com/AlienMuse/grothendieckian-programme. Corrections recorded since version 1.0 to the seven works and to the papers: https://github.com/AlienMuse/grothendieckian-problems/blob/main/ERRATA.md. Companion papers: The Rising-Sea Theses (DOI 10.5281/zenodo.23734423) and The 57 Grothendieckian Problems (DOI 10.5281/zenodo.23734426).

A mix of human-written and AI-generated textHuman understanding: all partsGrothendieckian Programmedescentmachine reasoningmathematical worldsopen sciencerecursive mathematical discovery
Nov 10, 202610 pages
PDFView work

math.RA — Rings and Algebras

A family of finite dimensional Hopf algebras over C\mathbb{C} with varying algebra structure

Contributed by Pavel I Etingof

We construct an algebraic one-parameter family of complex Hopf algebras of dimension 10241024, with fixed coalgebra, whose underlying associative algebras vary in a continuous family of isomorphism classes. Four multiplication lines in the second radical layer of a distinguished block recover the jj-invariant of the elliptic curve given by the equation y2=x(x−1)(x−t2).y^2=x(x-1)(x-t^2). This answers negatively the finiteness question of Etingof and Gelaki concerning algebra types of Hopf algebras of fixed dimension.

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

math.HO — History and Overview

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

Contributed by Vincent Liu

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

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

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

math.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.CT — Category Theory

Acyclic Networks: Causal Comparisons, Convex Minors, and Gauge Descent

Contributed by Zhenyu Sun

We study natural transformations, minors, and symmetric monoidal decorations of finite directed acyclic networks. For any weakly connected small source category, a natural transformation into a free acyclic path category is determined by one component. If more than one transformation exists, common prefixes and suffixes give a canonical factorization through two constant functors and identify the transformation set with a single set of directed paths. Consequences include boundary rigidity, a decision algorithm, and a fundamental-group obstruction to non-uniqueness. For fusion–embedding minors, right fillings exist exactly when the graph pushout is acyclic. A support invariant detects a nonexact minor under the full gauge congruence, while path-convex embeddings admit two-sided fillings. Inverse-image pullbacks give canonical partial-map normal forms, a scanning algorithm, and a coherent presentation of the cartesian quotient. For open networks, wire splicing gives units, and diagram groupoids satisfy descent by homotopy pullback over the interface groupoid, including through-wires. This descent is invariant under strong symmetric monoidal equivalence and compatible with admissible event contractions within each piece. Finite-field examples yield orbit classifications, stabilizer weights, and boundary convolution formulas. Roof-refinement spaces realize spheres whose higher homotopy is lost under groupoid completion.

Primarily human-written textHuman understanding: all partsacyclic categoriescausal networksconvex minorsgauge groupoidshomotopy descentnatural transformationstensor networks
Nov 05, 202636 pages
PDFView work

math.OA — Operator Algebras

Universal Modules, Natural Pairings, and Weighted Isometries for Noncommutative LpL^p-Spaces

Contributed by Zhenyu Sun, Jilin Wang

For 1≤p<∞1\le p<\infty, we consider the functor LpL^p on finite tracial von Neumann algebras with trace-preserving embeddings, including nonunital ones. For a functor of unital contractive left modules with compatible distinguished vectors ξM\xi_M, finite direct sums of scalars determine the best constant in ∥xξM∥≤K∥x∥p\|x\xi_M\|\le K\|x\|_p. The pointed LpL^p functor is initial among the families satisfying this estimate with K=1K=1. Retaining only the bound on scalar points gives an atomic norm. On Cn\mathbb C^n with unit weights the norm of the identity from ℓnp\ell^p_n to this atomic space is asymptotic to p−1(log⁡n)1−1/pp^{-1}(\log n)^{1-1/p} for p>1p>1. For 1≤p,q<∞1\le p,q<\infty, every objectwise bounded natural bilinear family on Lp×LqL^p\times L^q has the form c τ(xy)+d τ(x)τ(y)c\,\tau(xy)+d\,\tau(x)\tau(y) for x,y∈Mx,y\in M, with c,dc,d independent of the object and c=0c=0 when 1/p+1/q>11/p+1/q>1. A uniformly bounded natural inner product on every Lp(M,τ)L^p(M,\tau) exists exactly at p=2p=2. For finite-dimensional unital embeddings preserving a faithful positive functional, we determine the nearest modularly compatible target density both in Hilbert--Schmidt norm and in the Hilbert--Schmidt distance between positive square roots. The minimum squared distance between square roots lies between a weighted sum of the losses in squared L2L^2 norm on matrix units and twice that sum. Both constants are sharp.

Primarily human-written textHuman understanding: all partsconditional expectationsmodular compatibilitynatural transformationsnoncommutative Lp spacesoperator spacesuniversal property
Nov 05, 202623 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.MP — Mathematical Physics

Gluing defects for projected coarse graining in finite spin-foam models

Contributed by Zhenyu Sun

Orthogonal truncation can discard states that contribute to a later boundary amplitude. For a self-adjoint contraction TT on a finite-dimensional Hilbert space and an isometric inclusion ss of retained states, we prove that the two-step residual Δ=s∗T2s−(s∗Ts)2\Delta=s^*T^2s-(s^*Ts)^2 controls every finite placement of intermediate projections in every Schatten norm. For blocks of lengths n1,…,nkn_1,\ldots,n_k, the error is at most ∑i<jninj∥Δ∥\sum_{i<j}n_in_j\|\Delta\|, and the constant is optimal even for positive contractions. The residual vanishes exactly when the retained subspace is invariant. Two-dimensional finite-group gauge sums realize an idempotent projected transfer operator with nonzero residual, as well as positive-semidefinite transfer operators with identical one-step retained data and different residuals. We derive their gluing and subdivision identities with explicit boundary measures and BF normalization. We also bound the accumulation of local errors under tensor contraction and the distance to compatible linear amplitude data. Colimits extend compatible amplitude families, and quotients by invariant subspaces preserve the comparison maps. A measurement map that is injective on the retained ansatz gives a unique normalized least-squares fit. Exact rational calculations reproduce the finite-group examples and the blocking comparisons.

Primarily human-written textHuman understanding: all partscoarse grainingcylindrical consistencyfinite gauge theoryspin foamstensor gluingtruncation error
Oct 22, 202625 pages
PDFView work

math.CT — Category Theory

Vanishing of Higher Magnitude Homology for Finite Prefix Models

Contributed by Ryoji Hirayama

Bradley and Vigneaux define a generalized distance on a finite prefix poset using next-token probabilities. They conjecture that its higher magnitude homology vanishes. Motivated by their expression of magnitude as a weighted sum of homological Euler characteristics, we verify this conjecture for their explicit complex, in which both endpoint faces are zero. For each finite length, the homology groups in degrees two and above are zero. The degree-one homology group is free abelian, with one generator for each positive-probability edge of that length. The proof constructs a contracting homotopy for each component whose endpoints have an interior prefix. This homotopy inserts the least interior prefix. Edge probabilities zero and one are both allowed.

A mix of human-written and AI-generated textHuman understanding: all partsenriched categorieslanguage modelsmagnitude homologyprefix posets
Oct 22, 20263 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.QA — Quantum Algebra

Low-rank Grothendieck rings: an AI-assisted classification project, constructions, and open problems

Contributed by Sebastien Palcoux

We present a public AI-generated research project on fusion rings and their categorifications over C\mathbb C, with data extending through rank twelve. The project reports unrestricted Grothendieck-ring classifications in ranks two, three, and four, a complete multiplicity-free classification through rank twelve, and classifications or partial classifications at higher multiplicities. The released census contains 1,434,0421{,}434{,}042 rings in ranks three through twelve; ten categorification questions remain open within its stated bounds. The resources include research manuscripts, categorical models, exclusion arguments, verification code, and an interactive atlas. One categorical model per ring suffices for our classification problem; classifying all realizing categories up to equivalence is a further task. We summarize the current scope, compare it with AnyonWiki, and link to the online constructions catalogue and unresolved cases. The project's original research content was generated by AI under human direction; independent human verification remains pending.

Primarily AI-generated textHuman understanding: some partsAI-assisted mathematicsFusion categoriesGrothendieck ringscategorificationfusion multiplicitylow ranknear-group categories
Oct 17, 20264 pages
PDFView work

math.CT — Category Theory

The Grothendieck construction between the telescope monad and contextads

Contributed by Kotaro Kamiya

A telescope is a list of stages in which each stage is a family indexed over the Grothendieck construction of the previous ones. The telescope monad stacks stages as the free-monoid 2-monad on spans, whereas a contextad collapses two stages into one by a dependent sum. This paper derives both from the span of single stages, and thereby explains why the strict algebras of the telescope monad are contextads. The link is the Grothendieck extension of a span. Because it is monoidal and preserves coproducts, it turns the telescopes into the free monad on the extension of the span of stages and the stage contextad into the Grothendieck monad, whose Kleisli arrows are the contextful arrows. The main theorem identifies the stage contextad with the pseudo-algebra of the telescope monad transported from the display contextad. Its structure map is the dependent sum, which the extension turns into the iterated multiplication of the Grothendieck monad.

A mix of human-written and AI-generated textHuman understanding: some partsGrothendieck constructioncomprehension categorycontextaddependent sumtelescope
Oct 17, 202625 pages
PDFView work

math.QA — Quantum Algebra

Unipotent tensor categories and pronilpotent Lie quasibialgebras

Contributed by Pavel I Etingof

We construct a bijection between tensor equivalence classes of unipotent tensor categories over $\C$ and continuous Lie quasibialgebras with linearly compact pronilpotent underlying Lie algebra, modulo continuous isomorphisms and classical twists. The bijection is defined using a fixed universal quantization functor and solves the problem raised in Remark~4.6 of arXiv:0708.1487 by Etingof and Gelaki. The proof combines reconstruction with filtered dequantization modulo twists and convergence of universal formulas. A category admits a tensor fiber functor precisely when a classical twist removes its curvature.

Primarily AI-generated textHuman understanding: some partsTensor categoriesquasi-Hopf algebras
Oct 14, 202627 pages
PDFView work

math.QA — Quantum Algebra

The Haagerup VOA at Central Charge Eight

Contributed by Andrew Riesen

We give an explicit construction of a vertex operator algebra UU of central charge eight inside VE6⊕A2V_{E_6\oplus A_2}, and prove the ribbon equivalence $\Rep(U)\simeq Z(\HH_3)$, where $\HH_3$ is a Haagerup fusion category. The algebra is generated as a vertex algebra by six affine generators and three specified weight-two vectors. The argument combines exact lattice-vector calculations with an all-weight strong-generation induction, a finite presentation and semisimple descent for a full corner of Zhu's algebra, and the actual multiplication of two holomorphic E8E_8 extensions. The categorical identification uses splitting maps and a comparison with the Evans--Gannon reconstruction, not modular data alone.

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

math.AT — Algebraic Topology

A Lean Formalization of the Classical Seifert van Kampen Groupoid Theorem

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

We explain a Lean 4 formalization of the classical Seifert van Kampen theorem for the full fundamental groupoid. For an arbitrary topological space covered by two open subsets, the inclusion-induced square of ordinary continuous-path fundamental groupoids is a pushout in the category of categories. Every point is retained as an object; no basepoint, connectedness, or separation hypothesis is required. The development identifies an auxiliary directed path category for the indiscrete preorder with Mathlib's fundamental groupoid through strictly inverse functors and naturality equalities. It then assembles the pushout universal property from attributed path-subdivision and homotopy-grid helpers adapted from the directed-topology formalization of Basold, Bruin, and Lawson. We describe the descent construction, its transfer to ordinary fundamental groupoids, and the statement and verification boundaries of the exact artifact registered in Palomar. This is an expository account of a classical theorem and an existing formal artifact, with no claim of mathematical novelty or formalization priority.

Primarily AI-generated textHuman understanding: some partsLean 4MathlibSeifert van Kampen theoremcategorical pushoutfundamental groupoidopen cover
Sep 30, 20268 pages
PDFView work