Supersoluble Skew Brace: Structure & Theory

• Supersoluble skew braces are algebraic structures with two group operations, characterized by finite ideal chains whose successive factors are prime order or infinite cyclic.
• They exhibit a refined Sylow tower structure and well-behaved Fitting ideals, facilitating algorithmic recognition and effective computational analysis.
• These braces generalize supersoluble groups, linking ideal theoretic properties to Yang–Baxter solutions and enabling advances in symmetry and cohomology methods.

Searching arXiv for the cited supersoluble skew brace papers and closely related results. Supersoluble skew braces form a class of skew braces defined by a finite ideal series with prime-order factors, together with an infinite-cyclic socle condition in the non-finite case, and studied as a brace-theoretic analogue of supersoluble groups. In the treatment of Ballester-Bolinches, Esteban-Romero, Ferrara, Pérez-Calabuig, and Trombetti, a brace $B$ is supersoluble when it admits a finite chain of ideals whose successive factors have prime order or are infinite cyclic and lie in the socle of the relevant quotient; this class encompasses all finite skew braces of square-free order, and within it several structural and algorithmic properties become easier to identify (Ballester-Bolinches et al., 2024). A later finite formulation, used in a preliminary Sylow-theoretic draft, declares a finite skew brace supersoluble when every non-trivial homomorphic image has an ideal of prime order, paralleling the corresponding group-theoretic definition (Caranti et al., 1 Jun 2025).

1. Definitions and notational frameworks

One standard convention describes a skew brace as a set $B$ endowed with two group structures, additive $(B,+)$ with identity $0$ and multiplicative $(B,\cdot)$ with the same identity, satisfying the skew-distributive law

$$x\cdot (y+z)=x\cdot y-x+(x\cdot z) \qquad \forall\,x,y,z\in B.$$

Associated to this structure is the map

$\lambda_x(y)=-x+x\cdot y\in \mathrm{Aut}(B,+),$

and the $\star$-product

$x\star y=\lambda_x(y)-y=-x+x\cdot y-y.$

If $I\lhd B$ is an ideal, the notation

$B$0

is used for the socle, and $B$1 denotes the $B$2th term of the upper central series (Ballester-Bolinches et al., 2024).

In this convention, a brace $B$3 is called supersoluble if there exists a finite chain of ideals

$B$4

such that for each $B$5, either $B$6 has prime order, or $B$7 is infinite cyclic and $B$8. Every prime-order factor is automatically trivial as a brace and hence abelian, so every supersoluble brace is, in particular, soluble.

A second convention, used for right skew braces, writes the two group laws as $B$9 and $(B,+)$0 with common identity $(B,+)$1, subject to

$(B,+)$2

The corresponding map

$(B,+)$3

is an automorphism of $(B,+)$4, and $(B,+)$5 is a group homomorphism. In this finite setting, a skew brace is called supersoluble if every non-trivial homomorphic image admits an ideal of prime order (Caranti et al., 1 Jun 2025).

2. Ideal series, Sylow towers, and finite structure

Finite supersoluble braces admit a strong refinement of their ideal structure. If $(B,+)$6 is finite supersoluble and $(B,+)$7 is the set of primes dividing $(B,+)$8, and if $(B,+)$9 is a Sylow $0$0-subgroup of the additive group $0$1, then there exists a permutation $0$2 such that

$0$3

is an ascending chain of ideals covering $0$4 in $0$5 steps. Moreover, each $0$6 lies in the socle of the quotient by the previous sums, and the primes occur in strictly descending order. The series can therefore be refined so that “large-prime” Sylows occur first (Ballester-Bolinches et al., 2024).

This Sylow-tower phenomenon is the brace analogue of a familiar group-theoretic feature of supersolubility, but here it is expressed in terms of ideal sums and additive Sylow subgroups. The result is not merely organizational: it provides a canonical way to detect large-scale brace structure prime by prime.

A direct corollary is that, in a finite supersoluble brace, the set of all odd-order elements $0$7 in $0$8 is an ideal. This isolates the odd-primary part of the additive group as an ideal-theoretic component rather than merely a subgroup, which is especially useful in later arguments on Fitting theory and index bounds.

3. Central nilpotency and the Fitting ideal

For ideals in a skew brace, central nilpotency has two related formulations. An ideal $0$9 is centrally nilpotent if it has a finite upper central series inside $(B,\cdot)$0. It is $(B,\cdot)$1-centrally-nilpotent if there is a finite chain of ideals

$(B,\cdot)$2

such that each successive quotient $(B,\cdot)$3 is centrally embedded in $(B,\cdot)$4. In general, one cannot sum two centrally nilpotent ideals and remain centrally nilpotent.

For finite supersoluble braces, this obstruction disappears. Every centrally nilpotent ideal is already $(B,\cdot)$5-centrally-nilpotent, and consequently the sum of all centrally nilpotent ideals of $(B,\cdot)$6 is again centrally nilpotent. This sum is the Fitting ideal, denoted $(B,\cdot)$7 (Ballester-Bolinches et al., 2024).

The significance of this result is computational as well as structural. The paper emphasizes that, in a supersoluble brace, a centrally nilpotent ideal is automatically $(B,\cdot)$8-centrally-nilpotent, and that this simplifies the computational search for the Fitting ideal. The usual instability of central nilpotency under sums is replaced by a controlled ideal-theoretic closure.

A further corollary states that, for any finite supersoluble brace $(B,\cdot)$9, $$x\cdot (y+z)=x\cdot y-x+(x\cdot z) \qquad \forall\,x,y,z\in B.$$0 has finite index in $$x\cdot (y+z)=x\cdot y-x+(x\cdot z) \qquad \forall\,x,y,z\in B.$$1. If, moreover, $$x\cdot (y+z)=x\cdot y-x+(x\cdot z) \qquad \forall\,x,y,z\in B.$$2 has no odd-torsion in $$x\cdot (y+z)=x\cdot y-x+(x\cdot z) \qquad \forall\,x,y,z\in B.$$3, then the index $$x\cdot (y+z)=x\cdot y-x+(x\cdot z) \qquad \forall\,x,y,z\in B.$$4 is a power of $$x\cdot (y+z)=x\cdot y-x+(x\cdot z) \qquad \forall\,x,y,z\in B.$$5. This identifies a precise residual obstruction to the Fitting ideal being the whole brace.

4. Multipermutation level and additive nilpotency

The interaction between supersolubility and Yang–Baxter-theoretic nilpotency is encoded through the multipermutational, or right-nilpotent, series

$$x\cdot (y+z)=x\cdot y-x+(x\cdot z) \qquad \forall\,x,y,z\in B.$$6

together with the upper socle series

$$x\cdot (y+z)=x\cdot y-x+(x\cdot z) \qquad \forall\,x,y,z\in B.$$7

A brace has finite multipermutation level exactly when $$x\cdot (y+z)=x\cdot y-x+(x\cdot z) \qquad \forall\,x,y,z\in B.$$8 for some finite $$x\cdot (y+z)=x\cdot y-x+(x\cdot z) \qquad \forall\,x,y,z\in B.$$9.

Within the class of supersoluble braces, there is a sharp criterion: $\lambda_x(y)=-x+x\cdot y\in \mathrm{Aut}(B,+),$0 Thus finite multipermutation level is not an automatic consequence of supersolubility alone; in this class, the decisive condition is nilpotency of the additive group (Ballester-Bolinches et al., 2024).

This equivalence is conceptually important because it connects an internal group-theoretic property of the additive structure to a brace-theoretic property closely tied to set-theoretic solutions of the Yang–Baxter equation. It also gives a practical test: once supersolubility is known, additive nilpotency and finite multipermutation level become interchangeable criteria.

5. Square-free order, almost-polycyclicity, and algorithmic recognition

A central existence theorem states that every finite brace of square-free order is supersoluble. The proof proceeds by using the fact that, when $\lambda_x(y)=-x+x\cdot y\in \mathrm{Aut}(B,+),$1 is square-free, both groups $\lambda_x(y)=-x+x\cdot y\in \mathrm{Aut}(B,+),$2 and $\lambda_x(y)=-x+x\cdot y\in \mathrm{Aut}(B,+),$3 have cyclic Sylow subgroups and hence are supersoluble as groups, after which one selects a top prime factor, finds an ideal of prime order, and argues inductively on the quotient (Ballester-Bolinches et al., 2024).

This theorem places square-free skew braces inside a substantially more rigid class. The paper gives concrete examples, noting that any bracket on $\lambda_x(y)=-x+x\cdot y\in \mathrm{Aut}(B,+),$4 or on $\lambda_x(y)=-x+x\cdot y\in \mathrm{Aut}(B,+),$5 defined via a suitable semidirect construction yields a brace of order $\lambda_x(y)=-x+x\cdot y\in \mathrm{Aut}(B,+),$6 which is automatically supersoluble.

Supersoluble braces are also examples of almost-polycyclic braces, defined as braces admitting a finite chain of ideals each of whose factors is either finite or finitely generated inside the socle. Several corollaries follow. Supersoluble braces are residually finite. In an almost-polycyclic brace $\lambda_x(y)=-x+x\cdot y\in \mathrm{Aut}(B,+),$7, supersolubility can be tested in finite homomorphic images: if all finite quotients are supersoluble, then $\lambda_x(y)=-x+x\cdot y\in \mathrm{Aut}(B,+),$8 is supersoluble. Every maximal subbrace of a supersoluble brace has prime index, any index-$\lambda_x(y)=-x+x\cdot y\in \mathrm{Aut}(B,+),$9 subbrace is automatically an ideal, and supersoluble braces admit a finite presentation and satisfy the maximal condition on subbraces.

These properties feed directly into algorithmics for Yang–Baxter theory. Let $\star$0 be the structure brace of a finite non-degenerate solution $\star$1 of the Yang–Baxter equation, given by a finite presentation

$\star$2

where $\star$3 is the free brace on a finite set $\star$4 and $\star$5 is finitely generated as an ideal. There is an explicit semi-decidable procedure which decides in finite time whether $\star$6 is supersoluble or not. One branch enumerates finite braces $\star$7 of increasing order and all homomorphisms $\star$8, stopping if a finite image is found that is not supersoluble. The parallel branch attempts to build a supersoluble chain in $\star$9 itself by searching for one-generator ideals $x\star y=\lambda_x(y)-y=-x+x\cdot y-y.$0 of prime order or lying in the socle of a quotient, passing recursively to quotients until a full chain is found. Because the structure brace of a finite solution of the Yang–Baxter equation is almost-polycyclic and residually finite, the structural and algorithmic results above apply to it; in particular, one obtains effectively the Sylow tower of $x\star y=\lambda_x(y)-y=-x+x\cdot y-y.$1, its Fitting ideal, and a decision procedure for whether $x\star y=\lambda_x(y)-y=-x+x\cdot y-y.$2 is a multipermutation solution by testing the nilpotency of $x\star y=\lambda_x(y)-y=-x+x\cdot y-y.$3 (Ballester-Bolinches et al., 2024).

6. Sylow sub-skew braces and later extensions

A 2025 preliminary draft by Caranti, Del Corso, Di Matteo, Ferrara, and Trombetti develops a genuine Sylow theory for finite supersoluble skew braces. In the right-skew-brace convention, a Sylow $x\star y=\lambda_x(y)-y=-x+x\cdot y-y.$4-sub-skew brace is a sub-skew brace $x\star y=\lambda_x(y)-y=-x+x\cdot y-y.$5 whose order is the largest power of $x\star y=\lambda_x(y)-y=-x+x\cdot y-y.$6 dividing $x\star y=\lambda_x(y)-y=-x+x\cdot y-y.$7, equivalently a subset that is simultaneously a Sylow $x\star y=\lambda_x(y)-y=-x+x\cdot y-y.$8-subgroup of $x\star y=\lambda_x(y)-y=-x+x\cdot y-y.$9 and of $I\lhd B$0. The main theorem states that if $I\lhd B$1 is a finite supersoluble skew brace and $I\lhd B$2 divides $I\lhd B$3, then $I\lhd B$4 contains a Sylow $I\lhd B$5-sub-skew brace (Caranti et al., 1 Jun 2025).

The proof is by induction on $I\lhd B$6 through a minimal-counterexample argument. One chooses an ideal $I\lhd B$7 of prime order $I\lhd B$8, passes to the quotient $I\lhd B$9, lifts Sylow sub-skew braces from the quotient, and reduces to the case $B$00 with $B$01 characteristic and $B$02 a Sylow $B$03-subgroup of $B$04, where $B$05. If $B$06 centralizes $B$07, then $B$08 is stabilized by $B$09 and hence is a sub-skew brace. Otherwise the argument uses Curran’s description of automorphisms of $B$10, the vanishing of $B$11 for coprime orders, and a duality proposition to show that $B$12 is again $B$13-invariant, so the sub-brace criterion applies.

This theorem has several immediate extensions. By essentially the same induction, finite supersoluble skew braces admit Hall $B$14-sub-skew braces for every set of primes $B$15. In addition, any left ideal of prime-power order in a finite supersoluble brace is contained in a Sylow sub-skew brace, and similarly for Hall sub-skew braces. Combined with the earlier theorem that every finite skew brace of square-free order is supersoluble, this yields the further consequence that every square-free skew brace has Sylow $B$16-sub-skew braces (Ballester-Bolinches et al., 2024).

The draft also records explicit examples. For the trivial brace on a finite supersoluble group $B$17, the theorem recovers the ordinary Sylow theorem for $B$18; the examples given include $B$19 and the semidirect product $B$20 of order $B$21. More exotic non-trivial skew braces of square-free order are described as following the same proof pattern: one reduces to a semidirect product by a minimal ideal of prime order and then uses cohomology-vanishing and a duality argument to force the Sylow subgroup to be a common subgroup of both brace structures (Caranti et al., 1 Jun 2025).