Next Article in Journal
The Hubble Tension in Light of the Symmetry of Scale Invariance
Previous Article in Journal
Symmetry Breaking on a Chessboard: 50 Years After Eigen’s and Winkler’s “Laws of the Game”
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Matrices of Tangents and Cotangents and Their Associated Integer Matrices

Department of Mathematics, Silesian University of Technology, Kaszubska 23, 44-100 Gliwice, Poland
*
Author to whom correspondence should be addressed.
Symmetry 2026, 18(1), 206; https://doi.org/10.3390/sym18010206
Submission received: 29 December 2025 / Revised: 16 January 2026 / Accepted: 19 January 2026 / Published: 22 January 2026
(This article belongs to the Section Mathematics)

Abstract

In this paper, we consider certain special sine, tangent, and cotangent symmetric matrices, along with their associated integer matrices. We present interesting relationships that connect these matrices. Relevant examples of the corresponding matrices are also provided, along with several intriguing problems. A separate section includes proofs of the main theorems, which we believe are noteworthy in their own right.

1. Introduction and Main Results

The starting point for the matrices considered in this work, which are exclusively square matrices, was the matrices of sines and cosines, along with the easy-to-determine identities for the determinants of these matrices, presented in Appendix A. The matrices of tangents and cotangents are more difficult to discuss. While seeking analogous formulas for determinants of these matrices, we discovered two families of integer matrices and nontrivial relationships between them and certain matrices of sines. The determinants of these integer matrices belong to the set of modular determinants, which have attracted the attention of mathematicians for a long time [1,2,3,4,5,6]. Modular determinants have subsequently found applications in elementary number theory, computational number theory, cryptography, and bioinformatics. Based on the theory of trigonometric Fourier series, the aforementioned matrices of sines were used to evaluate the sum of some alternating series [7,8,9,10]. Moreover, the matrices studied here provide interesting examples of bounded operators with noteworthy spectra; this topic will be investigated in a separate paper.
Let P be the set of prime numbers, and let p P , p 3 . For any number z Z , let mod p z { 0 , 1 , , p 1 } represent the remainder when dividing z by p, which by definition satisfies p ( z mod p z ) . For z { 1 , 2 , , p 1 } , let inv p z { 1 , 2 , , p 1 } denote the inverse of z modulo p, such that mod p ( z inv p z ) = 1 . Note that because p is prime, the inverse modulo p always exists and is uniquely determined.
First, we will define three families of matrices, namely the matrices of tangents, cotangents, and sines, which are the focus of this paper.
Definition 1. 
Let p P , p 3 . We define the following matrices from M p 1 2 ( R )
T p : = tan i j π p p 1 2 × p 1 2 , C p : = cot i j π p p 1 2 × p 1 2 ,
and
S p : = sin 2 i j π p p 1 2 × p 1 2 .
Clearly, the matrices T p , C p and S p are symmetric. Using these matrices, we define two additional matrices that possess very interesting properties.
Definition 2. 
Let p P , p 3 . The matrices Φ p , Ψ p M p 1 2 ( R ) are defined by the products
Φ p : = 2 p S p T p and Ψ p : = 2 S p C p .
The matrices given by formulas (1) will be referred to as matrices associated with the matrices T p and C p , respectively.
As will be shown later, Φ p contains only 1s, up to a sign, while Ψ p contains, up to a sign, a sequence of numbers 1 , 3 , , p 2 in some order, in every row and every column.
Remark 1. 
Note that the restriction of our discussion to p P , p 3 , is not arbitrary; it is a natural assumption. For example, the matrices T 8 and T 12 do not exist, while the matrices T 6 , T 9 , and T 10 do exist, but
Φ 6 = 2 3 0 1 3 1 , Φ 9 = 1 1 0 1 1 1 0 1 1 1 1 1 1 1 0 1 , Φ 10 = 4 5 0 2 5 0 3 5 1 1 5 1 2 5 0 4 5 0 1 5 1 3 5 1 .
Similarly, the matrices C 9 and C 12 do not exist, while the matrices C 6 , C 8 , and C 10 do exist, but
Ψ 6 = 4 0 2 2 , Ψ 8 = 6 0 2 4 4 4 2 0 6 , Ψ 10 = 8 0 4 0 6 6 2 2 4 0 8 0 2 2 6 6 .
In the definitions of T p , C p , S p , Φ p , and Ψ p for p N P , p 4 , we replace p 1 2 with its integer part p 1 2 . Moreover, it is easy to observe that the matrices T 4 n , where n N , n 2 , do not exist, as nor do the matrices C 3 n , where n N , n 3 . In the first case, this results from the form of the entry in the second row and the n-th column, and in the second case from the form of the entry in the third row and the n-th column.
Before we proceed to the theorems concerning the matrices Φ p and Ψ p , we will define certain mappings based on the concept of remainders modulo p and present a surprising property of one of these mappings.
Definition 3. 
Let p P , p 3 . The mappings
σ p : 1 , 2 , , p 1 2 2 { 1 , 2 , , p 1 } , φ p : 1 , 2 , , p 1 2 2 { ± 1 } , ψ p : 1 , 2 , , p 1 2 2 { ± 1 , ± 3 , , ± ( p 2 ) }
are defined as follows
σ p ( i , j ) = mod p ( 2 i inv p j ) , φ p ( i , j ) = 1 , if σ p ( i , j ) 2 or σ p ( i , j ) + p 2 is even , 1 , if σ p ( i , j ) 2 or σ p ( i , j ) + p 2 is odd , ψ p ( i , j ) = p σ p ( i , j ) , if σ p ( i , j ) is even , σ p ( i , j ) , if σ p ( i , j ) is odd .
Remark 2. 
In this article, by 1 , 2 , , p 1 2 2 we understand the Cartesian product
1 , 2 , , p 1 2 × 1 , 2 , , p 1 2 .
Remark 3. 
The values of the mappings σ p , φ p , and ψ p , where p { 5 , 7 , 11 } , are shown in the tables below (the rows correspond to the first argument and the columns to the second argument).
σ 5 1 2 1 2 4 2 1 2 σ 7 1 2 3 1 2 1 3 2 4 2 6 3 6 3 2 σ 11 1 2 3 4 5 1 2 1 8 6 7 2 4 2 5 1 3 3 6 3 2 7 10 4 8 4 10 2 6 5 10 5 7 8 2 φ 5 1 2 1 1 1 2 1 1 φ 7 1 2 3 1 1 1 1 2 1 1 1 3 1 1 1 φ 11 1 2 3 4 5 1 1 1 1 1 1 2 1 1 1 1 1 3 1 1 1 1 1 4 1 1 1 1 1 5 1 1 1 1 1 ψ 5 1 2 1 3 1 2 1 3 ψ 7 1 2 3 1 5 1 3 2 3 5 1 3 1 3 5 ψ 11 1 2 3 4 5 1 9 1 3 5 7 2 7 9 5 1 3 3 5 3 9 7 1 4 3 7 1 9 5 5 1 5 7 3 9
The symbols for the mappings φ p and ψ p are chosen to be consistent with the matrices Φ p and Ψ p , respectively. Their connection with these matrices will be shown in Theorem 2.
Theorem 1. 
Let p P , p 3 . For any i , j 1 , 2 , , p 1 2 , each of the mappings | ψ p ( i , · ) | and | ψ p ( · , j ) | is a bijection. Specifically, for a fixed i 1 , 2 , , p 1 2 , the mapping
1 , 2 , , p 1 2 j | ψ p ( i , j ) | { 1 , 3 , , p 2 }
is a bijection. Similarly, for a fixed j 1 , 2 , , p 1 2 , the mapping
1 , 2 , , p 1 2 i | ψ p ( i , j ) | { 1 , 3 , , p 2 }
is also a bijection.
Now, we can proceed to the main theorems of this paper.
Theorem 2. 
Let p P , p 3 . Then, Φ p , Ψ p M p 1 2 ( Z ) and the following equalities hold:
Φ p = φ p ( i , j ) p 1 2 × p 1 2 and Ψ p = ψ p ( i , j ) p 1 2 × p 1 2 .
Proposition 1. 
As mentioned earlier, based on the definitions of the mappings φ p and ψ p , and relying on Theorem 1 in the second case, the matrix Φ p , up to a sign, contains only 1s, while the matrix Ψ p , also up to a sign, includes an injective sequence of numbers 1 , 3 , , p 2 in every row and every column. Furthermore, for every p P , p 3 , the diagonals of Φ p and Ψ p form the vectors [ 1 , 1 , , 1 ] and [ p 2 , p 2 , , p 2 ] , respectively. Additionally, the last column of Φ p and the first column of Ψ p contain the vectors [ 1 , 1 , , 1 ] and [ p 2 , p 4 , , 3 , 1 ] , respectively.
Remark 4. 
Consider the explicit forms of the associated matrices Φ 5 , Φ 7 , Φ 11 , Ψ 5 , Ψ 7 , and Ψ 11 :
Φ 5 = 1 1 1 1 , Φ 7 = 1 1 1 1 1 1 1 1 1 , Φ 11 = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 , Ψ 5 = 3 1 1 3 , Ψ 7 = 5 1 3 3 5 1 1 3 5 , Ψ 11 = 9 1 3 5 7 7 9 5 1 3 5 3 9 7 1 3 7 1 9 5 1 5 7 3 9 .
Theorem 3. 
If p P , p 3 , then the following equalities holds:
T p = 2 S p Φ p and C p = 2 p S p Ψ p .
Theorem 4. 
If p P , p 3 , then
det T p = ( 1 ) ( p 1 ) ( p 3 ) 8 p p 1 4 det Φ p and det C p = ( 1 ) ( p 1 ) ( p 3 ) 8 p 1 p 4 det Ψ p .
Remark 5. 
The coefficient ( 1 ) ( p 1 ) ( p 3 ) 8 in Theorem 4 (and also in Lemma 1) is related to the ordering of the rows (or columns) of these matrices. If the rows (or columns) were arranged in reverse order, this coefficient would disappear.
Remark 6. 
Let us note that Theorems 2 and 4 lead to several interesting facts (for any p P , p 3 ):
(a) 
det T p Z p 4 N 3 ;
(b) 
p det T p Z p 4 N 1 ;
(c) 
p p 1 4 det C p Z ;
(d) 
det T p det C p = det Φ p det Ψ p ;
(e) 
the entries of T p and C p are irrational numbers, and det T p depends on det Φ p , while det C p depends on det Ψ p , with the entries of Φ p and Ψ p being integers.
Theorem 5. 
For every p P , p 3 , the following identities hold:
T p C p = Φ p * Ψ p and C p T p = Ψ p * Φ p .
Remark 7. 
Note that the equalities from Theorem 5 are equivalent, since conjugating one equation yields the other.
Remark 8. 
Theorems 3–5 remain valid also for those composite integers p 3 for which the matrices T p and C p exist, when T p , C p , and S p are defined as in Remark 1. Theorems 1 and 2 hold only for prime p 3 , which follows from Definition 3 and the function inv p used there.
Remark 9. 
In the article [11], we find the matrices T ˜ n , C ˜ n M | I n | ( R ) , n N , n 3 , defined as follows:
T ˜ n : = tan i j π n ( i , j ) I n 2 , C ˜ n : = cot i j π n ( i , j ) I n 2 ,
where
I n = m N : m 1 , 2 , , n 1 2 , gcd ( m , n ) = 1 .
The matrices T ˜ n and C ˜ n coincide with the matrices T n and C n , respectively, when n is prime. The formulas for the determinant of T ˜ n and C ˜ n presented in the mentioned article are given from a number-theoretic point of view, as they are described using characters and the Euler totient function φ. More precisely, it is proved that
det T ˜ n = ± n π φ ( n ) 2 χ X n n = 1 χ ( n ) n , det C ˜ n = ± n π φ ( n ) 2 N n χ X n n = 1 χ ( n ) n ,
where X n is the set of odd Dirichlet characters modulo n, and if n = 2 α k , gcd ( 2 , k ) = 1 , α N { 0 } , then
M n : = min { r N : 2 r 1 ( mod k ) } , L n : = φ ( k ) M n , N n : = 1 , if n 0 ( mod 4 ) , ( 2 M n / 2 + 1 ) L n , if n 1 ( mod 2 ) and M n 0 ( mod 2 ) , ( 2 M n 1 ) L n / 2 , if n 1 ( mod 2 ) and M n 1 ( mod 2 ) , ( 2 M n / 2 + 1 ) L n , if n 2 ( mod 4 ) and M n 0 ( mod 2 ) , ( 2 M n 1 ) L n / 2 , if n 2 ( mod 4 ) and M n 1 ( mod 2 ) .

2. Open Problems

We will now extend the results by presenting two problems.
Problem 1. 
Consider the following matrices:
Φ 5 * Ψ 5 = 2 4 4 2 , Φ 7 * Ψ 7 = 3 9 1 1 3 9 9 1 3 ,
and
Φ 11 * Ψ 11 = 5 25 9 7 1 1 5 7 25 9 7 9 5 1 25 9 1 25 5 7 25 7 1 9 5 .
This raises the question of whether there is a simple way to describe the matrix Φ p * Ψ p . It can be hypothesized that for every p P , p 3 , there exists an odd bijection between the corresponding entries of Ψ p and Φ p * Ψ p .
Problem 2. 
Let us examine the following matrices:
Φ 9 = 1 1 0 1 1 1 0 1 1 1 1 1 1 1 0 1
and
Φ 25 = 1 1 1 1 0 1 1 1 1 0 1 1 1 1 1 1 0 1 1 1 1 0 1 1 1 1 1 1 0 1 1 1 1 0 1 1 1 1 1 1 0 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 0 1 1 1 1 1 1 0 1 1 1 1 0 1 1 1 1 1 1 0 1 1 1 1 0 1 1 1 1 1 1 0 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 0 1 1 1 1 1 1 0 1 1 1 1 0 1 1 .
The entries of the matrices Φ 49 , Φ 121 , and Φ 169 (the last of which is indeed very large) are also 1 , 0, and 1, as verified using Wolfram Mathematica software. This naturally raises the question of whether, for every p P , p 3 , the entries of Φ p 2 consist only of the values 1 , 0, and 1. A second, more general question concerns whether there is a simple description of the matrix Φ p 2 .

3. Lemmas and Proofs of Theorems

Proof of Theorem 1. 
To establish the validity of this theorem, it suffices to prove the injectivity of the mentioned mappings because the domain and codomain have the same finite cardinality.
First, fix j 1 , 2 , , p 1 2 and assume that for certain i 1 , i 2 1 , 2 , , p 1 2 , we have
| ψ p ( i 1 , j ) | = | ψ p ( i 2 , j ) | .
If the numbers σ p ( i 1 , j ) and σ p ( i 2 , j ) have the same parity, we get
mod p ( 2 i 1 inv p j ) = mod p ( 2 i 2 inv p j ) .
Thus, there exist r , s Z such that
2 i 1 inv p j + r p = 2 i 2 inv p j + s p 2 ( i 1 i 2 ) inv p j = ( s r ) p ,
where i 1 i 2 0 , ± 1 , ± 2 , , ± p 3 2 . Because ( s r ) p is divisible by p, it follows that 2 ( i 1 i 2 ) inv p j must also be divisible by p, which implies that i 1 = i 2 . Conversely, if σ p ( i 1 , j ) and σ p ( i 2 , j ) have different parity, we obtain
mod p ( 2 i 1 inv p j ) + mod p ( 2 i 2 inv p j ) = p .
Thus, there exist t , u Z such that
2 i 1 inv p j + t p + 2 i 2 inv p j + u p = p 2 ( i 1 + i 2 ) inv p j = ( 1 t u ) p ,
where i 1 + i 2 { 2 , 3 , , p 1 } . This leads to a contradiction, because ( 1 t u ) p is divisible by p, while 2 ( i 1 + i 2 ) inv p j is not.
Next, let i 1 , 2 , , p 1 2 be fixed, and assume for certain j 1 , j 2 1 , 2 , , p 1 2 that
| ψ p ( i , j 1 ) | = | ψ p ( i , j 2 ) | .
If σ p ( i , j 1 ) and σ p ( i , j 2 ) have the same parity, we get
mod p ( 2 i inv p j 1 ) = mod p ( 2 i inv p j 2 ) .
Hence, there exist r , s Z such that
2 i inv p j 1 + r p = 2 i inv p j 2 + s p 2 i ( inv p j 1 inv p j 2 ) = ( s r ) p ,
where inv p j 1 inv p j 2 0 , ± 1 , ± 2 , , ± ( p 2 ) . Because ( s r ) p is divisible by p, then 2 i ( inv p j 1 inv p j 2 ) must also be divisible by p, leading to inv p j 1 = inv p j 2 . By the injectivity of the function inv p , we get j 1 = j 2 . However, if σ p ( i , j 1 ) and σ p ( i , j 2 ) have different parity, then
mod p ( 2 i inv p j 1 ) + mod p ( 2 i inv p j 2 ) = p .
Thus, there exist t , u , v , w Z such that
2 i inv p j 1 + t p + 2 i inv p j 2 + u p = p 2 i ( inv p j 1 + inv p j 2 ) = ( 1 t u ) p 2 i ( j 1 j 2 inv p j 2 + j 2 j 1 inv p j 1 ) = j 1 j 2 ( 1 t u ) p 2 i j 1 ( 1 + v p ) + j 2 ( 1 + w p ) = j 1 j 2 ( 1 t u ) p 2 i ( j 1 + j 2 ) = j 1 j 2 ( 1 t u ) 2 i ( j 1 v + j 2 w ) p ,
where j 1 + j 2 { 2 , 3 , , p 1 } . This scenario also leads to a contradiction, because j 1 j 2 ( 1 t u ) 2 i ( j 1 v + j 2 w ) p is divisible by p, while 2 i ( j 1 + j 2 ) is not divisible by p. □
The proofs of the theorems will involve two lemmas, which follow directly from [7].
Lemma 1. 
Let p P , p 3 . Then, the following holds:
det S p = ( 1 ) ( p 1 ) ( p 3 ) 8 p 4 p 1 4 .
Lemma 2. 
Let p P , p 3 . Then, the following holds:
S p 1 = 4 p S p .
Additionally, we will use the following two trigonometric identities in our proof of the theorems.
Lemma 3. 
Let p P , p 3 . Then, the following identities are satisfied:
k = 1 p 1 2 ( 1 ) k + 1 sin 2 k n π p = 1 2 tan n π p for n Z
and
k = 1 p 1 2 ( p 2 k ) sin 2 k n π p = p 2 cot n π p for n Z p Z .
Proof. 
Using the formula for the product of sine and cosine, we have
2 cos n π p k = 1 p 1 2 ( 1 ) k + 1 sin 2 k n π p = k = 1 p 1 2 ( 1 ) k + 1 sin ( 2 k + 1 ) n π p + sin ( 2 k 1 ) n π p = k = 2 p + 1 2 ( 1 ) k sin ( 2 k 1 ) n π p k = 1 p 1 2 ( 1 ) k sin ( 2 k 1 ) n π p = ( 1 ) p + 1 2 sin ( n π ) + sin n π p = sin n π p ,
which proves (2). Next, using the formula for the product of sine and square sine, namely
4 sin x sin 2 y = sin ( x 2 y ) + 2 sin x sin ( x + 2 y ) ,
we obtain
4 sin 2 n π p k = 1 p 1 2 ( p 2 k ) sin 2 k n π p = k = 1 p 1 2 ( p 2 k ) sin ( 2 k 2 ) n π p + 2 sin 2 k n π p sin ( 2 k + 2 ) n π p = k = 0 p 3 2 ( p 2 k 2 ) sin 2 k n π p + k = 1 p 1 2 2 ( p 2 k ) sin 2 k n π p k = 2 p + 1 2 ( p 2 k + 2 ) sin 2 k n π p = ( p 2 ) sin 0 ( p 4 ) sin 2 n π p + 2 ( p 2 ) sin 2 n π p + 2 sin ( p 1 ) n π p 3 sin ( p 1 ) n π p sin ( p + 1 ) n π p = p sin 2 n π p sin ( p 1 ) n π p sin ( p + 1 ) n π p = 2 p sin n π p cos n π p 2 sin ( n π ) cos n π p = 2 p sin n π p cos n π p ,
which proves (3). □
Remark 10. 
Formula (3) was already proven in [7] using a different method. We present an alternative proof here due to its other assumptions and compatibility with the proof of (2).
Remark 11. 
Lemmas 1 and 2 remain true for all integers p 3 if S p is defined as mentioned in Remark 1. Moreover, Lemma 3 remains valid for all even integers p 3 under the assumption that n Z p Z + 1 2 in (2) and n Z p Z in (3).
Based on the auxiliary results presented above, we are now ready to prove our main theorems.
Proof of Theorem 3. 
From the definitions of the matrices Φ p and Ψ p and from Lemma 2, we have
T p = S p 1 S p T p = 2 S p · 2 p S p T p = 2 S p Φ p
and
C p = S p 1 S p C p = 2 p S p · 2 S p C p = 2 p S p Ψ p ,
which confirms the conclusion of the theorem. □
Proof of Theorem 2. 
We define the auxiliary mappings ε p : 1 , 2 , , p 1 2 2 { ± 1 } and τ p : 1 , 2 , , p 1 2 2 { 1 , 3 , , p 2 } as
ε p ( i , j ) = 1 , if σ p ( i , j ) is even , 1 , if σ p ( i , j ) is odd ,
and
τ p ( i , j ) = | ψ p ( i , j ) | = p σ p ( i , j ) , if σ p ( i , j ) is even , σ p ( i , j ) , if σ p ( i , j ) is odd .
Moreover, we assert that for any i , j 1 , 2 , , p 1 2 the following formulas hold:
φ p ( i , j ) = ε p ( i , j ) ( 1 ) p τ p ( i , j ) 2 + 1 and ψ p ( i , j ) = ε p ( i , j ) τ p ( i , j ) ,
where, in proving the first of these formulas, we use
( 1 ) p τ p ( i , j ) 2 + 1 = ( 1 ) p τ p ( i , j ) 2 = ( 1 ) p ( 1 ) p τ p ( i , j ) 2 = ( 1 ) p + τ p ( i , j ) 2 .
We fix i , j 1 , 2 , , p 1 2 . Because, by Theorem 1, the mapping
1 , 2 , , p 1 2 k τ p ( k , j ) { 1 , 3 , , p 2 }
is a bijection, we infer that the mapping
1 , 2 , , p 1 2 k p τ p ( k , j ) 2 1 , 2 , , p 1 2
is also a bijection, meaning that it is a permutation of the set 1 , 2 , , p 1 2 . Hence, by Lemma 3, assuming n : = i j , and noting that i j p Z , we obtain
k = 1 p 1 2 ( 1 ) p τ p ( k , j ) 2 + 1 sin i j p τ p ( k , j ) π p = 1 2 tan i j π p
and
k = 1 p 1 2 τ p ( k , j ) sin i j p τ p ( k , j ) π p = p 2 cot i j π p .
Next, fix k 1 , 2 , , p 1 2 . If σ p ( k , j ) is even, then there exist α , β Z such that
j p j τ p ( k , j ) 2 k = j p j p mod p ( 2 k inv p j ) 2 k = j p j p ( 2 k inv p j + α p ) 2 k = j p j p + 2 k j inv p j + j α p 2 k = 2 k ( 1 + β p ) + j α p 2 k = ( 2 k β + j α ) p .
The evenness of the number j p j τ p ( k , j ) 2 k implies that j p j τ p ( k , j ) 2 k 2 p Z . Hence, using the difference of sines formula, we get
sin i j p τ p ( k , j ) π p ε p ( k , j ) sin 2 i k π p = 2 sin j p j τ p ( k , j ) 2 k 2 p · i π cos j p j τ p ( k , j ) + 2 k 2 p · i π = 0 .
If σ p ( k , j ) is odd, then there exist γ , δ Z such that
j p j τ p ( k , j ) + 2 k = j p j mod p ( 2 k inv p j ) + 2 k = j p j ( 2 k inv p j + γ p ) + 2 k = j p 2 k j inv p j j γ p + 2 k = j p 2 k ( 1 + δ p ) j γ p + 2 k = ( j 2 k δ j γ ) p .
The evenness of the number j p j τ p ( k , j ) + 2 k implies that j p j τ p ( k , j ) + 2 k 2 p Z . Therefore, using the sum of sines formula, we get
sin i j p τ p ( k , j ) π p ε p ( k , j ) sin 2 i k π p = 2 sin j p j τ p ( k , j ) + 2 k 2 p · i π cos j p j τ p ( k , j ) 2 k 2 p · i π = 0 .
In summary, for each i , j , k 1 , 2 , , p 1 2 , we have
sin i j p τ p ( k , j ) π p = ε p ( k , j ) sin 2 i k π p .
Thus, using (4) and the above identity, Equations (6) and (7) take respectively the forms
k = 1 p 1 2 φ p ( k , j ) sin 2 i k π p = 1 2 tan i j π p
and
k = 1 p 1 2 ψ p ( k , j ) sin 2 i k π p = p 2 cot i j π p
for any i , j 1 , 2 , , p 1 2 . Equivalently, the following identities hold:
T p = 2 S p φ p ( i , j ) p 1 2 × p 1 2 and C p = 2 p S p ψ p ( i , j ) p 1 2 × p 1 2 .
From Theorem 3, these yield
2 S p Φ p = 2 S p φ p ( i , j ) p 1 2 × p 1 2 and 2 p S p Ψ p = 2 p S p ψ p ( i , j ) p 1 2 × p 1 2 .
Because the matrix S p is invertible by Lemma 2, it suffices to conclude the proof. □
Proof of Theorem 4. 
Based on Theorem 3 and the properties of the determinant, we have
det T p = 2 p 1 2 det S p det Φ p
and
det C p = 2 p p 1 2 det S p det Ψ p .
Using Lemma 1, we obtain
det T p = 2 p 1 2 ( 1 ) ( p 1 ) ( p 3 ) 8 p 4 p 1 4 det Φ p = ( 1 ) ( p 1 ) ( p 3 ) 8 p p 1 4 det Φ p
and
det C p = 2 p p 1 2 ( 1 ) ( p 1 ) ( p 3 ) 8 p 4 p 1 4 det Ψ p = ( 1 ) ( p 1 ) ( p 3 ) 8 p 1 p 4 det Ψ p ,
which was to be shown. □
Proof of Theorem 5. 
First, note that T n * = T n , C n * = C n , and S n * = S n . Thus, by Theorem 3 and Lemma 2, it follows that
T p C p = T p * C p = 2 Φ p * S p * · 2 p S p Ψ p = Φ p * S p S p 1 Ψ p = Φ p * Ψ p
and
C p T p = C p * T p = 2 p Ψ p * S p * · 2 S p Φ p = Ψ p * S p S p 1 Φ p = Ψ p * Φ p ,
which was to be proved. □

Author Contributions

Conceptualization, M.R. and R.W.; methodology, M.R. and R.W.; software, M.R.; validation, M.R.; formal analysis, M.R. and R.W.; investigation, R.W.; resources, R.W.; data curation, M.R.; writing—original draft preparation, M.R. and R.W.; writing—review and editing, M.R. and R.W.; visualization, M.R. and R.W.; supervision, M.R. and R.W.; project administration, M.R. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

Data are contained within the article.

Conflicts of Interest

The authors declare no conflicts of interest.

Appendix A

For n N , n 2 , the following identities hold (they have been verified using the Wolfram Mathematica software for n 50 , their proofs are based on the results from article [7] and additional omitted calculations):
det cos i j π n 0 i , j n = ( 1 ) n ( n + 1 ) / 2 n ( n + 1 ) / 2 2 ( n 3 ) / 2 , det cos i j π n 0 i , j n 1 = ( 1 ) n ( n 1 ) / 2 n 2 ( n 1 ) / 2 , det cos i j π n 1 i , j n = ( 1 ) n ( n + 1 ) / 2 n 2 ( n 1 ) / 2 , det sin i j π n 1 i , j n 1 = ( 1 ) ( n 1 ) ( n 2 ) / 2 n 2 ( n 1 ) / 2 , det cos i j π n 1 i , j n 1 = 0 , n 2 N , 2 ( 1 ) n ( n 1 ) / 2 n 2 ( n 3 ) / 2 , n 2 N + 1 , det cos 2 i j π 2 n + 1 0 i , j n = ( 1 ) n ( n + 1 ) / 2 ( 2 n + 1 ) ( n + 1 ) / 2 2 n , det sin 2 i j π 2 n + 1 1 i , j n = ( 1 ) n ( n 1 ) / 2 ( 2 n + 1 ) n / 2 2 n , det cos 2 i j π 2 n + 1 1 i , j n = ( 1 ) n ( n + 1 ) / 2 ( 2 n + 1 ) ( n 1 ) / 2 2 n .
Note that all of the above matrices are symmetric.

References

  1. Turnbull, H.W. On certain modular determinants. Edinb. Math. Notes 1940, 32, 23–30. [Google Scholar] [CrossRef]
  2. Muir, T. A Treatise on the Theory of Determinants; Macmillan: London, UK, 1923; Volumes 1–5. [Google Scholar]
  3. Zhang, F. Matrix Theory. Basic Results and Techniques, 2nd ed.; Springer: New York, NY, USA, 2011. [Google Scholar]
  4. Gantmacher, F.R. The Theory of Matrices; AMS Chelsea Publishing: Providence, RI, USA, 2000; Volumes 1–2. [Google Scholar]
  5. Krattenthaler, C. Advanced determinant calculus. Séminaire Lothar. Comb. 1999, 42, 1–67. [Google Scholar]
  6. Paszkowski, S. Determinantal identities and examples of their applications. Math. Appl. 2005, 33, 3–20. [Google Scholar] [CrossRef]
  7. Różański, M. Determinants of two kinds of matrices whose elements involve sine functions. Open Math. 2019, 17, 1332–1339. [Google Scholar] [CrossRef]
  8. Wituła, R.; Słota, D. On the sum of some alternating series. Comput. Math. Appl. 2011, 62, 2658–2664. [Google Scholar] [CrossRef][Green Version]
  9. Proskuryakov, I.V. Problems in Linear Algebra; Mir: Moscow, Russia, 1978. [Google Scholar]
  10. Bagby, R.; Battaile, M. The determinant of a matrix of sines. Problem 10849. Am. Math. Mon. 2002, 109, 81–82. [Google Scholar] [CrossRef]
  11. Funakura, T. On Kronecker’s limit formula for Dirichlet series with periodic coefficients. Acta Arith. 1990, 50, 59–63. [Google Scholar] [CrossRef]
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

Różański, M.; Wituła, R. Matrices of Tangents and Cotangents and Their Associated Integer Matrices. Symmetry 2026, 18, 206. https://doi.org/10.3390/sym18010206

AMA Style

Różański M, Wituła R. Matrices of Tangents and Cotangents and Their Associated Integer Matrices. Symmetry. 2026; 18(1):206. https://doi.org/10.3390/sym18010206

Chicago/Turabian Style

Różański, Michał, and Roman Wituła. 2026. "Matrices of Tangents and Cotangents and Their Associated Integer Matrices" Symmetry 18, no. 1: 206. https://doi.org/10.3390/sym18010206

APA Style

Różański, M., & Wituła, R. (2026). Matrices of Tangents and Cotangents and Their Associated Integer Matrices. Symmetry, 18(1), 206. https://doi.org/10.3390/sym18010206

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