This converted HTML version may contain rendering inconsistencies. Please refer to the PDF for the authoritative version, or click here to provide feedback.
Report an Issue
Abstract
We introduce Mouanda’s choice function for matrices which allows us to construct the galaxies of sequences of triples of circulant matrices with positive integers as entries. We give many examples of the galaxies of circulant matrices with positive integers as entries. The characterization of the matrix solutions of the equation allows us to show that the equation has no circulant matrix with positive integers as entries solutions. This allows us to prove that, in general, the equation has no circulant matrix with positive integers as entries solutions. We prove Fermat’s Last Theorem for eigenvalues of circulant matrices. Also, we show Fermat’s Last Theorem for complex polynomials over associated to circulant matrices.
Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et generaliter nullam in infinitum ultra quadratum potestatum in duos ejusdem nominis fas est dividere: cujes rei demonstrationem mirabilem sane detexi. Hane marginis exiguitas non caperet.
I. INTRODUCTION AND MAIN RESULT
It is well known that there are many solutions in integers to the equation , for instance (3,4,5); (5,12,13). Around 1500 B.C, the Babylonians were aware of the solution (4961, 6480, 8161) and the Egyptians knew the solutions (148, 2736, 2740) and (514, 66048, 66050). Also Greek mathematicians were attracted to the solutions of this equation. We notice that this equation has sequences of complex number solutions
and matrix solutions
In 1637, Pierre de Fermat wrote a note in the margin of his copy of Diophantus Arithmetica [1] stating that the equation
has no integer solutions. This is the Fermat Last Theorem. He claimed that he had found the proof of this Theorem. The only case Fermat actually wrote down a proof is the case . In his proof, Fermat introduced the idea of infinite descent which is still one the main tools in the study of Diophantine equations. He proved that the equation has no solutions in relatively prime integers with . Solutions to this equation correspond to rational points on the elliptic curve . The proof of the case was given first by Karl Gauss. In 1753, Leonhard Euler gave a different prove of Fermat's Last Theorem for . In 1823, Sophie Germain proved that if is a prime and is also prime, the equation has no solutions (x,y,z) with . The case was proved simultaneously by Adrien Marie Legendre in 1825 [4, 5] and Peter Lejeune Dirichlet [6] in 1832. In 1839, Gabriel Lame proved the case [7, 8, 9, 10]. Between 1840 - 1843, V. A. Lebesque worked on Fermat's Last Theorem [11, 12]. Between 1847 and 1853, Ernst Eduard Kummer published some masterful papers about this Theorem. Fermat's Last Theorem attracted the attention of many researchers and many studies have been developed around this Theorem. For example the work of Arthur Wieferich (1909), Andre Weil (1940), John Tate (1950), Gerhard Frey (1986), who was the first to suggest that the existence of a solution of the Fermat equation might contradict the modality conjecture of Taniyama, Shimura and Weil [29]; Jean Pierre Serre (1985 - 1986) [14, 15, 16], who gave an interested formulation and (with J. F. Mestre) tested numerically a precise conjecture about modular forms and Galois representations mod and proved how a small piece of this conjecture the so-called epsilon conjecture together Modularity Conjecture would imply Fermat's Last Theorem; Kennedy Ribet (1986) [17], who proved Serre's epsilon conjecture, thus reducing the proof of Fermat's Last Theorem; Barry Mazur (1986), who introduced a significant piece of work on the deformation of Galois representations [18, 19]. However, no final proof was given to this Theorem. This Theorem was unsolved for nearly 350 years. In 1995, using Mazur's deformation theory of Galois representations, recent results on Serre's conjecture on the modularity of Galois representations, and deep arithmetical properties of Hecke algebras, Andrew Wiles with Richard Taylor succeeded in proving that all semi-stable elliptic curves defined over the rational numbers are modular. This result is less than the full Shimura-Taniyama conjecture. This result does imply that the elliptic curve given above is modular. Therefore, proving Fermat's Last Theorem [20, 21]. Many mathematicians are still heavenly involved on studying Fermat's Last Theorem [22, 23, 24]. In 2021, Nag introduced an elementary proof of Fermat's
Last Theorem for epsilons[25]. In 2022, Mouanda constructed the galaxies of sequences of triples of positive integers solutions of the equation . The unique characterization of the solutions of this equation allowed him to provide an elementary analytic proof of Fermat's Last Theorem [26]. The Fermat Last Theorem for positive integers has been extended over some number fields. In 1966, Domiaty proved that the equation is solvable in [27]. Let be the group of units of ring . Denote by
In 1989, Vaserstein investigated the question of the solvability of the equation
for matrices of the group [28]. In 1993, Frejman studied the solvability of the equation (1.3) in the set of positive integer powers of a matrix with elements , [29]. In 1995, the same case was studied by Grytczuk [30]. The same year, Khazanov proved that in solutions of the equation (1.3 do not exist if is a multiple of either 21 or 96, and in solutions do not exist if is a multiple of 48 [31]. In 1996, Qin gave another proof of Khazanov's result on the solvability of the equation (1.3) in [32]. In 2002, Patay and Szakacs described the periodic elements in and gave the answer to some problems concerning the equation (1.3) in matrix groups and in irreducible elements of matrix rings [33]. In 2021, Mao-Ting and Jie proved that Fermat's matrix equation has many solutions in a set of 2-by-2 positive semi-definite integral matrices, and has no nontrivial solutions in some classes including 2-by-2 symmetric rational and stochastic quadratic field matrices [34]. Fermat's Last Theorem has been extended to the field of complex polynomials of one variable [35].
This Theorem has many applications in Cryptography.
In this paper, we are mainly concerned with Fermat's Last Theorem for circulant matrices with positive integers as entries. Firstly, we focus our attention on the construction of the galaxies of sequences of triples of circulant matrices with positive integers as entries solutions of the equation . In particular, Mouanda's matrix choice function allows us to construct practical examples of such galaxies. The elementary characterization of these matrix solutions allows us to prove Fermat's Last Theorem for circulant matrices with positive integers as entries.
Theorem 1.1. The equation
has no circulant matrix with positive integers as entries solutions.
We construct a galaxy of sequences of eigenvalues of circulant matrices and we prove Fermat's Last Theorem for eigenvalues of circulant matrices. Also, we construct a galaxy of sequences of complex polynomials over the unit disk associated to circulant matrices and we prove Fermat's Last Theorem for complex polynomials over .
II. PRELIMINARIES
Definition 2.1. Let be a unital Banach algebra. We say that is invertible if there is an element such that . In this case is unique and written . The set
is a group under multiplication. If is an element of , the spectrum of is defined as
and its spectral radius is defined to be
Let be a subset of the set of complex numbers, denote by the following Toeplitz matrix:
This matrix is called a -complex circulant matrix or a complex circulant matrix of order . Denote by the commutative algebra of -complex circulant matrices. Let be a primitive -th root of unity. Let us denote by the following matrix:
This matrix is called Vandermonde matrix. It is well known that this matrix has the following properties:
U is non-singular, unitary, , and . It is well known that all the elements of are simultaneously diagonalized by the same unitary matrix , that is, for in , one has
with is a diagonal matrix with diagonal entries given by the ordered eigenvalues of A: . The factorization is called the spectral factorization of A [36, 37, 38, 39]. It is possible to write the matrix as one variable complex polynomial. Indeed, let be the cyclic permutation -matrix given by
It is simple to see that
Let be the unit disk. The complex polynomial
over is called the associated complex polynomial of the matrix . It follows that if
is a -complex matrix, then
is a -upper complex triangular Toeplitz matrix. The complex polynomial
is also called the associated complex polynomial of the matrix .
III. THE UNIVERSE OF AN ALGEBRA
Definition 3.1. Let be complex numbers. Denote by
The triple is called the triple to the power .
Definition 3.2. Let be complex numbers. Denote by
Definition 3.3. A universe of degree of the algebra is the set of triples of elements of which satisfy the law of stability
The element is called a star (or a planet) of the universe . Every sequence of elements of the universe is called a planet system of elements of .
The set
is called the complex cicutant universe of degree . In particular, the set
is called the natural circulant universe of degree . We are going to show that the universe is not empty. Fermat's Last Theorem for circulant matrices is equivalent to say that
In other words, there are matrix complex universes which don't have triples of matrices of positive integers as entries elements.
IV. MOUANDA'S CHOICE FUNCTION FOR MATRICES
Denote by , the set of complex functions over . Let
be the set of all subsets of . Theorem 2.5 of [26] allows us to claim that the appropriate choice of the values of and such that
leads to the construction of sequences of triples of circulant matrices with positive (or negative) integers as entries which satisfy the equation
Let be the function defined by
This type of function is called Mouanda's choice function for matrices. Mouanda's choice function for matrices is a galaxy valued function. This function allows us to construct galaxies of sequences of matrices.
V. A FINITE GALAXY OF SEQUENCES OF CIRCULANT MATRICES WITH POSITIVE INTEGERS AS ENTRIES
All the galaxies defined in this section have been deduced from the galaxies already introduced in [26].
Definition 5.1. A multi-galaxy is a galaxy which contains other galaxies. The order of a galaxy is the number of variables of the galaxy.
Let
be a -matrix. Denote by , . Let
be a finite set of unitary circulant matrices. The elements of the set satisfy the following:
Denote by
Let
be a complex polynomial over . The Toeplitz matrix
is called the circulant matrix with complex numbers as entries. The polynomial is called associated polynomial of the matrix . Recall that the set is the commutative algebra of -complex circulant matrices. In other words,
It follows that
and
It is quiet clear that
Mouanda's matrix choice function allows us to construct galaxies of circulant matrices. For instance, if we choose , , the model
is called the galaxy of sequences of circulant matrices with positive integers as entries of order 2. For and fixed, the triple
is called the origin of the galaxy . The elements of satisfy
and
with
5.2. A Finite Galaxy of Sequences of Circulant Matrices
The model
is called the finite galaxy of sequences of circulant matrices with positive integers as entries of order 1. The triple is called the origin of the galaxy . The triple
satisfies
and
. The finite galaxy allows the construction of the infinite galaxy
which has the same origin and stability law than . Therefore, we can say that the galaxy is a multi-galaxy.
Assume that and
The triples of the galaxy
\left[ \begin{array}{c} X _ {k} (4 I _ {5}, A) = \left( \begin{array}{l l l l l} 4 & 0 & 0 & 0 & 0 \\0 & 4 & 0 & 0 & 0 \\0 & 0 & 4 & 0 & 0 \\0 & 0 & 0 & 4 & 0 \\0 & 0 & 0 & 0 & 4 \end{array} \right) + 4 \left( \begin{array}{l l l l l} 0 & 0 & 1 & 0 & 0 \\0 & 0 & 0 & 1 & 0 \\0 & 0 & 0 & 0 & 1 \\1 & 0 & 0 & 0 & 0 \\0 & 1 & 0 & 0 & 0 \end{array} \right) ^ {k} \\Y _ {k} (4 I _ {5}, A) = 4 \left( \begin{array}{l l l l l} 0 & 0 & 1 & 0 & 0 \\0 & 0 & 0 & 1 & 0 \\0 & 0 & 0 & 0 & 1 \\1 & 0 & 0 & 0 & 0 \\0 & 1 & 0 & 0 & 0 \end{array} \right) ^ {\boldsymbol {k}} + 2 \left( \begin{array}{l l l l l} 0 & 0 & 1 & 0 & 0 \\0 & 0 & 0 & 1 & 0 \\0 & 0 & 0 & 0 & 1 \\1 & 0 & 0 & 0 & 0 \\0 & 1 & 0 & 0 & 0 \end{array} \right) ^ {2 k} \\Z _ {k} (4 I _ {5}, A) = 4 I _ {5} + 4 \left( \begin{array}{l l l l l} 0 & 0 & 1 & 0 & 0 \\0 & 0 & 0 & 1 & 0 \\0 & 0 & 0 & 0 & 1 \\1 & 0 & 0 & 0 & 0 \\0 & 1 & 0 & 0 & 0 \end{array} \right) _ {\boldsymbol {k}} ^ {\boldsymbol {k}} + 2 \left( \begin{array}{l l l l l} 0 & 0 & 1 & 0 & 0 \\0 & 0 & 0 & 1 & 0 \\0 & 0 & 0 & 0 & 1 \\1 & 0 & 0 & 0 & 0 \\0 & 1 & 0 & 0 & 0 \hskip - 2. c m / s _ {k} \end{array} \right) ^ {2 k} \\(X _ {0} (4 I _ {5}, A), Y _ {0} (4 I _ {5}, A), Z _ {0} (4 I _ {5}, A)) = (8 I _ {5}, 6 I _ {5}, 1 0 I _ {5}) \\X _ {1} (4 I _ {5}, A) = 4 I _ {5} + 4 T _ {2} \\Y _ {1} (4 I _ {5}, A) = 4 T _ {2} + 2 T _ {4} \\Z _ {1} (4 I _ {5}, A) = 4 I _ {5} + 4 T _ {2} + 2 T _ {4} \end{array} \right]
satisfy the equation
and
. Again, from the galaxy , we can construct a galaxy which has an infinite number of elements. Indeed, the galaxy
has the same origin and stability law than the galaxy . This galaxy has an infinite number of elements.
The elements of the galaxy
satisfy
and
. The galaxy has a finite number of elements (or planets). However, the galaxy
has an infinite number of elements (or planets).
Example 5.3. Assume that . We can define the galaxy
in which the triples , satisfy
and
Example 5.4. A Finite Galaxy
The triples , of the galaxy
satisfy
and
Example 5.5. Assume that with
The triples of the galaxy
satisfy
and
VI. -MODEL
The triples of the galaxy
satisfy
and
. The multi-galaxy has an infinite number of planets.
Example 6.1. The triples of the galaxy
and
Example 6.2. The triples of the sequence
satisfy
and
VII. POWER MODELS OF GALAXIES OF SEQUENCES OF CIRCULANT MATRICES WITH POSITIVE INTEGERS AS ENTRIES OF ORDER 3
A model of a galaxy is a power model if the power of the lead of the model is a power. For example, if we choose and , the model
is a power model. The elements of the model satisfy
and
Example 7.1. The elements of the galaxy
satisfy
and
Example 7.2. If we choose and , we could construct the galaxy
The elements of the galaxy satisfy
. The galaxy
has an infinite number of planet systems.
The characterization of the elements of the set is completely the same as the characterization of the elements of the set [26].
Remark 7.3. Let and be two elements of . Then
Let us observe that the characterization of one element of the set allows us to deduce the characterization of the elements of the set . In other words, the set has no power elements. Remark 7.3 allows us to prove the following result:
Theorem 7.4. The equation
has no circulant matrix with positive integers as entries solutions.
Proof. Assume that there exist such that
This means that
Therefore,
Remark 7.3 allows us to claim that we have a contradiction because the universe has no power elements. Finally, there exist no circulant matrices with positive integers as entries such that
This result allows to claim that the equation
has no solution in . We can now prove our main result.
Proof of Theorem 1.1
We just need to show that if , then . Let be an element of the universe . Then
This implies that
and
Theorem 7.4 and Remark 7.3 allow us to claim that
and
since has no power elements. In other words,
and
The fact that
implies that
VIII. EIGENVALUES OF CIRCULANT MATRICES
It is well known that if , where is a compact Hausdorff space, then for all . Let
be a complex polynomial over . Then .
The Spectral Mapping Theorem 1. [40]. Let be a normal bounded linear operator on the Hilbert space and let be a continuous function on . Then .
Let us introduce the well-known spectrum of circulant matrices associated to complex polynomials over . Let
be a complex polynomial over . Let
be an -matrix. The matrix is normal. Indeed, . Assume that
A simple calculation shows that
The matrix is considered as a polynomial of one variable. Let us compute the spectrum of the normal matrix P. Let
be the characteristic polynomial of . Thus, is a primitive -th root of unity. Therefore,
In other words,
Finally,
The spectral mapping Theorem allows us to claim that
Therefore,
IX. GALAXY OF SEQUENCES OF EIGENVALUES OF CIRCULANT MATRICES
In this section, we construct galaxies of sequences of eigenvalues of circulant matrices.
Theorem 9.1. Let be three circulant matrices with complex numbers as entries such that
Then
In other words, the triples . That is, the planet system
Proof: Let , be an element of the universe . The spectral factorization of the matrices [36, 37, 38] allows us to claim that there exists a unitary matrix such that
and
The equation implies
We can claim that
Finally,
In other words, the triples . That is, the planet system
Every triple of the universe generates a planet system which has exactly elements of the universe . We can say that the galaxies of sequences of circulant matrices are linked to the galaxies of sequences of eigenvalues of circulant matrices. Let us consider the galaxies
of circulant matrices. We can construct the galaxies of sequences of eigenvalues of the triples of circulant matrices of the galaxies . For example, the galaxies
are galaxies of sequences of eigenvalues of triples of circulant matrices of the galaxies . As we can see that the galaxies
have each a finite number of planet systems. In our case, each galaxy has planet systems. Every galaxy of the universe generates a new galaxy of eigenvalues of elements of . Let us consider the galaxy
We know that the triples of the galaxy satisfy
Define the galaxy
The triples of the galaxy satisfy
We can deduce the galaxies
which have a finite number of planet systems. The triples of the galaxy also satisfy
The first eigenvalue of every matrix of is a positive integer.
Theorem 9.2. Let be a circulant matrix with positive integers as entries. Then the first eigenvalue of is a positive integer. In other words, .
Proof. Let
be a circulant matrix with positive integers as entries. Then there exists a polynomial
such that
We know that
with
Therefore,
Remark 9.3. Let be an algebra and let . Then
Theorem 9.1 and Theorem 9.2 allow us to provide another proof of our main result.
Second Proof of Theorem 1.1
Assume that there exist , three circulant matrices with positive integers as entries such that
Theorem 9.1 and Theorem 9.2 allow us to claim that
This implies that the equation has positive integer solutions. We have a contradiction. Therefore, the equation
has no circulant matrix with positive integers as entries solutions.
Let be an algebra and let
be the algebra of polynomials over . Complex polynomials of the algebra allow us to provide Fermat's Last Theorem for eigenvalues of circulant matrices.
Theorem 9.4. The equation
has no positive integer eigenvalues of circulant matrices solutions.
Proof. Assume that there exists a triple of positive integer eigenvalues of circulant matrices and of such that
Therefore, there exist three complex polynomials of such that
In particular,
with the cyclic permutation -matrix given by
In other words,
We have a contradiction. Finally, The equation
has no positive integer eigenvalues of circulant matrices solutions.
X. FERMAT'S LAST THEOREM FOR COMPLEX POLYNOMIALS ASSOCIATED TO CIRCULANT MATRICES
We can now construct models of galaxies of complex polynomials associated to circulant matrices. Recall that
The galaxies of the universe generate the galaxies of the universe . For example, from the galaxy , we can construct the galaxy
We can continue doing the same identification process with the remaining galaxies of . This process will lead to the construction of the universe . Now, we are able to provide Fermat's Last Theorem for complex polynomials over the unit disk associated to circulant matrices of the set .
Theorem 10.1. The equation
has no solutions in .
Proof. Assume that there exists a triple of complex polynomials of the set , such that
This implies that
with the cyclic permutation -matrix given by
In other words, there exist such that
We have a contradiction. Finally, The equation
has no solutions in .
Theorem 1.1, Theorem 9.4 and Theorem 10.1 are equivalent.
References
40 Cites in Article
Alexandria Diophantus (2014). Diophantus of Alexandria and Arithmetica.
L Euler (2020). E-98: Theorematum quorundam arithmeticorum demonstrationes.
L Euler (1770). Vollstandige Anleitung zur Algebra.
A Legendre (1823). Recherches sur quelques objets d'analyse indeterminee, et particulierement sur the theoreme de Fermat.
A Legendre (1830). Didot, Firmin.
P Dirichlet (1832). Démonstration du théorème de Fermat pour le cas des 14ièmes puissances..
G Lame (1839). THÉORIE DES NOMBRES. – Mémoire sur de nouvelles formules relatives à la théorie des polynômes radicaux, et sur le dernier theoreme de Fermat..
G Lame (1840). Memoire d'analyse indeterminee demontrant que l'equation x 7 + y 7 = z 7 est impossible en nombres entiers.
G Lame (1847). Memoire sur la resolution en nombres complexe de l'equation A 5 + B 5 + C 5 = 0.
G Lame (1865). Comptes Rendus Hebdomadaires des Seances de L'Academie des Sciences.
V Lebesque (1840). Demonstration de l'impossibilite de resoudre l'equation x 7 + y 7 + z 7 = 0 est impossible en nombres entiers.
V Lebesque (1843). Theoremes nouveaux sur l'equation indeterminee x 5 +y 5 = az 5.
G Frey (1986). Links between stable elliptic curves and certain Diophantine equations.
Jean-Pierre Serre (1972). Propri�t�s galoisiennes des points d'ordre fini des courbes elliptiques.
Jean-Pierre Serre (1987). Sur les représentations modulaires de degré 2 de Gal(Q¯/Q).
J Serre (1996). Travaux de Wiles (et Taylor).
K Ribet (1990). On modular representations of $$(\bar Q/Q)$$ arising from modular forms.
B Mazur (1987). Deforming Galois Representations.
Barry Mazur (1977). Modular curves and the Eisenstein ideal.
Richard Taylor,Andrew Wiles (1995). Ring-Theoretic Properties of Certain Hecke Algebras.
Andrew Wiles (1995). Modular Elliptic Curves and Fermat's Last Theorem.
C Breuil,B Conrad,F Diamond,R Taylor (2001). On the modularity of elliptic curves over : wild 3-adic exercices.
Brian Conrad,Fred Diamond,Richard Taylor (1999). Modularity of certain potentially Barsotti-Tate Galois representations.
Fred Diamond (1996). On Deformation Rings and Hecke Rings.
Bibek Nag (2021). An Elementary Proof of Fermat’s Last Theorem for Epsilons.
Joachim Mouanda (2022). On Fermat’s Last Theorem and Galaxies of Sequences of Positive Integers.
R Domiaty (1966). Solutions of x 4 + y 4 = z 4 in 2 × 2 Integral Matrices.
L Veserstein (1989). Noncommutative number theory.
D Frejman (1993). On Fermat's in the set of Fibonacci matrices.
Aleksander Grytczuk (1995). On Fermat's equation in the set of integral 2×2 matrices.
A Khazanov (1995). Fermat's equation in matrices.
H Qin (1996). Fermat's problem and Goldbach problem over Mn( ).
Z Patay,A Szakacs (2002). On Fermat's problem in matrix ring and groups.
Mao-Ting Chien,Jie Meng (2021). Fermat's equation over 2-by-2 matrices.
Enrico Laeng (1999). On Fermat's Last Theorem for Polynomials.
P Davis (1979). John Wiley & Sons, Inc..
P Davis (1994). Circulant Matrices.
P Davis (2013). Circulant Matrices.
D Geller,I Kra,S Popescu,S Simanca (2002). On circulant matrices.
No ethics committee approval was required for this article type.
Data Availability
Not applicable for this article.
How to Cite This Article
Joachim Moussounda Mouanda, Kinvi Kangni, Jean Raoul Tsiba. 2026. "On Fermat’s Last Theorem Matrix Version and Galaxies of Sequences of Circulant Matrices with Positive Integers as Entries". Global Journal of Science Frontier Research - F: Mathematics & Decision GJSFR-F Volume 22 (GJSFR Volume 22 Issue F2).
Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.
Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.