arxiv: 2605.14095 · v1 · submitted 2026-05-13 · 🧮 math.GR

Recognition: 2 theorem links

· Lean Theorem

The category of centralizer lattices of groups

William Cocke , Mark L. Lewis , Ryan McCulloch

Authors on Pith no claims yet

Pith reviewed 2026-05-15 02:12 UTC · model grok-4.3

classification 🧮 math.GR

keywords centralizerlatticehomomorphismcategorygroupequivariantsubgroupfunctor

0 comments

The pith

Centralizer-respecting homomorphisms form a category that maps via functor to centralizer lattices of groups.

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

The paper defines centralizer-respecting homomorphisms as surjective group homomorphisms that are equivariant with respect to taking centralizers of subgroups. It shows that these maps form a category closed under composition. A functor is constructed from this category to the category of centralizer lattices, sending each group to its lattice of centralizers and each respecting homomorphism to an induced lattice map. This gives a categorical way to compare groups while preserving centralizer relations. A sympathetic reader would care because it turns centralizer lattices into functorial objects attached to a restricted class of group maps.

Core claim

Centralizer-respecting homomorphisms are defined as surjective group homomorphisms φ: G → H satisfying φ(C_G(K)) = C_H(φ(K)) for every subgroup K of G. These maps form a category under composition. There is a functor from this category to the category of centralizer lattices that assigns to each group its lattice of centralizers and to each respecting homomorphism the induced map on those lattices. Theorems are given showing that the category contains many interesting maps between groups.

What carries the argument

Centralizer-respecting homomorphism: a surjective group homomorphism equivariant under the centralizer operation on subgroups, i.e., it sends C_G(K) to C_H(φ(K)) for every K, and this property is used to define the functor to centralizer lattices.

If this is right

The composition of any two centralizer-respecting homomorphisms is again centralizer-respecting.
The identity map on any group is centralizer-respecting.
The functor sends groups to their centralizer lattices and respecting homomorphisms to lattice homomorphisms.
Theorems establish the existence of many nontrivial centralizer-respecting homomorphisms between concrete groups.
Centralizer lattices become functorial invariants under this restricted class of surjective maps.

Where Pith is reading between the lines

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

The functor might be used to detect when two groups have isomorphic centralizer lattices by checking for chains of respecting homomorphisms.
Similar equivariance conditions could be defined for other operations such as normalizers to produce parallel functors.
One could test whether the category admits limits or colimits that correspond to direct products or free products of groups.
The construction might extend to infinite groups or to other algebraic categories by replacing surjectivity with a suitable condition.

Load-bearing premise

The definition of centralizer-respecting homomorphism produces a collection of maps that is closed under composition and interacts with the centralizer operation to yield a well-defined functor to the centralizer lattices.

What would settle it

An explicit pair of surjective homomorphisms, each satisfying the centralizer equivariance condition, whose composition fails to map some centralizer of a subgroup to the corresponding centralizer in the final target group.

Figures

Figures reproduced from arXiv: 2605.14095 by Mark L. Lewis, Ryan McCulloch, William Cocke.

**Figure 1.** Figure 1: Diagram showing that Cϕ preserves intersections. Proof of Theorem A. The centralizer lattice is generated by the centralizer operator and either meet or joins. Hence to show that Cϕ is a homomorphism of centralizers lattices, we must show that Cϕ(CG(⋅)) = CH(Cϕ(⋅)) and that Cϕ respects either meets of joins. For any X ≤ G we have Cϕ(CG(CG(X)) = ϕ(CG(CG(X))) = CH(ϕ(CG(X))) = CH(Cϕ(CG(X))), and conclude that… view at source ↗

**Figure 2.** Figure 2: The commutative diagram showing that C is a functor from Groupscrh to CentLattices. Since ϕ is surjective, we can select a B ≤ G such that ϕ(B) = A. Then we obtain CK(ψ ○ ϕ(B)) = (ψ ○ ϕ)(CG(B)) = ψ(CH(ϕ(B))) = ψ(CH(A)). CK(ψ ○ ϕ(B)) = CK(ψ(ϕ(B))) = CK(ψ(A)). Contradicting the assumptions that ψ is not centralizer-respecting. ⇐ The composition of centralizer-respecting homomorphisms is centralizer-respectin… view at source ↗

**Figure 3.** Figure 3: Diagram of the subgroup lattice of the group G = Z4 ⋊Z4 where the action is by inversion. We can also write G = ⟨x, y ∣ x 4 = y 4 = 1, xy = x −1 ⟩, the subgroup lattice of G/K where K = ⟨x 2y 2 ⟩, and the centralizer lattice of G and G/K are shown via the boxed subgroups of the respective lattices. The map ϕ ∶ G → G/K given by taking the quotient is centralizer-respecting and thus we have an induced map Cϕ… view at source ↗

read the original abstract

We formalize the concept of a centralizer-respecting homomorphism, surjective homomorphisms which are equivariant with respect to taking the centralizer of a subgroup. There is a functor from the category of centralizer-respecting homomorphisms to the category of centralizer lattices. Finally, we conclude with some theorems about centralizer-respecting homomorphisms that show that the category of centralizer-respecting homomorphisms has many interesting maps.

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.

Desk Editor's Note private letter to a colleague

The paper defines centralizer-respecting homomorphisms and builds a functor to the category of centralizer lattices, a clean but modest reorganization of standard group theory ideas.

read the letter

The core contribution is the definition of centralizer-respecting homomorphisms—surjective group homomorphisms that commute with taking centralizers of subgroups—together with a functor from that category into the category of centralizer lattices. The paper closes with theorems showing the new category has many morphisms. This gives a systematic way to track how homomorphisms act on centralizer data, which is a natural categorical move once you decide to treat centralizers as the main object. The construction looks formally coherent: the equivariance condition ensures the induced map on lattices is well-defined and preserves the lattice operations, and functoriality follows from the usual composition rules for homomorphisms. No internal contradictions show up in the setup. Centralizers are basic in group theory, so the main value is the packaging rather than a breakthrough result. The theorems on the category being rich in maps are useful for specialists but read as direct consequences of the definition rather than deep new facts. Without explicit comparisons to earlier work on subgroup lattices or categorical treatments of centralizers, it is hard to gauge how much overlap exists. This is aimed at group theorists who already care about subgroup structures and categorical language, especially those working with finite or solvable groups. A reader focused on centralizers or lattice methods might pick up a useful viewpoint, but most group theorists will not need it. I would send it to peer review so referees can check the proofs and see whether the theorems add enough substance to justify publication.

Referee Report

0 major / 3 minor

Summary. The paper defines centralizer-respecting homomorphisms as surjective group homomorphisms that are equivariant with respect to the centralizer operation on subgroups. It asserts the existence of a functor from the category of these homomorphisms to the category of centralizer lattices and concludes with theorems showing that this category contains many interesting maps.

Significance. If the functor is well-defined, this provides a categorical framework linking equivariant group homomorphisms to lattice structures on centralizers. Such a construction could facilitate the study of subgroup lattices and their functorial properties in group theory, particularly if the concluding theorems identify concrete classes of morphisms that preserve or reflect centralizer data.

minor comments (3)

The abstract states the functor exists but does not indicate where the verification that the induced map on centralizer lattices preserves the lattice operations (meets and joins) is carried out; adding a sentence or reference to the relevant proposition would improve readability.
Clarify the precise definition of the centralizer lattice (e.g., whether it is the lattice of all centralizers ordered by inclusion, or the sublattice generated by them) in the opening paragraphs, as this choice affects what the functor is required to preserve.
The concluding theorems are described only at a high level; stating one or two of their precise conclusions (e.g., closure under certain constructions or existence of non-trivial morphisms) would help readers assess the richness of the category without reading the full proofs.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive assessment of our work and the recommendation of minor revision. The report correctly identifies the core contributions: the definition of centralizer-respecting homomorphisms, the functor to the category of centralizer lattices, and the concluding theorems on the abundance of such maps. No specific major comments were provided in the report, so we have used the opportunity to perform a light editorial pass for improved readability and consistency of notation.

Circularity Check

0 steps flagged

No significant circularity; construction is definitional and self-contained

full rationale

The paper defines centralizer-respecting homomorphisms as surjective group homomorphisms equivariant under the centralizer operation and asserts the existence of a functor to the category of centralizer lattices. This is a direct formalization: the functor is induced by the equivariance condition built into the definition of the morphisms, with no fitted parameters, no self-referential equations, and no load-bearing self-citations that reduce the central claim to its inputs. The subsequent theorems about the category follow from the same definitional setup without circular reduction. The derivation chain is therefore self-contained as a category-theoretic construction.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The work relies on standard group axioms and category theory definitions; no free parameters, ad-hoc axioms, or invented entities are introduced beyond the new homomorphism concept.

axioms (1)

standard math Axioms of group theory and category theory
Centralizers, homomorphisms, and functors are defined using the standard axioms of groups and categories.

pith-pipeline@v0.9.0 · 5355 in / 1139 out tokens · 67070 ms · 2026-05-15T02:12:42.309329+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

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

IndisputableMonolith/Foundation/AbsoluteFloorClosure.lean absolute_floor_iff_bare_distinguishability unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

Definition 1.1 (centralizer-respecting homomorphisms). A surjective group homomorphism ϕ:G→H is centralizer-respecting if for subgroups A≤G we have ϕ(CG(A))=CH(ϕ(A)).
IndisputableMonolith/Foundation/ArithmeticFromLogic.lean LogicNat ≃ Nat recovery unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

Theorem B. The map C where C(G)=C(G) and C(ϕ)=Cϕ is a functor from Groups_crh to CentLattices.

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

9 extracted references · 9 canonical work pages

[1]

1994 , publisher=

Subgroup lattices of groups , author=. 1994 , publisher=

work page 1994
[2]

2012 , publisher=

Structure of a group and the structure of its lattice of subgroups , author=. 2012 , publisher=

work page 2012
[3]

Exploring the

Wilcox, Elizabeth , journal=. Exploring the. 2016 , publisher=

work page 2016
[4]

Finite groups with few subgroups not in the

Lu, Jiakuan and Huang, Xi and Lian, Qinwei and Meng, Wei , journal=. Finite groups with few subgroups not in the. 2026 , publisher=

work page 2026
[5]

Bulletin of the Australian Mathematical Society , author=

A subgroup lattice of a finite soluble group , DOI=. Bulletin of the Australian Mathematical Society , author=. 2026 , pages=

work page 2026
[6]

2010 , publisher=

Category theory , author=. 2010 , publisher=

work page 2010
[7]

Algebra and Logic , volume=

Groups whose lattice of centralizers is a sublattice of the subgroup lattice , author=. Algebra and Logic , volume=. 1994 , publisher=

work page 1994
[8]

International Journal of Group Theory , volume=

A group with exactly one noncommutator , author=. International Journal of Group Theory , volume=

work page
[9]

arXiv preprint arXiv:2509.17587 , year=

On finite groups with exactly one noncommutator , author=. arXiv preprint arXiv:2509.17587 , year=

work page arXiv