The higher congruence characterization for finite simple groups of Lie type
Let be a finite simple group of Lie type, let be a prime different from the defining characteristic of , and let be a positive integer. For elements , write for the prime-power relation from Definition of the source, and call an irreducible character of unramified as in the source. Higher congruence characterization. The congruence
for all unramified should hold if and only if . This proposes that, for finite simple groups of Lie type in non-defining characteristic, the relation fully characterizes the indicated higher congruences in the character table. The surrounding discussion presents this as a conjectural extension of the symmetric-group result, motivated by limited calculations; the source gives no resolution.
References
Primary source
Nate Harman and Joshua Mundinger, “Higher Congruences in Character Tables”, arXiv:2402.02312 (2026).
Progress summary
An unverified submission claims an infinite family of counterexamples, but no independent source has confirmed that the conjecture is false.
Harman and Mundinger proposed the characterization in 2024 as a converse to their general congruence theorem, for finite simple groups of Lie type in non-defining characteristic.
Known results
- Harman and Mundinger, 2024: implies for every unramified character.
- Harman and Mundinger, 2024: the converse holds for all characters of symmetric groups.
- Harman and Mundinger, 2024: the converse fails for some finite groups, including a Heisenberg-group example.
August 30, 2026 type- counterexample claim
A submitted argument claims that for every , with and contains nonconjugate involutions and such that for every character, while . If correct, this would disprove the converse in an infinite family; the argument is unverified.
Current status (as of August 2026): the forward implication and symmetric-group case are established, while the finite-simple-groups-of-Lie-type converse remains open because the August 30, 2026 counterexample submission is unverified.
Sources
- arxiv.org
- arxiv.org
- old.math.nsc.ru
- imo.universite-paris-saclay.fr
- mathoverflow.net
- arxiv.org
- experts.arizona.edu
- sciopen.com
- community.openai.com
- www-cdn.anthropic.com
- arxiv.org
- arxiv.org
- arxiv.org
- arxiv.org
- mathstodon.xyz
- mathstodon.xyz
- mathstodon.xyz
- mathstodon.xyz
- mathstodon.xyz
- web.math.ovgu.de
- math.stackexchange.com
- gmcninch.math.tufts.edu
- mathstodon.xyz
Solutions 1
CounterexampleThis solution needs a summarySee full solution
title: "The Higher Congruence Characterization for Finite Simple Groups of Lie Type: A Uniform Counterexample in Type D" author: "Rejnaldo Narkaj" date: "30 August 2026" geometry: margin=1in fontsize: 11pt papersize: a4 header-includes:
| \usepackage{amsmath,amssymb,amsthm,mathtools}
| \usepackage{microtype}
| \usepackage{enumitem}
| \usepackage{booktabs}
| \usepackage{hyperref}
Abstract
Harman and Mundinger introduced, for a finite group , a prime , and an integer , an equivalence relation generated by ordinary conjugacy and prime-power moves
They proved that implies congruence modulo for every character unramified at , and conjectured the converse for finite simple groups of Lie type in non-defining characteristic. The conjecture is indexed by MathDB under the title The higher congruence characterization for finite simple groups of Lie type.
We give a uniform counterexample family in type . For every , set
Inside the monomial subgroup
we construct two explicit involutions and . A complete little-group calculation proves the stronger congruence
for every ordinary complex character of . On the monomial subgroup the modulus is sharp. Independently, an elementary semisimple-eigenvalue argument proves that every -element of has order dividing ; hence every nonconjugacy generator in is trivial. Finally, explicit lifts of and to the split spin group have distinct central squares and , which proves that the two involutions are not conjugate. Thus although all unramified character values are congruent modulo . This disproves the conjectural reverse implication for an infinite family of finite simple groups of Lie type.
- Introduction
Let be a finite group, let be a prime dividing , and let . Harman and Mundinger [1] study higher congruences between columns of the unramified character table. The equivalence relation relevant here is generated by conjugacy together with the moves
Their theorem gives the implication
for every character unramified at . Their Conjecture 5.3 proposes the converse for finite simple groups of Lie type when is different from the defining characteristic. A public problem-index entry appears in MathDB [4] under the title used in the title of the present paper.
We prove that the converse fails uniformly. Put
and consider
The standard simplicity theorem for finite orthogonal groups implies that is a finite simple group of Lie type . Its defining characteristic is , whereas throughout the proof
Thus the examples lie exactly in the non-defining-characteristic range of the conjecture.
The proof has four logically independent ingredients.
A monomial subgroup
embeds in and contains two explicit projective involutions .
Clifford theory for the elementary abelian normal subgroup of gives
Restriction transports this congruence to every ordinary character of .
Every -element of has order dividing . Hence all prime-power moves occurring in are identities.
Explicit spin lifts of and have squares and ; since these central elements are distinct, the two projective involutions are not conjugate.
The proof is self-contained apart from standard structural facts about finite orthogonal and spin groups and the standard little-group form of Clifford theory; references are given in [2,3]. In particular, no maximal-subgroup classification, character table, table of marks, or computer algebra calculation is used.
- The Harman-Mundinger relation
Definition 2.1. Fix a finite group , a prime , and an integer . The relation is the equivalence relation generated by ordinary conjugacy and by
Conjecture 2.2 (Harman-Mundinger [1], Conjecture 5.3: higher congruence characterization for finite simple groups of Lie type). Let be a finite simple group of Lie type, let be different from the defining characteristic, and let . For , the congruence
for every character unramified at should hold if and only if
The forward implication is a theorem of Harman and Mundinger [1]. The only statement challenged here is the conjectural reverse implication. Because our argument proves the congruence for every ordinary complex character, no further structural property of the unramified character ring is needed below.
For the elements used below there is no auxiliary ambiguity coming from odd power maps: and are involutions, and hence
for every odd integer .
- The split orthogonal model and its monomial subgroup
Fix and retain the notation , . Let
with quadratic form
For a nondegenerate quadratic form in even dimension over a finite field of odd order, the plus/minus type is determined by the square class of . Here and is even, so is a square. Thus (3.1) is of plus type; we work inside .
Define
E=\left{v=(v_1,\ldots,v_N)\in\mathbb F_2^N:\sum_{i=1}^N v_i=0\right}, \qquad z=(1,\ldots,1). \tag{3.2}Since is even, . For set
The alternating group acts on by coordinate permutations.
Lemma 3.1. The signed permutation group is contained in .
Proof. A sign change in a single coordinate is the orthogonal reflection in the corresponding norm-one coordinate vector. Hence with is a product of an even number of reflections of spinor norm . Therefore has determinant and trivial spinor norm, so .
A coordinate transposition is the orthogonal reflection in a vector proportional to , whose norm has square class in . Every element of is a product of an even number of coordinate transpositions. Hence its determinant is and its spinor norm is a square. Thus . The two subgroups normalize one another in the evident way, proving the claim.
Proposition 3.2. Projectivization induces an embedding
and
Proof. In the signed permutation group, a scalar matrix must have trivial permutation part: a nontrivial permutation matrix has an off-diagonal nonzero entry and cannot be scalar. Thus a scalar signed permutation is diagonal. The only scalar diagonal sign matrices are
Consequently the kernel introduced by projectivization is exactly in the sign subgroup. Since , the quotient has dimension , which gives (3.5).
- Two projective involutions
Relabel the coordinate basis as
Set
Since is even, .
Inside define
Both vectors have even weight. Moreover
so
Likewise
and hence
which again gives
Let denote the classes in
and define
Lemma 4.1. The elements and are involutions.
Proof. In the semidirect product ,
Since and (4.3)-(4.4) give , whose class in is zero,
Equivalently, the corresponding signed permutation matrices in square to , and therefore their projective images have order .
- Spin lifts and the nonconjugacy invariant
We now prove that the two involutions are not conjugate in . This section spells out the Clifford-algebra calculation explicitly, including the identification of the constructed spin elements with the signed permutations in (4.5).
5.1. Clifford conventions
Work in the Clifford algebra , with the chosen orthogonal unit basis. For each put
The Clifford relations give
and therefore
For , moving the two factors of past the two factors of produces four sign changes, so
Clifford reversion sends to .
Define
Here is an integer and , so the scalar is unambiguous.
For each sign,
Hence the Clifford norm of the unscaled product in (5.4) or (5.5) is , while the scalar contributes . Thus
The action calculation below shows directly that the factors normalize , so .
5.2. The action on each coordinate plane
We use the standard spin action
Consider one orthogonal plane with unit basis and put . Since
a direct calculation gives
Thus induces
Similarly
so induces the reverse quarter-turn
For , equations (5.10) hold on every plane . This is exactly the signed permutation : the permutation interchanges and , and changes the sign of the coordinates only. For , the first plane is governed by (5.12), while all remaining planes are governed by (5.10); this changes exactly the two signs indexed by and , hence yields . Therefore
and the images of and in are precisely and .
5.3. Central squares and the projective spin kernel
Put
Using (5.2)-(5.3),
Thus
whereas
Because is even,
The element is the volume element for the ordered basis . Since is even, anticommutes with every vector of . Hence it commutes with every even Clifford product and is central in . Using (5.18), its action on is
We use the standard exact sequence
In the present range the standard structure of the natural orthogonal group gives
see, for example, Taylor [3]. Therefore the kernel of the composite projective spin map
is exactly
Every element in (5.22) has square , and the four elements are distinct. In particular .
Proposition 5.1. The involutions and are not conjugate in .
Proof. Suppose that is conjugate to in . Let satisfy
Choose a lift of . Then
and have the same image under , so by (5.22)
Squaring and using gives
But is central and , so
contrary to (5.22). Hence and are not conjugate.
- The character group of the normal elementary abelian subgroup
Recall
The standard dot product on restricts to a bilinear form on . Its radical is exactly .
Indeed, for every . Conversely, if is orthogonal to all of , then for every the vector belongs to , so
Hence all coordinates of are equal, and therefore . Thus
The pairing descends to a nondegenerate -invariant pairing on , so
For an even subset of the coordinate labels define
The condition that have even size is exactly what makes the functional trivial on . Moreover and determine the same character because their indicator vectors differ by .
The action of on even subsets is transitive at each admissible cardinality. Indeed, is transitive on -subsets, and if a chosen transporter is odd then, because and in the nontrivial cases, it may be composed with a transposition internal to the target subset or to its complement without changing the target subset. Thus the -orbits on may be represented by even cardinalities
where the identification is used at the midpoint.
Let
Since is -invariant, it extends to by
By the standard little-group form of Clifford theory for a finite group with abelian normal subgroup [2], every irreducible character of
has the form
\sum_{\substack{sB_Y\in A_N/B_Y\s^{-1}ps\in B_Y}} \lambda_{sY}(a),\tau(s^{-1}ps). \tag{6.8}
The condition $s^{-1}ps\in B_Y$ is equivalent to $p$ fixing the character $\lambda_{sY}$, which in turn meansp(sY)=sY \qquad\text{or}\qquad p(sY)=(sY)^c. \tag{6.9}
7. The monomial higher congruence Theorem 7.1 (Monomial congruence). For every virtual complex character $\theta\in R(K)$,\theta(x_+)-\theta(x_-) \in 2^r\mathbb Z =2^{2M}\mathbb Z. \tag{7.1}
Proof. It suffices to treat the irreducibles (6.7). 7.1. Non-middle orbits Assume $|Y|<r$. The complement alternative in (6.9) is impossible, since it would imply|Y|=|Y^c|=N/2=r.
Hence every term in (6.8) comes from a \subset $sY$ satisfyingp(sY)=sY.
Since $p$ is the product of the $r$ disjoint transpositions $(e_i\ f_i)$, a $p$-stable \subset is a union of entire pairs ${e_i,f_i}$. Nowa_-+a_+=e_1+f_1
in characteristic $2$. Therefore a $p$-stable \subset has even intersection with the support of $a_-+a_+$, and\lambda_{sY}(a_+)=\lambda_{sY}(a_-). \tag{7.2}
Every summand in (6.8) is identical at $x_+$ and $x_-$. Thus\Theta_{Y,\tau}(x_+)-\Theta_{Y,\tau}(x_-)=0 \qquad(|Y|<r). \tag{7.3}
Y_0={e_1,\ldots,e_r}. \tag{7.4}
The $p$-stable middle subsets again contribute equally at $x_+$ and $x_-$ and cancel from the difference. The remaining solutions of (6.9) satisfyp(Z)=Z^c.
Such a \subset contains exactly one point from each pair ${e_i,f_i}$; these are precisely the transversals of the $r$ pairs. Encode a transversal by a \subset $J\subseteq{1,\ldots,r}$: choose $e_i$ if $i\in J$ and $f_i$ if $i\notin J$. There are $2^r$ transversals. Complementation sends $J$ to $J^c$ and does not change the corresponding character. Hence there are $2^{r-1}$ distinct transversal characters. Since $r$ is even,|J^c|=r-|J|\equiv|J|\pmod2,
so complement preserves the parity of $J$. Consequently there are exactly2^{r-2}
h=(e_1\ e_2), \qquad q_J=\prod_{i\notin J}(e_i\ f_i). \tag{7.5}
Since $r$ is even,\operatorname{sgn}(q_J)=(-1)^{r-|J|}=(-1)^{|J|}.
s_J=
\begin{cases}
q_J,& |J|\text{ even},
q_Jh,& |J|\text{ odd}.
\end{cases}
\tag{7.6}
s_J^{-1}ps_J=
\begin{cases}
p,& |J|\text{ even},
hph,& |J|\text{ odd}.
\end{cases}
\tag{7.7}
\lambda_J(a_+)=(-1)^{|J|}, \tag{7.8}
because $a_+$ is supported on the $e_i$. Since a transversal contains exactly one of $e_1,f_1$,\lambda_J(a_-) =-\lambda_J(a_+) =-(-1)^{|J|}. \tag{7.9}
Substituting (7.7)-(7.9) into (6.8), and using the exact count $2^{r-2}$ in each parity class, yields\Theta_{Y_0,\tau}(x_+)-\Theta_{Y_0,\tau}(x_-) =2^{r-1}\bigl(\tau(p)-\tau(hph)\bigr). \tag{7.10}
7.3. The parity gain Let $d=\tau(1)$. If $t$ is an involution, then in a complex representation affording $\tau$, the eigenvalues of $t$ are $\pm1$. Hence\tau(t)=d-2a
for some integer $a$, and therefore\tau(t)\equiv d\pmod2.
Applying this to $p$ and $hph$ gives\tau(p)-\tau(hph)\in2\mathbb Z. \tag{7.11}
Equation (7.10) is therefore divisible by $2^r$. Together with (7.3), this proves (7.1) for every irreducible character and hence for every virtual character. $\square$ 8. Sharpness on the monomial subgroup The modulus in Theorem 7.1 is exact for $K$. Let $B=B_{Y_0}$. It is the stabilizer in $A_{2r}$ of the unordered bipartition{Y_0,Y_0^c}.
Every element of $B$ has a unique expression(\alpha,\beta)p^\delta, \qquad \alpha,\beta\in S_r, \qquad \operatorname{sgn}(\alpha)=\operatorname{sgn}(\beta), \qquad \delta\in{0,1}, \tag{8.1}
where $p$ exchanges the two blocks. The equality of signs is precisely the condition that the resulting permutation of $2r$ points be even, since $\operatorname{sgn}(p)=(-1)^r=1$. Define\epsilon((\alpha,\beta)p^\delta)=\operatorname{sgn}(\alpha). \tag{8.2}
This is a homomorphism: conjugation by $p$ interchanges $\alpha$ and $\beta$, which have the same sign. Thus $\epsilon$ is a linear character of $B$. We havep=(1,1)p,
\epsilon(p)=1. \tag{8.3}
With $h=(e_1\ e_2)$ as above,hph=((1\ 2),(1\ 2))p,
\epsilon(hph)=-1. \tag{8.4}
Taking $\tau=\epsilon$ in (7.10) gives the actual irreducible character\Theta_{Y_0,\epsilon}
\Theta_{Y_0,\epsilon}(x_+)-\Theta_{Y_0,\epsilon}(x_-) =2^{r-1}(1-(-1)) =2^r. \tag{8.5}
d_r= \gcd_{\theta\in\operatorname{Irr}(K)} \left|\theta(x_+)-\theta(x_-)\right|.
\boxed{d_r=2^r=2^{2M}.} \tag{8.6}
In particular, the modulus $2^{2M}$ is sharp on the monomial subgroup $K$. Remark 8.2. The sharpness statement (8.6) is deliberately restricted to $K$. Restriction of characters from $G$ proves divisibility by $2^{2M}$ for all characters of $G$, but it does not by itself imply that the corresponding \gcd over $\operatorname{Irr}(G)$ is exactly $2^{2M}$. 9. Transport to the simple orthogonal group Corollary 9.1. For every ordinary complex character $\chi$ of $G=P\Omega_N^+(3)$,\chi(x_+)\equiv\chi(x_-) \pmod{2^{2M}}. \tag{9.1}
\operatorname{Res}^G_K\chi
is an integral character of $K$, hence an element of $R(K)$. Theorem 7.1 therefore gives(\operatorname{Res}^G_K\chi)(x_+)-(\operatorname{Res}^G_K\chi)(x_-) \in2^{2M}\mathbb Z,
which is exactly (9.1). $\square$ Because $x_+$ and $x_-$ are involutions, every matrix representing either element over $\mathbb C$ has eigenvalues only $1$ and $-1$. Thus\chi(x_+),\chi(x_-)\in\mathbb Z.
Hence (9.1) is an ordinary integer congruence, and in particular \implies the corresponding congruence for every character unramified at $2$ in the sense of Harman and Mundinger. 10. The 2-primary exponent in $GL_n(3)$ Write\operatorname{ord}_{2^a}(3)
for the multiplicative order of $3$ modulo $2^a$. Lemma 10.1. For every integer $a\geq3$,\operatorname{ord}_{2^a}(3)=2^{a-2}. \tag{10.1}
Proof. For $k\geq1$, the $2$-adic lifting-the-exponent formula givesv_2(3^{2^k}-1) =v_2(3-1)+v_2(3+1)+v_2(2^k)-1 =1+2+k-1 =k+2. \tag{10.2}
Taking $k=a-2$ shows3^{2^{a-2}}\equiv1\pmod{2^a}.
For $a\geq4$, taking $k=a-3$ gives valuation $a-1$, so3^{2^{a-3}}\not\equiv1\pmod{2^a}.
The case $a=3$ is immediate. Since the order divides the power $2^{a-2}$ and does not divide its half, it is exactly $2^{a-2}$. $\square$ Proposition 10.2. If $y\in GL_n(3)$ has order $2^a$, thena\leq2+\lfloor\log_2 n\rfloor. \tag{10.3}
|y|\leq2^{2+\lfloor\log_2 n\rfloor}. \tag{10.4}
Proof. If $a\leq2$ there is nothing to prove. Assume $a\geq3$. Since $|y|$ is \prime to the characteristic, $X^{2^a}-1$ is separable over $\mathbb F_3$, so $y$ is semisimple over an algebraic closure. The order of a semisimple matrix is the least common multiple of the orders of its eigenvalues. Since all these orders are powers of $2$, at least one eigenvalue $\alpha$ has exact order $2^a$. Let $d$ be the degree of the minimal polynomial of $\alpha$ over $\mathbb F_3$. Then $d\leq n$ and $\alpha\in\mathbb F_{3^d}^\times$, so2^a\mid3^d-1.
\operatorname{ord}_{2^a}(3)\mid d.
2^{a-2}\leq d\leq n,
which gives (10.3). $\square$ Lemma 10.3. For every $M\geq3$,2+\lfloor\log_2(4M)\rfloor\leq2M-1. \tag{10.5}
Proof. At $M=3$ both sides equal $5$. For $M\geq4$,\lfloor\log_2(4M)\rfloor =2+\lfloor\log_2M\rfloor \leq2+(M-2)=M,
because $\lfloor\log_2M\rfloor\leq M-2$ for $M\geq4$. Hence the \left-hand side of (10.5) is at most $M+2\leq2M-1$. $\square$ 11. The projective exponent bound The passage from a linear orthogonal group to its projective quotient is included explicitly because it is essential to the collapse of $\sim_{2M}$. Proposition 11.1 (Projective 2-exponent bound). Every $2$-element ofG=P\Omega^+_{4M}(3),\qquad M\geq3,
2^{2M-1}. \tag{11.1}
\bar y\in P\Omega^+{4M}(3)
be a $2$-element of order $2^a$, and choose any lifty\in\Omega^+{4M}(3).
\Omega^+{4M}(3)\longrightarrow P\Omega^+{4M}(3)
is central and of $2$-power order. Thusy^{2^a}\in\ker\bigl(\Omega^+{4M}(3)\to P\Omega^+{4M}(3)\bigr).
If the kernel has exponent $2^b$, theny^{2^{a+b}}=1.
Consequently $y$ itself has $2$-power order. Since\Omega^+{4M}(3)\leq GL{4M}(3),
|y|\mid2^{2M-1}.
The order of the image $\bar y$ divides the order of $y$, proving (11.1). $\square$ Remark 11.2. At the exact target order one can see the obstruction even more directly. An eigenvalue of order $2^{2M}$ over $\mathbb F_3$ has minimal polynomial degree\operatorname{ord}{2^{2M}}(3)=2^{2M-2}.
For every $M\geq3$,2^{2M-2}>4M,
so $GL{4M}(3)$ cannot contain an element of order $2^{2M}$. Proposition 11.1 records the stronger uniform bound on all $2$-element orders. 12. Collapse of $\sim_{2M}$ and the main theorem Specialize the Harman-Mundinger relation top=2, \qquad m=2M.
g\longmapsto g h^{2^{2M-1}}, \qquad [g,h]=1, \qquad |h|\text{ a power of }2. \tag{12.1}
h^{2^{2M-1}}=1
for every $2$-element $h\in G$. Hence every move (12.1) is the identity. Proposition 12.1. On $G=P\Omega^+{4M}(3)$, $M\geq3$, the relation $\sim{2M}$ is exactly ordinary conjugacy. Proof. Every nonconjugacy generator in the definition of $\sim_{2M}$ is the identity by Proposition 11.1. $\square$ We can now combine the independent parts of the argument. Theorem 12.2 (Main theorem). For every integer $M\geq3$, letG_M=P\Omega^+{4M}(3), \qquad p=2, \qquad m=2M.
There exist involutions $x+,x_-\in G_M$ such that\chi(x_+)\equiv\chi(x_-) \pmod{2^{2M}} \tag{12.2}
for every ordinary complex character $\chi$ of $G_M$, and therefore for every character unramified at $2$, whilex_+\not\sim_{2M}x_-. \tag{12.3}
{P\Omega^+{4M}(3)\geq3}
provides infinitely many counterexamples of type $D{2M}$. Proof. Sections 3-4 construct the involutions. Proposition 5.1 proves that they are not conjugate. Corollary 9.1 proves (12.2) for every ordinary complex character. Proposition 12.1 identifies $\sim_{2M}$ with ordinary conjugacy, so Proposition 5.1 gives (12.3). This contradicts precisely the conjectural reverse implication. $\square$ 13. Boundary case and mechanism The smallest member occurs atM=3, \qquad G=P\Omega^+{12}(3), \qquad m=6.
2+\lfloor\log_2 12\rfloor=5=2M-1.
Thus every $2$-element of $G$ has order dividing2^5=32,
and every $\sim_6$ power move contains the factorh^{32}=1.
\chi(x+)\equiv\chi(x_-)\pmod{64}
for every ordinary complex character. The counterexample therefore results from two incompatible scales. The little-group calculation produces a congruence depth linear in $M$:\chi(x_+)-\chi(x_-) \in2^{2M}\mathbb Z.
By contrast, the largest possible exponent $a$ for an element of order $2^a$ in $GL_{4M}(3)$ grows only logarithmically with $M$. At $m=2M$ the \prime-power moves defining $\sim_m$ have already vanished, while the character congruence remains. The spin-square invariant then separates the two remaining conjugacy classes. 14. Logical dependencies and scope For clarity, the proof depends on the following chain:K=2^{4M-2}:A_{4M}<P\Omega^+{4M}(3)
\Downarrow
\text{little-group analysis of }A\triangleleft K
\Downarrow
\chi(x+)-\chi(x_-) \in2^{2M}\mathbb Z \quad(\chi\in R(G)),
\operatorname{ord}{2^a}(3)=2^{a-2}
\Downarrow
\exp_2(G)\mid2^{2M-1}
\Downarrow
\sim{2M}=\text{ordinary conjugacy},
u_+^2=\omega\neq-\omega=u_-^2
\Downarrow
x_+,x_-\text{ are not conjugate}.
g\sim_m g' \Longrightarrow \chi(g)\equiv\chi(g')\pmod{p^m}
for all unramified characters. Only the conjectured converse is disproved. The only standard external inputs used in the proof are: the plus/minus classification and simplicity facts for finite orthogonal groups; the standard exact sequence $\operatorname{Spin}_N^+(3)\to\Omega_N^+(3)$; the little-group form of Clifford theory for an abelian normal subgroup; the elementary lifting-the-exponent identity used in Lemma 10.1. All group-specific calculations needed for the counterexample are given explicitly above. References- HM_TypeD_Counterexample_Rejnaldo_Narkaj.pdfOpen