Subrack lattices of finite solvable and metacyclic groups

Sel\c{c}uk Kayacan

arxiv: 2503.06714 · v2 · submitted 2025-03-09 · 🧮 math.GR

Subrack lattices of finite solvable and metacyclic groups

Sel\c{c}uk Kayacan This is my paper

Pith reviewed 2026-05-23 00:18 UTC · model grok-4.3

classification 🧮 math.GR

keywords subrack latticesgroup rackssolvable groupsmetacyclic groupsderived lengthconjugation rackslattice invariants

0 comments

The pith

If two finite groups have isomorphic subrack lattices then they share solvability and derived length, and metacyclic groups force the center quotient to be metacyclic.

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

The paper studies the subrack lattice of a finite group under its conjugation rack operation. Building from the fact that this lattice already detects solvability, the work shows that the lattice also fixes the derived length when the group is solvable. For metacyclic groups the lattice forces the quotient by the center to remain metacyclic. The same analysis produces two finite groups whose subrack lattices coincide even though the groups are not isomorphic as racks, answering an earlier question.

Core claim

If G is a finite solvable group and H is any finite group whose subrack lattice is isomorphic to that of G, then H is solvable and has the same derived length as G. If G is finite metacyclic then any such H satisfies that H/Z(H) is metacyclic. There exist two finite groups with isomorphic subrack lattices that are nevertheless not isomorphic as racks.

What carries the argument

The subrack lattice of a group rack (the lattice of all subsets closed under conjugation), which encodes solvability, derived length, and metacyclicity of the center quotient.

If this is right

Solvability of a finite group is an invariant of its subrack lattice.
Derived length is likewise an invariant of the subrack lattice among finite solvable groups.
For finite metacyclic groups the property that the center quotient is metacyclic is determined by the subrack lattice.
The subrack lattice does not determine the underlying rack up to isomorphism in general.

Where Pith is reading between the lines

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

The lattice may encode further invariants such as nilpotency class in restricted classes of groups.
Similar lattice arguments could separate other families such as supersolvable or polycyclic groups.
The explicit counterexample to rack isomorphism suggests that lattice data alone is coarser than full rack structure.

Load-bearing premise

All groups under consideration are finite, and the lattice already determines solvability by an earlier theorem.

What would settle it

Exhibit a finite solvable group G together with a non-solvable finite group H whose subrack lattices are isomorphic.

read the original abstract

A group $G$ with conjugation operation is a rack. We call such racks \emph{group racks}. In this paper we study finite group racks via their subrack lattices. Heckenberger, Shareshian, and Welker proved that the isomorphism type of the subrack lattice of a finite group determines whether the group is solvable. Our first result shows that if $G$ is a finite solvable group and $H$ is a finite group whose subrack lattice is isomorphic to that of $G$, then $H$ is solvable and the derived length of $H$ has the same derived length as $G$. Our second result is that if $G$ is a finite metacyclic group and $H$ is a group whose subrack lattice is isomorphic to that of $G$, then $H/Z(H)$ is metacyclic. As a further application of our analysis of finite metacyclic groups, we answer a question of Heckenberger, Shareshian, and Welker in the affirmative by constructing two finite groups with isomorphic subrack lattices that are not isomorphic as racks.

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 extends the Heckenberger-Shareshian-Welker theorem by showing subrack lattices preserve derived length for solvable groups and metacyclicity of the central quotient for metacyclic groups, plus gives an explicit construction answering their open question.

read the letter

The main advance is the pair of theorems that lift the earlier solvability detection to derived length and to the metacyclic property of H/Z(H). The explicit construction of two finite groups with isomorphic subrack lattices but non-isomorphic racks directly settles the question left open in the cited work. Both results stay inside finite groups and use the lattice structure of conjugacy racks in a straightforward way. The derived-length claim follows from tracking how the lattice encodes successive commutator subgroups, and the metacyclic result uses the normal series that metacyclic groups possess. The construction supplies concrete examples rather than an existence argument, which makes the negative answer to uniqueness sharper. The paper is explicit about building on the prior theorem and does not introduce hidden parameters or circular definitions. The only real limitation is the restriction to finite groups, which is stated up front and matches the scope of the earlier result. No internal contradictions appear in the statements, and the logic chain from the HSW theorem looks direct. This is a narrow but clean incremental contribution in rack theory. Specialists tracking lattice invariants for groups will get direct use from the new preservation statements and the example. It is worth sending to peer review because the claims are precise, the construction is explicit, and the extension is logically grounded even if the proofs need checking in detail.

Referee Report

0 major / 2 minor

Summary. The paper studies subrack lattices arising from the conjugation rack structure on finite groups. Building on the Heckenberger-Shareshian-Welker theorem that the isomorphism type of the subrack lattice detects solvability, the authors prove two extensions: if G is finite solvable and H is any finite group with an isomorphic subrack lattice, then H is solvable with the same derived length; if G is finite metacyclic then any such H satisfies that H/Z(H) is metacyclic. They also construct two finite groups whose subrack lattices are isomorphic but whose conjugation racks are not isomorphic, answering a question of Heckenberger et al. in the affirmative.

Significance. If the proofs hold, the work supplies two new lattice-theoretic invariants (derived length for solvable groups and the metacyclic property of the central quotient) that refine the solvability detection result. The explicit counterexample to rack isomorphism shows that the lattice does not classify group racks up to isomorphism, which is useful for classification questions in rack theory.

minor comments (2)

[Introduction] The abstract states the main theorems clearly; the body should include explicit statements of the two new theorems (with numbering) immediately after the introduction of the Heckenberger-Shareshian-Welker result so that the logical dependence is transparent.
Notation for the subrack lattice (e.g., L(G) or SubRack(G)) should be fixed at the first use and used consistently; the current text alternates between descriptive phrases and symbols.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive summary of our work and for recommending minor revision. No specific major comments were provided in the report, so we have no points to address point-by-point. We are happy to make any minor editorial changes requested by the editor or production.

Circularity Check

0 steps flagged

No significant circularity; derivation self-contained

full rationale

The paper invokes the external Heckenberger-Shareshian-Welker theorem (distinct authors) solely as a starting point for solvability detection from subrack lattices, then derives new independent claims on derived-length preservation for solvable groups and metacyclic quotients for metacyclic groups via lattice-theoretic arguments on conjugacy racks. The affirmative answer to the HSW question is supplied by an explicit construction of two non-isomorphic finite groups with isomorphic lattices. No self-citation load-bearing, self-definitional reductions, fitted-input predictions, or ansatz smuggling occurs; all load-bearing steps rest on external prior results or direct lattice analysis without circular reduction to the paper's own inputs.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The claims rest on standard definitions of group racks via conjugation and of subrack lattices, plus the cited theorem of Heckenberger et al.; no free parameters, invented entities, or ad-hoc axioms are introduced in the abstract.

axioms (2)

domain assumption A group equipped with its conjugation operation forms a rack whose subracks are the subsets closed under the operation.
This is the foundational definition used throughout the abstract.
domain assumption The subrack lattice is the poset of all subracks ordered by inclusion.
Standard definition invoked when stating the isomorphism type determines group properties.

pith-pipeline@v0.9.0 · 5719 in / 1219 out tokens · 89015 ms · 2026-05-23T00:18:08.181464+00:00 · methodology

Subrack lattices of finite solvable and metacyclic groups

Core claim

What carries the argument

If this is right

Where Pith is reading between the lines

Load-bearing premise

What would settle it

discussion (0)