Next Article in Journal
Idealizing Rough Topological Structures Generated by Several Types of Maximal Neighborhoods and Exploring Their Applications
Previous Article in Journal
Closed-Form Meromorphic Solutions of High-Order and High-Dimensional Differential Equations
Previous Article in Special Issue
Mellin and Widder–Lambert Transforms with Applications in the Salem Equivalence to the Riemann Hypothesis
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On the Action of a Subgroup of the Modular Group on Imaginary Quadratic Number Fields

Department of Mathematics, King Khalid University, Abha 61413, Saudi Arabia
Axioms 2025, 14(5), 335; https://doi.org/10.3390/axioms14050335
Submission received: 13 March 2025 / Revised: 20 April 2025 / Accepted: 23 April 2025 / Published: 27 April 2025
(This article belongs to the Special Issue Elliptic Curves, Modular Forms, L-Functions and Applications)

Abstract

:
Consider the modular group PSL ( 2 , Z ) = x , y | x 2 = y 3 = 1 generated by the transformations x : z 1 / z and y : z ( z 1 ) / z . Let H be the proper subgroup y , v | y 3 = v 3 = 1 of PSL ( 2 , Z ) , where v = x y x . For a positive square-free integer n, this article studies the action of H on the subset { a + n c | a , b = a 2 + n c , c Z , c 0 } of the imaginary quadratic number field Q ( n ) where, in particular, the accurate estimate of the number of orbits arising from this action is given, correcting the estimate given in some of the relevant literature.
MSC:
05A18; 05E18; 11R11; 11A25; 20F05

1. Introduction

The study of the action of the modular group G = PSL ( 2 , Z ) and its subgroups on various commutative algebraic structures has been common since the works of Graham Higman and his collaborators in the 1980s ([1,2,3]). Various tracks of applications of the action of the modular group have been evolving recently. For instance, Alolaiyan et al. [4] presented a graph-theoretic application of the action of the modular group on certain structures by highlighting a connection of such an action to the study of homomorphic copies of closed graphs. On another front, some S-box cryptographic applications of the coset diagrams of the action of the modular group on various discrete structures were introduced in refs. [5,6,7]. This indeed suggests a promising future for the applications of this seemingly purely mathematical topic.
Stothers [8] showed that the modular group G has the finite presentation x , y | x 2 = y 3 = 1 , where x and y are, respectively, the linear fractional transformations z 1 / z and z ( z 1 ) / z . For a square-free integer m, the action of G and its subgroups on certain subsets of the quadratic number field Q ( m ) has been extensively studied (see, for instance, refs. [3,9,10,11,12,13,14,15,16]).
For a positive square-free integer n, consider the following subset of the imaginary quadratic number field Q ( n ) :
Q * ( n ) : = { a + n c | a , b = a 2 + n c , c Z , c 0 } .
Deajim and Aslam, in ref. [10], studied the action of G on Q * ( n ) , in which the main result is that of counting the orbits resulting from this action. Ashiq and Mushtaq (in ref. [17]) studied the proper subgroup H of G generated by the transformations y and v = x y x : z 1 / ( z + 1 ) , where they showed that y 3 = v 3 = 1 are defining relations for H, so H = y , v | y 3 = v 3 = 1 . Then, in ref. [18], Ashiq and Mushtaq studied the action of H on Q * ( n ) , where they suggested a formula that counts the orbits resulting from this action. However, the author of this article has found some technical/mathematical mistakes in [18], which has resulted in calls for revision of the findings of [18], with the primary aim of providing a more accurate estimate of the number of orbits.
In Section 3, the errors of [18] are listed along with the reasoning for such a judgment. Section 4 aims at correcting the main result of [18], namely, ref. [18] (Theorem 9), by giving, in Theorem 1, the accurate formula for the number of orbits arising from the action of H on Q * ( n ) . Moreover, some lemmas that were used to prove Theorem 1 also help in correcting some of the mistakes of [18] mentioned in Section 3. Finally, a conclusion containing a summary of the main findings of the article is given in Section 5.

2. Terminology

Upon a wise suggestion of a reviewer, this section was added for the sake of completeness and more readability.

2.1. Quadratic Number Fields

The information in this subsection can be found in many abstract algebra or algebraic number theory books, such as [19,20].
If K and L are fields such that K L , we say that L is a field extension of K and express this as L / K . In this case, L can also be looked at as a vector space over K whose dimension is called the degree of the extension L / K . A field extension L / K is said to be finite if its degree is finite. In particular, if the degree of the extension L / K is 2, we say that the field extension is quadratic. If p ( x ) K [ x ] is an irreducible polynomial of degree n, then there is a field extension of K containing a root α of p ( x ) . In particular, the field
L = K ( α ) = { a 0 + a 1 α + + a n 1 α n 1 | a i K }
is the field extension over K of degree n generated by α with a basis { 1 , α , , α n 1 } .
In the case K = Q , any finite field extension of Q is called a number field. If an integer n is not a perfect square, the polynomial x 2 n Q [ x ] is irreducible, so Q ( n ) is called a quadratic number field (as it is a number field that is a quadratic extension of Q ) with a basis { 1 , n } . So, an element of Q ( n ) can be uniquely written in the form p + q n for some p , q Q . For another integer m that is not a perfect square either, we have Q ( n ) = Q ( m ) if and only if n = k 2 m for an integer k. So, we can always assume that n is square-free. For a square-free integer n > 0 (resp. n < 0 ), Q ( n ) is said to be a real (resp. imaginary) quadratic number field.

2.2. The Modular Group and Its Action on Q * ( n )

A suitable reference for the modular group and its relation to linear fractional transformations is ref. [21]. A reader who is interested in finding, in one place, some more detailed information about the modular group, its properties, and its applications may consult [22] and the references therein.
It is known from group theory that
SL ( 2 , Z ) = a b c d | a , b , c , d Z , a d b c = 1
is a nonabelian multiplicative group whose center is { ± I } . Moding SL ( 2 , Z ) out by its center { ± I } yields the modular group G = PSL ( 2 , Z ) . So, an element of G is a coset A { ± I } = { ± A } for A SL ( 2 , Z ) . It should not be confusing though that a representative of a coset is more commonly used in the literature instead of the coset itself (keeping in mind that the two matrices A and A are identified).
The set of complex-valued linear fractional transformations f ( a , b , c , d ) : z a z + b c z + d , with a , b , c , d Z and a d b c = 1 , forms a nonabelian group under the composition of maps. Since f ( a , b , c , d ) = f ( a , b , c , d ) , a transformation f ( a , b , c , d ) can be identified with a b c d G , as an element of G is identified with its negative (see the paragraph above). This identification map can be shown to be a group isomorphism. So, the terminology of “modular group” usually refers to either of these two groups, and the elements of this group can either be written as matrices or as linear fractional transformations. As was mentioned in Section 1, the modular group has the finite presentation G = x , y | x 2 = y 3 = 1 , where x and y are, respectively, the linear fractional transformations z 1 / z and z ( z 1 ) / z .
For a square-free positive integer n and α = ( a + n ) / c Q * ( n ) , we sometimes use the notation a α , b α , and c α for a, b, and c, respectively. Throughout the article and without mention, we shall make use of the following Table 1, which shows the effect of the action of t { x , y , y 2 , v , v 2 } on α and can be verified through straightforward computations.
For y : z ( z 1 ) / z and v : z 1 / ( z + 1 ) , let H = y , v | y 3 = v 3 = 1 , which is a subgroup of G. As G acts on the quadratic number field Q ( n ) , the subgroup H acts on Q ( n ) as well. So, to show that H acts on the subset Q * ( n ) , it suffices to show that Q * ( n ) is invariant under this action (in fact, it is enough to show that y ( α ) , v ( α ) Q * ( n ) for any α Q * ( n ) since { y , v } is a complete set of generators of H). For α = ( a + n ) / c Q * ( n ) , we see from Table 1 that { a y ( α ) , b y ( α ) , c y ( α ) , a v ( α ) , b v ( α ) , c v ( α ) } Z , c y ( α ) 0 , and c v ( α ) 0 . Notice that the statements c y ( α ) 0 and c v ( α ) 0 follow, respectively, from the facts that b y ( α ) c y ( α ) = a y ( α ) 2 + n > 0 and b v ( α ) c v ( α ) = a v ( α ) 2 + n > 0 .

3. A Summary of Errors in Ashiq [18]

Throughout this article, n denotes a positive square-free integer.
An element α = ( a + n ) / c Q * ( n ) is said to be totally positive if a c > 0 , totally negative if a c < 0 , and of norm zero if | | α | | : = | a | = 0 . For b = ( a 2 + n ) / c , it is obvious that b c > 0 , so b and c are always of the same sign.
For every α Q * ( n ) , denote the H-orbit { h ( α ) | h H } by α H and the G-orbit { g ( α ) | g G } by α G . It is clear that α H α G . Denote the set of H-orbits (resp. the set of G-orbits) in Q * ( n ) by O n H (resp. O n G ).
As usual, we denote by . the floor function; by d ( k ) the number of positive divisors of k; and by d i ( k ) , for i , k N with i k , the number of positive divisors of k that do not exceed i. For example, d ( 15 ) = 4 and d 5 ( 15 ) = 3 . Recall that d is a multiplicative function and, for a prime p, d ( p t ) = t + 1 for t N .
We summarize below the main errors in ref. [18] along with some comments.
Claim 1
([18] line 1 of the proof of Theorem 6). Let α be a totally positive imaginary quadratic number. Then, by Theorem 3 (i), y ( α ) or y 2 ( α ) is a totally negative imaginary quadratic number.
Comments: Claim 1 is not necessarily true. We show in Lemma 1 that if α is totally positive, then one of y ( α ) or y 2 ( α ) is totally positive and the other is either totally positive, totally negative, or of norm zero. For instance, consider the totally positive element α = ( 2 + 5 ) / 3 . Then, both y ( α ) = ( 1 + 5 ) / 3 and y 2 ( α ) = ( 1 + 5 ) / 2 are totally positive as well. Another example is given by β = ( 1 + 1 ) / 2 ; then, y ( β ) = 1 is of norm zero and y 2 ( β ) = 1 + 1 is totally positive. On the other hand, it should also be noted that [18] (Theorem 3 (i)) states that y ( α ) and y 2 ( α ) are totally positive when α is totally negative, which is true, but Claim 1 above misquotes it. Note that Claim 1 being false renders the proof of [18] (Theorem 6) incorrect.
Claim 2
([18] Theorem 8). (v) If α = ( 1 + n ) / c 1 ( n 3 ), where 1 + n = c 1 c 2 , c 1 1 or n + 1 , then α is the only element of norm 1 in α H .
Comments: It is noted that in the proof of Theorem 8(v) mentioned above, something contradicting the statement itself was mentioned. It was stated explicitly that if α = ( 1 + n ) / 2 , then y 2 ( α ) = ( 1 + n ) / ( n + 1 ) 2 lies in the same orbit. But then, as y 2 ( α ) is of norm 1 and is different from α (as n 3 ), this shows that the statement of (v) is false. For instance, consider α = ( 1 + 5 ) / 2 . Then, α is of norm 1 and satisfies the assumptions of Theorem 8(v) mentioned above. However, y 2 ( α ) = ( 1 + 5 ) / 3 is also of norm 1 belonging to α H and is different from α .
As for the other parts of [18] (Theorem 8), it is also noted that the arguments in the proof of parts (iii) and (iv) of [18] (Theorem 8) are not sufficient, although the statements are correct. In fact, parts (iii) and (iv) specify certain cases where an H-orbit contains only one element of norm zero. Part of the proof of Theorem 1 shows that this is always the case for any n and for any H-orbit containing an element of norm zero.
Claim 3
([18] Theorem 9). If n 3 , then the total number of orbits of Q * ( n ) under the action of H are:
(i) 
2 [ d ( n ) + 2 d ( n + 1 ) 6 ] if n is odd, and
(ii) 
2 [ d ( n ) + 2 d ( n + 1 ) 4 ] if n is even.
Comments: This is the main result of [18], which is inaccurate. Its proof relies on ([18] Theorem 8), which has some gaps (see Claim 2). The correct estimate of the number of orbits is given in Theorem 1 below. We briefly give here some counter-examples to [18] (Theorem 9). For odd integers, consider n = 1 and n = 21 , for instance. For n = 1 , the above estimate gives | O 1 H | = 2 , which is absurd. Our estimate (see Theorem 1) gives | O 1 H | = 2 . For n = 21 , the above estimate gives | O 21 H | = 12 , whereas our estimate gives | O 21 H | = 16 . In fact, according to Theorem 1, the number of orbits in this case has to be congruent to zero modulo 8. For even integers, consider n = 26 , for instance. The above estimate gives | O 26 H | = 16 , whereas our estimate gives | O 26 H | = 24 . The details of the computations of these counter-examples are given just after the proof of Theorem 1.

4. Lemmas and Main Result

The main aim of the article is to prove Theorem 1, which gives the precise estimate for the number of H-orbits | O n H | , correcting [18] (Theorem 9). Besides serving to prove Theorem 1, some of the lemmas below also contribute by correcting some of the errors of [18] mentioned in Section 3.
Lemma 1.
Let α = ( a + n ) / c Q * ( n ) .
(1) 
If α is totally positive, then one of y ( α ) or y 2 ( α ) is totally positive and the other is either totally positive, totally negative, or of norm zero, whereas both v ( α ) and v 2 ( α ) are totally negative.
(2) 
If α is totally negative, then one of v ( α ) or v 2 ( α ) is totally negative and the other is either totally negative, totally positive, or of norm zero, whereas both y ( α ) and y 2 ( α ) are totally positive.
(3) 
If α is of norm zero, then both y ( α ) and y 2 ( α ) are totally positive and both v ( α ) and v 2 ( α ) are totally negative.
Proof of Lemma 1.
Once and for all, note here and elsewhere that Table 1 is used without mention.
(1)
Assume that a , b , c > 0 (the case a , b , c < 0 is proved similarly). We show first that at least one of y ( α ) or y 2 ( α ) is totally positive. However, suppose that neither of them is totally positive. If y ( α ) is totally negative, then (as c y ( α ) = b > 0 ) a y ( α ) = a + b < 0 . As b y 2 ( α ) = c > 0 and as b y 2 ( α ) and c y 2 ( α ) have the same sign, we have a + b a + c = c y 2 ( α ) > 0 , implying that a y 2 ( α ) = a + c > 0 (as a + b < 0 ). So, y 2 ( α ) is totally positive, a contradiction. Similarly, if y 2 ( α ) is totally negative, then y ( α ) is totally positive, a contradiction. On the other hand, if y ( α ) is of norm zero, then a y ( α ) = a + b = 0 . So, c y 2 ( α ) = a + b a + c = a + c = a y 2 ( α ) , implying that (as c y 2 ( α ) 0 ) a y 2 ( α ) c y 2 ( α ) > 0 and thus y 2 ( α ) is totally positive, a contradiction. Similarly, if y 2 ( α ) is of norm zero, then y ( α ) is totally positive, a contradiction. This argument leads to the assertion that at least one of y ( α ) or y 2 ( α ) is totally positive. Suppose that it is y ( α ) that is totally positive (if it were y 2 ( α ) , then the proof would be similar). It then follows that y 2 ( α ) is either totally positive, totally negative, or of norm zero depending, respectively, on whether a y 2 ( α ) > 0 , a y 2 ( α ) < 0 , or a y 2 ( α ) = 0 . As for v ( α ) and v 2 ( α ) , note that having a v ( α ) = a c < 0 and c v ( α ) = 2 a + b + c > 0 implies that v ( α ) is totally negative. Also, having a v 2 ( α ) = a b < 0 and c v 2 ( α ) = b > 0 implies that v 2 ( α ) is totally negative.
(2)
Similar to the proof of part (1).
(3)
Suppose that a = 0 . Then, a y ( α ) c y ( α ) = b 2 > 0 , a y 2 ( α ) c y 2 ( α ) = b c + c 2 > 0 (b and c are of the same sign), so y ( α ) and y 2 ( α ) are totally positive. On the other hand, a v ( α ) c v ( α ) = b c c 2 < 0 , a v 2 ( α ) c v 2 ( α ) = b 2 < 0 , so v ( α ) and v 2 ( α ) are totally negative.
 □
We have the following obvious observations (see [10] (Lemmas 3.2 and 3.3)).
Lemma 2
([10] Lemmas 3.2 and 3.3). For α = ( a + n ) / c Q * ( n ) , we have
(i) 
α is totally positive if and only if x ( α ) is totally negative.
(ii) 
α has norm zero if and only if x ( α ) has norm zero.
For α Q * ( n ) , the sets α ^ y = { α , y ( α ) , y 2 ( α ) } and α ^ v = { α , v ( α ) , v 2 ( α ) } are called, respectively, the y-cycle and the v-cycle of α (or just cycles when α , y, and v are clear in the context). We call a cycle totally positive (resp. totally negative) if all its elements are totally positive (resp. if all its elements are totally negative).
Lemma 3.
Under the action of H on Q * ( n ) , the following holds for α = ( a + n ) / c Q * ( n ) :
(i) 
[10] (Lemma 3.3) The cycle α ^ y is totally positive if and only if either ( a > 0 , a < b , a < c ) or ( a < 0 , a > b , a > c ).
(ii) 
The cycle α ^ v is totally negative if and only if either ( a > 0 , a > b , a > c ) or ( a < 0 , a < b , a < c ).
(iii) 
The cycle α ^ y is totally positive if and only if the cycle x ( α ) ^ v is totally negative.
(iv) 
If the cycle α ^ y is totally positive, then α H x ( α ) H (i.e., α and x ( α ) belong to distinct H-orbits).
(v) 
If n 1 and α has norm zero, then α H x ( α ) H .
Proof of Lemma 3.
(i) This is [10] (Lemma 3.3).
(ii)
Suppose that α ^ v is totally negative. As α is totally negative, either ( a > 0 and b , c < 0 ) or ( a < 0 and b , c > 0 ). Assume that a > 0 and b , c < 0 . Since b v ( α ) = c < 0 , we obtain c v ( α ) < 0 . As further v ( α ) is totally negative, we must then have a c = a v ( α ) > 0 so a > c . Also, since c v 2 ( α ) = b < 0 and v 2 ( α ) is totally negative, a v 2 ( α ) = a b > 0 so a > b . A similar argument yields that if a < 0 and b , c > 0 then a < b and a < c .
Conversely, suppose that a > 0 , a > b , and a > c (the case when a < 0 , a < b , and a < c is handled similarly). a > 0 and a > c , c < 0 , so α is totally negative. As a v ( α ) = a c > 0 and b v ( α ) = c < 0 and b v ( α ) , c v ( α ) are of the same sign, v ( α ) is totally negative too. As a v 2 ( α ) = a b > 0 and c v 2 ( α ) = b < 0 , v 2 ( α ) is totally negative as well. Hence, the cycle α ^ v is totally negative.
(iii)
Suppose that α ^ y is totally positive. By (i), if a > 0 , a < b , and a < c , then it follows from (ii) that x ( α ) ^ v is totally negative since a x ( α ) = a < 0 , a x ( α ) = a < c = b x ( α ) , and a x ( α ) = a < b = c x ( α ) . The case when a < 0 , a > b , and a > c is similar.
Conversely, suppose that x ( α ) ^ v is totally negative. Then, by (ii), if a x ( α ) = a > 0 , a x ( α ) = a > b x ( α ) = c , and a x ( α ) = a > c x ( α ) = b , then it follows from (i) that α ^ y is totally positive. The case when a x ( α ) < 0 , a x ( α ) < b x ( α ) , and a x ( α ) < c x ( α ) is similar.
(iv)
Suppose that α ^ y is totally positive. By (iii), x ( α ) ^ v is totally negative. To show that α H x ( α ) H , we need to show that h ( α ) x ( α ) for any h H . It can be seen that an arbitrary non-identity element of H takes one and only one of the following forms:
h 1 = y ϵ , for ϵ { 1 , 2 } h 2 = v δ , for δ { 1 , 2 } h 3 = y ϵ k v δ k y ϵ 2 v δ 2 y ϵ 1 v δ 1 , for k 1 , ϵ i , δ i { 1 , 2 } , 1 i k h 4 = v δ k y ϵ k 1 v δ k 1 y ϵ 2 v δ 2 y ϵ 1 v δ 1 , for k 2 , ϵ i , δ j { 1 , 2 } , 1 i k 1 , 1 j k h 5 = v δ k y ϵ k v δ 2 y ϵ 2 v δ 1 y ϵ 1 , for k 1 , ϵ i , δ i { 1 , 2 } , 1 i k h 6 = y ϵ k v δ k 1 y ϵ k 1 v δ 2 y ϵ 2 v δ 1 y ϵ 1 , for k 2 , ϵ i , δ j { 1 , 2 } , 1 i k , 1 j k 1
The h1 case:
Since there is no z C such that y ϵ ( z ) = x ( z ) , we obtain h 1 ( α ) = y ϵ ( α ) x ( α ) . Alternatively, y ϵ ( α ) x ( α ) since y ϵ ( α ) is totally positive and x ( α ) is totally negative (by Lemma 2).
The h2 case:
Since there is no z C such that v δ ( z ) = x ( z ) , we obtain h 2 ( α ) = v δ ( α ) x ( α ) . Alternatively, v δ ( α ) x ( α ) since if equality holds then x y δ x ( α ) = x ( α ) would imply that x ( α ) = y δ ( α ) , a contradiction (see the h 1 case above).
The h3 case:
As α is totally positive, it follows from Lemma 1 (1) that v δ 1 ( α ) is totally negative so, by Lemma 1 (2), y ϵ 1 v δ 1 ( α ) is totally positive. Repeating this argument for i = 1 , , k , we obtain that h 3 ( α ) is totally positive. Since x ( α ) is totally negative, h 3 ( α ) x ( α ) .
The h4 case:
If we let h 4 * = v δ k h 4 = y ϵ k 1 v δ k 1 y ϵ 2 v δ 2 y ϵ 1 v δ 1 , then by an argument similar to that in the h 3 case, h 4 * ( α ) is totally positive. If h 4 ( α ) = x ( α ) , then h 4 * ( α ) = v δ k x ( α ) x ( α ) ^ v , so h 4 * ( α ) is totally negative, a contradiction.
The h5 case:
If we let h 5 * = v δ k h 5 = y ϵ k v δ 2 y ϵ 2 v δ 1 y ϵ 1 , then as y ϵ 1 ( α ) is totally positive, it by an argument similar to that in the h 3 case that h 5 * ( α ) is totally positive. If h 5 ( α ) = x ( α ) , then h 5 * ( α ) = v δ k x ( α ) , which is impossible since h 5 * ( α ) is totally positive, while v δ k x ( α ) is totally negative (see the h 4 case).
The h6 case:
If we let h 6 * = y ϵ k h 6 = v δ k 1 y ϵ k 1 v δ 2 y ϵ 2 v δ 1 y ϵ 1 , then as y ϵ 1 ( α ) is totally positive, it is by an argument similar to that in the h 3 case that h 6 * ( α ) is totally negative. If h 6 ( α ) = x ( α ) , then h 6 * ( α ) = y ϵ k x ( α ) , which is impossible since h 6 * ( α ) is totally negative, while y ϵ k x ( α ) is totally positive by Lemma 1 (2).
Now, by having just shown the impossibility of all cases above, we conclude that there is no h H such that h ( α ) = x ( α ) , and therefore α and x ( α ) belong to distinct H-orbits as claimed.
(v)
Remark first that we excluded the case n = 1 since the only elements of C fixed by x are ± 1 Q * ( 1 ) (i.e., x ( ± 1 ) = ± 1 ); see [10] (Lemma 3.4). Let n 1 , and suppose that α has norm zero. Then, x ( α ) has norm zero too. We need to show that h ( α ) x ( α ) for any h H . By Lemma 1 (3), both y ( α ) and y 2 ( α ) are totally positive, and both v ( α ) and v 2 ( α ) are totally negative. Now, for h 1 , , h 6 as in (iv), and since none of y ( α ) , y 2 ( α ) , v ( α ) , v 2 ( α ) has norm zero, it is easily seen that h i ( α ) is either totally negative or totally positive for every i = 1 , , 6 (see the argument in (iv)). Thus, h i ( α ) x ( α ) for any i = 1 , , 6 . This settles the claim.
 □
Example 1.
For n = 7 and α = ( 1 + 7 ) / ( 4 ) , it can be checked that y ( α ) = ( 1 + 7 ) / ( 2 ) , y 2 ( α ) = ( 3 + 7 ) / ( 4 ) , so α, y ( α ) , and y 2 ( α ) are all totally positive. On the other hand, x ( α ) = ( 1 + 7 ) / ( 2 ) , v x ( α ) = ( 1 + 7 ) / ( 4 ) , and v 2 x ( α ) = ( 3 + 7 ) / ( 4 ) , which are all totally negative.
Lemma 4
([10] Corollary 3.1). Under the action of G on Q * ( n ) , we have the following:
(i) 
Every G-orbit in Q * ( 1 ) contains a unique element of norm zero.
(ii) 
Every G-orbit in Q * ( 2 ) contains a unique pair of distinct elements of norm zero.
(iii) 
Every G-orbit in Q * ( n ) , for n 3 , contains either a unique pair of distinct elements of norm zero or a unique totally positive cycle, but not both.
The aim of our main result below is to compute the cardinality | O n H | correcting the estimate given in [18] (Theorem 9) (see Claim 3 in Section 3). In particular, we utilize the above results to simply show that
| O 1 H | = | O 1 G | ,   and   | O n H | = 2 | O n G |   for   n 2 ,
and then make use of the precise estimate of | O n G | given in [10] (Theorem 2.1) for all n 1 .
Theorem 1.
Under the action of H, the number of orbits in Q * ( n ) is 
| O n H | = | O 1 G | , i f   n = 1 2 | O n G | , i f   n 2 = 2 , i f   n = 1 4 , i f   n = 2 8 , i f   n = 3 2 d ( n ) + 4 3 i = 1 ( n 1 ) / 2 [ d ( i 2 + n ) 2 d i ( i 2 + n ) ] , i f   n > 3 .
Moreover, | O n H | 0 ( mod 8 ) for n 3 .
Proof of Theorem 1.
We begin with the case n 2 , where we show that | O n H | = 2 | O n G | . We show this equality by showing that every G-orbit splits into two distinct H-orbits. Let α G O n G . We know from Lemma 4 (ii, iii) that α G either contains a unique pair of distinct elements of norm zero or a unique totally positive cycle, but not both. We proceed by dealing with these two possibilities.
Firstly, suppose that α G contains a unique pair of distinct elements β and x ( β ) of norm zero. Since β x ( β ) in this case, we obtain from Lemma 3 (v) that it cannot be the case that both elements belong to α H . We show that α G splits into two distinct H-orbits ( α H and β H ) or ( α H and x ( β ) H ) by showing that α H must contain one and only one of these two norm-zero elements, while the other belongs to α G α H . If β α H , then (by Lemma 3 (v)) α G is the disjoint union of α H and x ( β ) H and we are done. Similarly, if x ( β ) α H , then α G is the disjoint union of α H and β H . Now, it remains to show that one of β or x ( β ) must belong to α H . Assume that β α H ; we show that x ( β ) α H . Since α α G α H , there is some g G H such that β = g ( α ) . In order to show that x ( β ) α H , we argue that x g H , which then would imply that x ( β ) = x g ( α ) α H as desired. Keeping in mind the forms h 0 = 1 and h 1 , , h 6 that elements of H can take (see the proof of Lemma 3 (iv)), we see that g, as an element of G but not an element of H, can take one of the forms x h i , h i x , y γ x h i , or h i x y γ for an appropriate h i , i = 0 , , 6 , γ { 1 , 2 } . We present the following argument, which exhausts all possible cases.
If g = x h i , then x g = h i H for i = 0 , , 6 .
If g = y γ x h i , then x g = x y γ x h i = v γ h i H for i = 0 , , 6 .
If g = h 0 x = x , then x g = 1 H .
If g = h 0 x y γ , then x g = y γ H .
If g = h 1 x = y ϵ x , then x g = x y ϵ x = v ϵ H .
If g = h 1 x y γ = y ϵ x y γ , then x g = x y ϵ x y γ = v ϵ y γ H .
If g = h 2 x = v δ x = x y δ , then x g = y δ H .
If g = h 2 x y γ = v δ x y γ = x y δ + γ , then x g = y δ + γ H .
If g = h 3 x , then x g = x ( y ϵ k v δ k y ϵ 1 v δ 1 ) x = v ϵ k y δ k v ϵ 1 y δ 1 H .
If g = h 3 x y γ , then x g = x ( y ϵ k v δ k y ϵ 1 v δ 1 ) x y γ = v ϵ k y δ k v ϵ 1 y δ 1 + γ H .
If g = h 4 x , then x g = x ( v δ k y ϵ k 1 v δ k 1 y ϵ 1 v δ 1 ) x = y δ k v ϵ k 1 y δ k 1 v ϵ 1 y δ 1 H .
If g = h 4 x y γ , then x g = x ( v δ k y ϵ k 1 v δ k 1 y ϵ 1 v δ 1 ) x y γ = y δ k v ϵ k 1 y δ k 1 v ϵ 1 y δ 1 + γ H .
If g = h 5 x , then x g = x ( v δ k y ϵ k v δ 1 y ϵ 1 ) x = y δ k v ϵ k y δ 1 v ϵ 1 H .
If g = h 5 x y γ , then x g = x ( v δ k y ϵ k v δ 1 y ϵ 1 ) x y γ = y δ k v ϵ k y δ 1 v ϵ 1 y γ H .
If g = h 6 x , then x g = x ( y ϵ k v δ k 1 y ϵ k 1 v δ 1 y ϵ 1 ) x = v ϵ k y δ k 1 v ϵ k 1 y δ 1 v ϵ 1 H .
If g = h 6 x y γ , then x g = x ( y ϵ k v δ k 1 y ϵ k 1 v δ 1 y ϵ 1 ) x y γ = v ϵ k y δ k 1 v ϵ k 1 y δ 1 v ϵ 1 y γ H .
  • This shows that x ( β ) α H . Similarly, if x ( β ) α H , then β α H .
Secondly, suppose that α G contains a unique totally positive cycle β ^ y . By Lemma 3 (iii), x ( β ) ^ v is a totally negative cycle that is obviously contained in α G . Note also, by Lemma 3 (iv), that it cannot be the case that both cycles are contained in α H . Following exactly the same argument of the zero-norm elements above, we conclude that α G is either the disjoint union of α H and β H or is the disjoint union of α H and x ( β ) H , and therefore α G splits into two distinct H-orbits in this case as well.
We have, so far, proved that | O n H | = 2 | O n G | for n 2 . The proof would be complete in this case by applying [10] (Theorem 2.1), which precisely gives the value of | O n G | as follows:
| O n G | = 2 , if   n = 2 4 , if   n = 3 d ( n ) + 2 3 i = 1 ( n 1 ) / 2 [ d ( i 2 + n ) 2 d i ( i 2 + n ) ] , otherwise .
and, moreover, declares the congruence | O n G | 0 ( mod 4 ) for n 3 .
Finally, for the case n = 1 , the only elements of norm zero in Q * ( 1 ) are ± 1 , and both are fixed by x (see the proof of Lemma 3 (v)). We also have by Lemma 4 (i) that α G contains a unique element of norm zero, that is, α G must contain either 1 or 1 but not both. Suppose that 1 α G . If 1 α H , then, by following the argument in the second paragraph of this proof, x ( 1 ) α H . But x ( 1 ) = 1 , a contradiction. Thus, 1 α H . Similarly, if 1 α G , then 1 α H . This shows that α H = α G and hence | O 1 H | = | O 1 G | , which in turn equals 2 (by [10] (Theorem 2.1)). □
Remark 1.
Below, we present some examples showing that the formulas given by [18] (Theorem 9) are incorrect in general (see Claim 3 in Section 3).
1. 
For n = 1 , the number of orbits | O 1 H | given by [18] (Theorem 9) is
2 [ d ( 1 ) + 2 d ( 2 ) 6 ] = 2 [ 1 + 4 6 ] = 2 ,
which is absurd. By Theorem 1, however, | O 1 H | = 2 .
2. 
For n = 21 , the number of orbits | O 21 H | given by [18] (Theorem 9) is
2 [ d ( 21 ) + 2 d ( 22 ) 6 ] = 2 [ 4 + 8 6 ] = 12 .
This estimate immediately appears to be wrong when tested using the congruence relation in Theorem 1. Nonetheless, Theorem 1 gives precisely the following estimate:
| O 21 H | = 2 d ( 21 ) + 4 3 i = 1 10 d ( i 2 + 21 ) 2 d i ( i 2 + 21 ) = 8 + 4 3 { d ( 22 ) 2 d 1 ( 22 ) + d ( 25 ) 2 d 2 ( 25 ) + d ( 30 ) 2 d 3 ( 30 ) + d ( 37 ) 2 d 4 ( 37 ) + d ( 46 ) 2 d 5 ( 46 ) + d ( 57 ) 2 d 6 ( 57 ) + d ( 70 ) 2 d 7 ( 70 ) + d ( 85 ) 2 d 8 ( 85 ) + d ( 102 ) 2 d 9 ( 102 ) + d ( 121 ) 2 d 10 ( 121 ) } = 8 + 4 3 { 4 2 + 3 2 + 8 6 + 2 2 + 4 4 + 4 4 + 8 8 + 4 4 + 8 8 + 3 2 } = 8 + 8 = 16 .
3. 
For n = 26 , the number of orbits | O 26 H | given by ([18], Theorem 9) is
2 [ d ( 26 ) + 2 d ( 27 ) 4 ] = 2 [ 4 + 8 4 ] = 16 .
Theorem 1 gives precisely the following estimate:
| O 26 H | = 2 d ( 26 ) + 4 3 i = 1 12 d ( i 2 + 26 ) 2 d i ( i 2 + 26 ) = 8 + 4 3 { d ( 27 ) 2 d 1 ( 27 ) + d ( 30 ) 2 d 2 ( 30 ) + d ( 35 ) 2 d 3 ( 35 ) + d ( 42 ) 2 d 4 ( 42 ) + d ( 51 ) 2 d 5 ( 51 ) + d ( 62 ) 2 d 6 ( 62 ) + d ( 75 ) 2 d 7 ( 75 ) + d ( 90 ) 2 d 8 ( 90 ) + d ( 107 ) 2 d 9 ( 107 ) + d ( 126 ) 2 d 10 ( 126 ) + d ( 147 ) 2 d 11 ( 147 ) + d ( 170 ) 2 d 12 ( 170 ) } = 8 + 4 3 { 4 2 + 8 4 + 4 2 + 8 6 + 4 4 + 4 4 + 6 6 + 12 10 + 2 2 + 12 12 + 6 6 + 8 8 } = 8 + 16 = 24 .

5. Conclusions

Consider the subgroup H = y , v | y 3 = v 3 = 1 of PSL ( 2 , Z ) = x , y | x 2 = y 3 = 1 , where x : z 1 / z , y : z ( z 1 ) / z , and v = x y x : z 1 / ( z + 1 ) . For a square-free n N , it is shown that the number of orbits in the set
Q * ( n ) = { a + n c Q ( n ) | a , b = a 2 + n c , c Z , c 0 } ,
under the action of H, is given as follows:
2 , if   n = 1 4 , if   n = 2 8 , if   n = 3 2 d ( n ) + 4 3 i = 1 ( n 1 ) / 2 [ d ( i 2 + n ) 2 d i ( i 2 + n ) ] , if   n > 3
and is congruent to 0 modulo 8 for all n 3 , where d ( k ) denotes the number of positive divisors of k, d i ( k ) denotes the number of positive divisors of k that do not exceed i for i , k N with i k , and . is the floor function.

Funding

This research received no external funding.

Data Availability Statement

Data is contained within the article.

Acknowledgments

The author wishes to thank the anonymous reviewers for their valuable comments and suggestions, which improved the quality and readability of the paper.

Conflicts of Interest

The author declares no conflict of interest.

References

  1. Higman, G.; Mushtaq, Q. Coset diagrams and relations for PSL(2, Z ). Arab Gulf J. Sci. Res. 1983, 1, 159–164. [Google Scholar]
  2. Mushtaq, Q. Coset Diagrams for the Modular Group. Ph.D. Thesis, University of Oxford, Oxford, UK, 1983. [Google Scholar]
  3. Mushtaq, Q. Modular group acting on real quadratic fields. Bull. Austral. Math. Soc. 1988, 37, 303–309. [Google Scholar] [CrossRef]
  4. Alolaiyan, H.; Razaq, A.; Yousaf, A.; Zahra, R. A comprehensive overview of the formation of homomorphic copies in coset graphs for the modular group. J. Math. 2021, 2021, 3905425. [Google Scholar] [CrossRef]
  5. Razaq, A.; Alolaiyan, H.; Ahmad, M.; Yousaf, M.; Shuaib, U.; Aslam, W.; Alawida, M. A novel method for generation of strong substitution-boxes based on coset graphs and symmetric groups. IEEE Access 2020, 8, 75473–75490. [Google Scholar] [CrossRef]
  6. Razaq, A.; Yousaf, A.; Shuaib, U.; Siddiqui, N.; Ullah, A.; Waheed, A. A novel construction of substitution box involving coset diagram and a bijective map. Secur. Commun. Netw. 2017, 2017, 5101934. [Google Scholar] [CrossRef]
  7. Shahzad, I.; Mushtaq, Q.; Razaq, A. Construction of new S-boxes using action of the modular group for multimedia security. Secur. Commun. Netw. 2019, 2019, 2847801. [Google Scholar] [CrossRef]
  8. Stothers, W. Subgroups of the modular group. Proc. Camb. Philos. Soc. 1974, 75, 139–154. [Google Scholar] [CrossRef]
  9. Chen, T.; Bari, M.; Malik, M.; Siddiqui, H.; Liu, J.-B. Icosahedral group and classification of PSL(2, Z )-orbits of real quadratic fields. J. Math. 2020, 2020, 9568254. [Google Scholar] [CrossRef]
  10. Deajim, A.; Aslam, M. On the number of orbits arising from the action of PSL(2, Z ) on imaginary quadratic number fields. U.P.B. Sci. Bull. Ser. A 2020, 82, 61–74. [Google Scholar]
  11. Deajim, A. The Hecke group H(λ4) acting on imaginary quadratic number fields. J. Math. 2021, 2021, 9323424. [Google Scholar] [CrossRef]
  12. Malikm, M.; Riaz, M. Orbits of Q *( k 2 m ) under the action of the modular group PSL(2, Z ). U.P.B. Sci. Bull. Ser. A 2012, 74, 109–116. [Google Scholar]
  13. Malik, M.; Zafar, A. Real quadratic irrational numbers and modular group action. Southeast Asian Bull. Math. 2011, 35, 439–445. [Google Scholar]
  14. Mushtaq, Q. On word structure of the modular group over finite and real quadratic fields. Discret. Math. 1998, 178, 155–164. [Google Scholar] [CrossRef]
  15. Razaq, A. Action of of the gorup 〈x, y: x2 = y6 = 1〉 on imaginary quadratic fields. Quasigroups Relat. Syst. 2018, 26, 139–148. [Google Scholar]
  16. Yousaf, A.; Alolaiyan, H.; Razaq, A.; Younis, M. Evolution of ambiguous numbers under the actions of a Binachi group. J. Taibah Univ. Sci. 2020, 14, 615–620. [Google Scholar] [CrossRef]
  17. Ashiq, M.; Mushtaq, Q. Finite presentation of a linear-fractional group. Alg. Colloq. 2005, 12, 585–589. [Google Scholar] [CrossRef]
  18. Ashiq, M.; Mushtaq, Q. Actions of a subgroup of the modular group on an imaginary quadratic field. Quasigroups Relat. Syst. 2006, 14, 133–146. [Google Scholar]
  19. Dummit, D.; Foote, R. Abstract Algebra, 3rd ed.; John Wiley & Sons: Hoboken, NJ, USA, 2004. [Google Scholar]
  20. Ribenboim, P. Classical Theory of Algebraic Numbers; Springer: Berlin/Heidelberg, Germany, 2001. [Google Scholar]
  21. Apostol, T. Modular Functions and Dirichlet Series in Number Theory; Springer: Berlin/Heidelberg, Germany, 1976. [Google Scholar]
  22. Uludaǧ, A. The Modular Group and Its Actions. 2013. Available online: https://math.gsu.edu.tr/uludag/kunming.pdf (accessed on 23 March 2025).
Table 1. The action of x , y , y 2 , v , and v 2 .
Table 1. The action of x , y , y 2 , v , and v 2 .
t a t ( α ) b t ( α ) c t ( α )
x a cb
y a + b 2 a + b + c b
y 2 a + c c 2 a + b + c
v a c c 2 a + b + c
v 2 a b 2 a + b + c b
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Deajim, A. On the Action of a Subgroup of the Modular Group on Imaginary Quadratic Number Fields. Axioms 2025, 14, 335. https://doi.org/10.3390/axioms14050335

AMA Style

Deajim A. On the Action of a Subgroup of the Modular Group on Imaginary Quadratic Number Fields. Axioms. 2025; 14(5):335. https://doi.org/10.3390/axioms14050335

Chicago/Turabian Style

Deajim, Abdulaziz. 2025. "On the Action of a Subgroup of the Modular Group on Imaginary Quadratic Number Fields" Axioms 14, no. 5: 335. https://doi.org/10.3390/axioms14050335

APA Style

Deajim, A. (2025). On the Action of a Subgroup of the Modular Group on Imaginary Quadratic Number Fields. Axioms, 14(5), 335. https://doi.org/10.3390/axioms14050335

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop