pith. machine review for the scientific record. sign in

arxiv: 2605.12672 · v1 · submitted 2026-05-12 · 🧮 math.RA · math.CO

Recognition: 2 theorem links

· Lean Theorem

Expander Evolution Algebras

Piero Giacomelli
Authors on Pith no claims yet

Pith reviewed 2026-05-14 20:06 UTC · model grok-4.3

classification 🧮 math.RA math.CO MSC 17A6005C48
keywords expander evolution algebrasRamanujan evolution algebrasCheeger constantAlon-Boppana boundevolution operatornonassociative algebrasCayley graphsspectral gap
0
0 comments X

The pith

Expander evolution algebras connect Cheeger graph expansion to algebraic connectivity and achieve the sharp Alon-Boppana eigenvalue bound over the complex numbers.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper defines expander evolution algebras as those whose underlying undirected loopless graph, in the Kowalski sense, is a Cheeger expander. It builds a dictionary showing that the Cheeger constant of this graph governs the algebra's connectivity, its subalgebra lattice, sequence growth, and the spectral gap of its evolution operator. Over the complex numbers the construction yields the sharp Alon-Boppana lower bound on the second eigenvalue, which prompts the definition of Ramanujan evolution algebras as the optimal expanders in this class. Families are built from Cayley graphs of finite groups, and basic structural theorems establish that all such algebras are connected and simple with no large proper evolution subalgebras.

Core claim

An evolution algebra is an expander evolution algebra when its associated undirected loopless graph is a Cheeger expander; this forces the algebra to be connected and simple, eliminates proper large evolution subalgebras, makes every generator of a symmetric EEA algebraically persistent, and, over C, forces the second eigenvalue of the evolution operator to satisfy the sharp Alon-Boppana bound, with equality defining the Ramanujan case.

What carries the argument

The Cheeger constant of the Kowalski graph of the evolution algebra, which directly controls connectivity, subalgebra growth, and the spectral gap of the evolution operator.

If this is right

  • Every EEA is connected and simple as an evolution algebra.
  • EEAs contain no proper large evolution subalgebras.
  • Every generator of a symmetric EEA is algebraically persistent.
  • Over C the second eigenvalue of the evolution operator meets the sharp Alon-Boppana lower bound.
  • Ramanujan evolution algebras are those attaining the optimal expansion bound.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same dictionary may let combinatorial expansion results be imported into the classification of nonassociative algebras.
  • Cayley-graph constructions suggest that group-theoretic expanders can be systematically turned into algebraic examples.
  • The open problems listed at the end likely concern classification and field-dependent extensions of the Ramanujan property.

Load-bearing premise

The underlying undirected loopless graph of the algebra in the Kowalski sense must be an expander graph in the classical Cheeger sense.

What would settle it

An explicit evolution algebra whose graph satisfies the Cheeger expander condition yet whose evolution operator over C has second eigenvalue strictly below the Alon-Boppana threshold.

read the original abstract

We introduce \emph{expander evolution algebras} (EEAs), a class of nonassociative algebras defined over an arbitrary field $\K$ in which the underlying undirected loopless graph of the algebra -- in the sense of Kowalski -- is an expander graph in the classical sense of Cheeger. Starting from the formal graph definition of Kowalski and the algebraic framework of Tian, we establish a dictionary between combinatorial expansion and algebraic structure: the Cheeger constant of the associated graph governs connectivity, the subalgebra lattice, the growth of the evolution sequence, and -- over $\R$ and $\C$ -- the spectral gap of the evolution operator. Over a general field $\K$ we prove that EEAs are always connected and simple (as evolution algebras), carry no proper large evolution subalgebras, and that every generator of a \emph{symmetric} EEA is algebraically persistent. Over $\C$ we obtain the sharp Alon--Boppana lower bound for the second eigenvalue of the evolution operator, leading to the definition of \emph{Ramanujan evolution algebras} as optimal expanders. We also construct families of EEAs from Cayley graphs of finite groups. We close with open problems.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper introduces expander evolution algebras (EEAs) as evolution algebras over an arbitrary field K whose associated Kowalski undirected loopless graph is a Cheeger expander. It establishes a dictionary relating the Cheeger constant to algebraic properties including connectedness, simplicity, the subalgebra lattice, evolution sequence growth, and (over R and C) the spectral gap of the evolution operator. Over C the manuscript derives the sharp Alon-Boppana lower bound on the second eigenvalue, thereby defining Ramanujan evolution algebras as optimal expanders, and supplies explicit constructions from Cayley graphs of finite groups together with a list of open problems.

Significance. If the central claims hold, the work creates a concrete bridge between classical expander-graph theory and the algebraic theory of evolution algebras, supplying algebraic interpretations of combinatorial expansion and a new notion of Ramanujan-type optimality in the nonassociative setting. The Cayley-graph constructions furnish an infinite family of concrete examples that could support further investigation of spectral and structural properties.

major comments (2)
  1. [Definition of EEAs and the Alon-Boppana result over C] The definition of EEAs (stated in the introduction and used throughout) requires only that the Kowalski graph have positive Cheeger constant h(G) > 0 and does not impose d-regularity. The claimed sharp Alon-Boppana lower bound on the second eigenvalue of the evolution operator (over C, leading to the definition of Ramanujan EEAs) is classically stated only for d-regular graphs. The manuscript must either restrict the definition to regular graphs or supply an explicit justification that the bound transfers to the non-regular case via the evolution-operator matrix; otherwise the spectral-gap dictionary fails to support the optimality claim.
  2. [Statements on connectedness, simplicity, and subalgebra lattice] The assertions that every EEA is connected and simple as an evolution algebra, and that symmetric EEAs have algebraically persistent generators (over general K), are load-bearing for the claimed dictionary. The manuscript should provide the precise argument showing how positivity of the Cheeger constant implies the absence of proper large evolution subalgebras; a brief outline or key lemma reference is needed to confirm the implication is not circular.
minor comments (2)
  1. [Notation and preliminaries] Notation for the evolution operator and its matrix representation should be introduced once and used consistently; the transition from the structure constants to the adjacency matrix of the Kowalski graph is not immediately transparent on first reading.
  2. [Open problems] The open-problems section lists several questions; at least one should be accompanied by a brief indication of why it is expected to be tractable within the EEA framework.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive suggestions. The comments highlight important points on regularity and proof clarity that we can address directly. We respond point by point below.

read point-by-point responses

  1. Referee: The definition of EEAs (stated in the introduction and used throughout) requires only that the Kowalski graph have positive Cheeger constant h(G) > 0 and does not impose d-regularity. The claimed sharp Alon-Boppana lower bound on the second eigenvalue of the evolution operator (over C, leading to the definition of Ramanujan EEAs) is classically stated only for d-regular graphs. The manuscript must either restrict the definition to regular graphs or supply an explicit justification that the bound transfers to the non-regular case via the evolution-operator matrix; otherwise the spectral-gap dictionary fails to support the optimality claim.

    Authors: We agree that the classical sharp Alon-Boppana bound is stated for d-regular graphs. To keep the Ramanujan evolution algebra definition and the spectral-gap dictionary on firm ground, we will revise the definition of EEAs to require that the associated Kowalski graph is d-regular for a fixed d. All subsequent statements, including the constructions from Cayley graphs (which are already regular) and the optimality claim over C, will be updated to this regular setting. This change preserves the combinatorial-algebraic dictionary while aligning with the standard hypotheses of the cited spectral results. revision: yes

  2. Referee: The assertions that every EEA is connected and simple as an evolution algebra, and that symmetric EEAs have algebraically persistent generators (over general K), are load-bearing for the claimed dictionary. The manuscript should provide the precise argument showing how positivity of the Cheeger constant implies the absence of proper large evolution subalgebras; a brief outline or key lemma reference is needed to confirm the implication is not circular.

    Authors: We will add a concise outline immediately after the definition of EEAs. The argument proceeds by contradiction: suppose V is a proper evolution subalgebra. Its support set S induces a cut in the Kowalski graph whose boundary size is controlled by the evolution operator applied to the characteristic vector of S. Positivity of the Cheeger constant h(G) then yields a lower bound on the normalized cut size, contradicting the assumption that the subalgebra is proper and large. This uses only the definition of h(G) and the matrix representation of the evolution operator; it is not circular. The full proof remains in Section 3, but the outline will make the logical flow explicit. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation transfers known expander results via external frameworks

full rationale

The paper defines expander evolution algebras by requiring the Kowalski underlying undirected loopless graph to be a Cheeger expander, then derives algebraic consequences (connectivity, simplicity, subalgebra lattice, growth, spectral gap) from this assumption using Tian's evolution algebra structure. The Alon-Boppana bound is applied as a standard external result once the graph is expander, not derived by fitting or redefinition inside the paper. Constructions from Cayley graphs are regular and serve as examples rather than load-bearing inputs. No self-citations appear; all load-bearing steps rest on independent prior formalisms (Kowalski, Tian) and classical graph theory, making the chain self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 2 invented entities

The work rests on the standard definition of evolution algebras and the classical definition of expander graphs; no free parameters are introduced and no new entities beyond the named class are postulated.

axioms (2)
  • domain assumption Evolution algebras are defined via a basis and structure constants satisfying the evolution property as in Tian's framework.
    Invoked when associating the undirected graph to the algebra.
  • standard math Expander graphs are undirected loopless graphs with positive Cheeger constant as in classical spectral graph theory.
    Central assumption used to define the new class.
invented entities (2)
  • Expander evolution algebra no independent evidence
    purpose: Algebra whose associated graph is an expander, enabling the claimed dictionary.
    Newly introduced class; no independent evidence outside the definition is given.
  • Ramanujan evolution algebra no independent evidence
    purpose: Optimal expander achieving the Alon-Boppana bound.
    Defined as the extremal case; no separate existence proof or construction beyond the general family is supplied in the abstract.

pith-pipeline@v0.9.0 · 5499 in / 1399 out tokens · 49489 ms · 2026-05-14T20:06:23.788184+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

15 extracted references · 5 canonical work pages · 5 internal anchors

  1. [1]

    Alon and V.D

    N. Alon and V.D. Milman, λ1, isoperimetric inequalities for graphs, and superconcentrators,J. Combin. Theory Ser. B38(1985), no. 1, 73–88

    1985

  2. [2]

    Bourgain and A

    J. Bourgain and A. Gamburd, Uniform expansion bounds for Cayley graphs of SL2(Fp),Ann. of Math. (2)167(2008), no. 2, 625–642

    2008

  3. [3]

    On the connection between evolution algebras, random walks and graphs

    P. Cadavid, M.L. Rodi˜ no Montoya, and P.M. Rodr´ ıguez, On the connection between evolution algebras, random walks and graphs,J. Algebra Appl.19 (2020), no. 2, 2050023 (23 pp.).arXiv:1707.05897

    work page internal anchor Pith review Pith/arXiv arXiv 2020

  4. [4]

    Some properties of evolution algebras

    L.M. Camacho, J.R. G´ omez, B.A. Omirov, and R.M. Turdibaev, Some proper- ties of evolution algebras,Bull. Korean Math. Soc.50(2013), no. 5, 1567–1586. arXiv:1004.1987

    work page internal anchor Pith review Pith/arXiv arXiv 2013

  5. [5]

    On evolution algebras

    J.M. Casas, M. Ladra, B.A. Omirov, and U.A. Rozikov, On evolution algebras, Algebra Colloq.21(2014), no. 2, 331–342.arXiv:1004.1050

    work page internal anchor Pith review Pith/arXiv arXiv 2014

  6. [6]

    Evolution algebras and graphs

    A. Elduque and A. Labra, Evolution algebras and graphs,J. Algebra Appl.14 (2015), no. 7, 1550103 (10 pp.).arXiv:1312.4685

    work page internal anchor Pith review Pith/arXiv arXiv 2015

  7. [7]

    Evolution algebras, automorphisms, and graphs

    A. Elduque and A. Labra, Evolution algebras, automorphisms, and graphs, Linear Multilinear Algebra69(2021), no. 2, 1–14.arXiv:1902.02191

    work page internal anchor Pith review Pith/arXiv arXiv 2021

  8. [8]

    Kowalski,An Introduction to Expander Graphs, Cours Sp´ ecialis´ es, Vol

    E. Kowalski,An Introduction to Expander Graphs, Cours Sp´ ecialis´ es, Vol. 26, Soci´ et´ e Math´ ematique de France, Paris, 2019

    2019

  9. [9]

    Lubotzky, R

    A. Lubotzky, R. Phillips, and P. Sarnak, Ramanujan graphs,Combinatorica8 (1988), no. 3, 261–277

    1988

  10. [10]

    Lubotzky, Ramanujan complexes and high dimensional expanders,Jpn

    A. Lubotzky, Ramanujan complexes and high dimensional expanders,Jpn. J. Math.9(2014), no. 2, 137–169

    2014

  11. [11]

    Marcus, D.A

    A.W. Marcus, D.A. Spielman, and N. Srivastava, Interlacing families II: Mixed characteristic polynomials and the Kadison–Singer problem,Ann. of Math. (2) 182(2015), no. 1, 327–350

    2015

  12. [12]

    Nilli, On the second eigenvalue of a graph,Discrete Math.91(1991), no

    A. Nilli, On the second eigenvalue of a graph,Discrete Math.91(1991), no. 2, 207–210

    1991

  13. [13]

    Pinsker, On the complexity of a concentrator, in:7th International Teletraffic Conference, Stockholm, 1973, pp

    M.S. Pinsker, On the complexity of a concentrator, in:7th International Teletraffic Conference, Stockholm, 1973, pp. 318/1–318/4

    1973

  14. [14]

    Tian,Evolution Algebras and Their Applications, Lecture Notes in Mathe- matics, Vol

    J.P. Tian,Evolution Algebras and Their Applications, Lecture Notes in Mathe- matics, Vol. 1921, Springer-Verlag, Berlin, 2008

    1921

  15. [15]

    Tian and P

    J.P. Tian and P. Vojtechovsky, Mathematical concepts of evolution algebras in non-Mendelian genetics,Quasigroups Related Systems14(2006), no. 1, 111–122. 24 PIERO GIACOMELLI IT Department, Tenax Group, Via I Maggio, 226, 37020 Volargne (VR), Italy Email address:pgiacome@gmail.com URL:https://github.com/PieroGiacomelli

    2006