%%%%%%%%%%% \documentclass[12pt]{article} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \usepackage{amssymb,amsmath} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \topmargin -13.0mm %% upper-space \oddsidemargin 4.0mm %% left-space \evensidemargin 0mm %% \textheight 226.0mm %% 223.0mm %% \textwidth 157.0mm %% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \newtheorem{LL}{Lemma} \newtheorem{TT}{Theorem} \newtheorem{CC}{Corollary} \newtheorem{PP}{Proposition} \newtheorem{DD}{Definition} \newtheorem{EE}{Example} \newtheorem{RR}{Remark} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \newcommand{\Ad} %%% Adele {\mathbb{A}} \newcommand{\adele} %%% adele {\textrm{ad\`{e}le }} \newcommand{\Adele} %%% Adele {\textrm{Ad\`{e}le }} \newcommand{\adeles} %%% adeles {\textrm{ad\`{e}les }} \newcommand{\alpharho} %%% ALPHA in terms of RHO {\tilde{\rho}} \newcommand{\arcsec} %%% ARCSEC {\mathrm{arcsec}} \newcommand{\bs} %%% BackSlash {\backslash} \newcommand{\C} %%% Code {{\cal C}} \newcommand{\cct} %%% Complex Conjugate Transpose {\mathsf{H}} \newcommand{\cfld} %%% Complex FieLD {\mathbb{C}} \newcommand{\Cfld} %%% Complex FieLD {\mathbb{C}} \newcommand{\CFT} %%% class field tower {\textrm{class field tower}} \newcommand{\cn} %%% Complex Normal distribution {{\cal CN}} \newcommand{\code} %%% CODE {{\cal C}} \newcommand{\Coker} %%% Cokernel {\mathrm{Coker}} \newcommand{\conv} %%% convex hull {\mathrm{conv}} \newcommand{\coxeter} %%% COXETER {\mathrm{coxeter}} \newcommand{\cv} %%% Constellation V {{\cal V}} \newcommand{\dfnt} %%% DeFiNiTion {\stackrel{\mathrm{def}}{=}} \newcommand{\dH} %%% distance Hamming {d_\mathrm{H}} \newcommand{\diag} %%% DIAGonal matrix {\mathrm{diag}} \newcommand{\dist} {\mbox{dist}} \newcommand{\emb} {\hookrightarrow} \newcommand{\eof} %%% End Of a prooF {\hspace*{\fill}~\(\Box\)\par\endtrivlist\unskip} \newcommand{\even} %%% EVEN {\mathrm{even}} \newcommand{\FF} %%% Finite Field {\mathbb{F}} \newcommand{\Fq} %%% F_q {\mathbb{F}_q} \newcommand{\fro} %%% dissimilarity by FRObenius norm {\mathrm{euc}} \newcommand{\Gal} %%% Galois {\mathrm{Gal}} \newcommand{\idele} %%% idele {\textrm{id\`{e}le }} \newcommand{\Idele} %%% Idele {\textrm{Id\`{e}le }} \newcommand{\ideles} %%% ideles {\textrm{id\`{e}les }} \newcommand{\idx} %%% InDeX {{\cal I}} \newcommand{\iffi} %%% IF and only IF (FI) {\textrm{if and only if }} \newcommand{\ifld} %%% Integer FieLD %% ring {\mathbb{Z}} \newcommand{\imag} %%% IMAGinary part {\mathrm{Im}} \newcommand{\Image} %%% IMAGinary part {\mathrm{Im}} \newcommand{\iso} %%% isomorphic to {\cong} \newcommand{\IU} %%% Imaginary Unit {\boldsymbol{i}} \newcommand{\Ker} %%% Kernel {\mathrm{Ker}} \newcommand{\lf} %%% LFloor {\lfloor} \newcommand{\lgl} %%% LAngle {\langle} \newcommand{\Li} %%% Logarithmic integral {\mathrm{Li}} \newcommand{\mc} {\mathcal} \newcommand{\mcn}[1] { \multicolumn{1}{|c}{#1} } \newcommand{\mf} {\mathfrak} \newcommand{\msqrt}[1] %%% M times SQuaRTure {\sqrt[\leftroot{-4} \uproot{2} M]{#1}} \newcommand{\msqrts}[1] %%% M times SQuaRTure with Smaller \root {\sqrt[\leftroot{-1} \uproot{2} M]{#1}} \newcommand{\mx} %%% MboX {\mbox{ }} \newcommand{\nequiv} %% Not EQUIValent {\equiv\!\!\!\!\!/} \newcommand{\nfld} %%% Natural number FieLD %% not really field {\mathbb{N}} \newcommand{\Nfld} %%% Natural number FieLD %% not really field {\mathbb{N}} \newcommand{\NKQ} %%% norm from K to Q {\mathrm{N}_{K/\mathbb{Q}}} \newcommand{\NLQ} %%% norm from L to Q {\mathrm{N}_{L/\mathbb{Q}}} \newcommand{\norm} %%% Norm of a nonzero ideal {\mathfrak{N}} \newcommand{\odd} %%% ODD {\mathrm{odd}} \newcommand{\ol} %%% OverLine {\overline} \newcommand{\p} {\phantom{-}} \newcommand{\Pfld} %%% Places of K {\mathbb{P}} \newcommand{\prob} %%% PROBability of an event {\Pr}%%%{\mathrm{Prob}} \newcommand{\proj} {\mbox{Proj}} \newcommand{\Qfld} %%% Rational FieLD {\mathbb{Q}} \newcommand{\rank} %%% RANK of a matrix {\mathrm{rank}} \newcommand{\rankin} %%% RANKIN {\mathrm{rankin}} \newcommand{\real} %%% REAL part {\mathrm{Re}} %\newcommand{\Res} %%% Cauchy residue %\mathop{\mathrm{Res}} %{\mathrm{Res}} \newcommand{\rf} %%% RFloor {\rfloor} \newcommand{\rgl} %%% RAngle {\rangle} \newcommand{\rfld} %%% Real FieLD {\mathbb{R}} \newcommand{\Rfld} %%% Real FieLD {\mathbb{R}} \newcommand{\RGV} %%% R_Gilbert_Varshamov {R_\mathrm{GV}(\delta,q)} \newcommand{\rt} %%% Real Transpose {\mathsf{T}} \newcommand{\scode} %%% Spherical CODE {\mathrm{code}} \newcommand{\sgn} %%% SiGNum function {\mathrm{sgn}} \newcommand{\smsqrt}[1] %%% Small M times SQuaRTure {\sqrt[\leftroot{-2} \uproot{4} 2m]{#1}} \newcommand{\smsqrts}[1] %%% Small M times SQuaRTure with Smaller \root {\sqrt[\leftroot{-2} \uproot{2} 2m]{#1}} \newcommand{\spack} %%% Sphere PACKing {\mathrm{pack}} \newcommand{\tr} %%% TRace {\mathrm{Tr}} \newcommand{\ve} %%% varepsilon {\varepsilon} \newcommand{\vol} %%% volume {\mathrm{vol}} \newcommand{\Wtilde} %%% WideTilde {\widetilde} \newcommand{\wt} %%% weight {\mathrm{wt}} \newcommand{\xpct} %%% eXPeCTation of an RV {\mathbf{E}} \newcommand{\zfld} %%% Z FieLD {\mathbb{Z}} \newcommand{\Zfld} %%% Z FieLD {\mathbb{Z}} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \newcommand{\threeDvectorright}[3] { \left( \begin{array}{r} {#1} \\ {#2} \\ {#3} \end{array} \right) } \newcommand{\ninemtrxrrr}[9] { \left( \begin{array}{rrr} {#1} & {#2} & {#3} \\ {#4} & {#5} & {#6} \\ {#7} & {#8} & {#9} \end{array} \right) } %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \linespread{1.2} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \begin{document} { \title{ \vspace{-1.39cm} \Large \bf On the Diophantine equation \(ab + bc + ca = N\) and Euler's idoneal numbers} \author{ {\small \vspace{-0.3cm} Xue-Bin Liang} } \date{} \maketitle \vspace{-0.6cm} \begin{abstract} %\footnotesize In this paper, it is proved that every natural number since \(1849\) can be represented as \(ab+bc+ca\) with three distinct positive integers \(a\), \(b\) and \(c\). A~positive integer \(N\) is an Euler's idoneal number if and only if it cannot be written as \(ab+bc+ca\) for distinct positive integers \(a\), \(b\) and \(c\). Consequently, the number \(1848\) is the largest Euler's idoneal number, which was conjectured by Euler in~1778 and Gauss in the {\em Disquisitiones Arithmeticae}. \end{abstract} } %%%%%%%%% \section{Introduction} \label{sec:introduction} The Diophantine equation \(ab + bc + ca = N\) in three variables \(a\), \(b\) and \(c\) is a classic ternary quadratic form studied extensively. For instance, the number of solutions in positive integers \(a\), \(b\) and \(c\) of the equation, where \(N\) is a given positive integer, was investigated by Mordell~\cite{bib:mordell1923a} in 1923. In this paper, we will prove the following solvability result. \begin{TT} Every natural number \(N\geq 1849\) can be represented as \begin{equation} N = ab+bc+ca \label{eqn:Mordelleqn1849} \end{equation} where \(a\), \(b\) and \(c\) are three distinct positive integers. \label{thrm:Mordellthrm1849} \end{TT} In other words, Theorem~\ref{thrm:Mordellthrm1849} tells that every even number \(2N\geq 3698\) is the surface area, i.e., the sum of areas of the six faces, of a right rectangular prism with three {\em distinct} edge lengths \(a\), \(b\) and~\(c\), which has the value of \(2ab+2bc+2ca\). The Diophantine equation \(ab + bc + ca = N\) in {\em distinct} positive integers \(a\), \(b\) and \(c\) for a given positive integer \(N\) has the significance that its {\em nonexistence} of a solution is a characterization of a natural number \(N\) to be an Euler's idoneal number (see the survey paper by Kani~\cite[p.~125]{bib:kani2011a}). Idoneal numbers were discovered by Euler~\cite{bib:euler1778a} around~1778 who used them to find large prime numbers. However, not every natural number is suitable for his method and hence Euler gave the name {\em numeri idonei} (i.e., suitable or convenient numbers) to those numbers that are suitable for testing the primality of large integers. Euler listed the following 65 idoneal numbers: \[ %\left( \begin{array}{rrrrr} {1}&{16} &{48}& {120}&{312} \\ {2}&{18}&{57}&{ 130}&{ 330} \\ {3}& {21}& {58}& {133}& {345} \\ {4}& {22}& {60}& {165}& {357}\\ {5}& {24}& {70}& {168}& {385}\\ {6}& {25} &{72}& {177} &{408} \\ {7}& {28}& {78}& {190} &{462}\\ {8}& {30}& {85}& {210} &{520}\\ {9}& {33} &{88}& {232}& {760} \\ {10}& {37}& {93} &{240}& {840}\\ {12}& {40}& {102}& {253} &{1320}\\ {13}& {42}& {105}& {273} &{1365} \\ {15}& {45}& {112}& {280}& {1848} \end{array} %\right) \] %% 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 15, 16, 18, 21, 22, 24, 25, 28, 30, 33, 37, 40, 42, 45, 48, 57, 58, 60, 70, 72, 78, 85, 88, 93, 102, 105, 112, 120, %% 130, 133, 165, 168, 177, 190, 210, 232, 240, 253, 273, 280, 312, 330, 345, 357, 385, 408, 462, 520, 760, 840, 1320, 1365, and 1848 Euler discovered that there are 65 idoneal numbers among all positive integers \(N \leq 10000\). Using the largest one 1848 in the list, Euler proved that \(18518809 = 18480000+197^2\) is prime by showing that it has a single representation in the form \(1848x^2 + y^2\) (see Weil~\cite[p.~225]{bib:weil1964a}). Idoneal numbers were later investigated by Gauss~\cite{bib:gauss1986a} in the {\em Disquisitiones Arithmeticae}. In the language of Gauss's theory of quadratic forms, idoneal numbers correspond to discriminants where there is only one class of binary quadratic forms per genus. Gauss also identified the 65 idoneal numbers (see \cite[Article 303]{bib:gauss1986a}). Euler and Gauss conjectured that this list of 65 idoneal numbers is complete, i.e., that there would not be any more idoneal number for all \(N > 10000\). In 1973, Weinberger~\cite{bib:weinberger1973a} showed that there are at most {\em two} other larger idoneal numbers if they exist, with help of a result due to D. H.~Lehmer (see~\cite[p.~119]{bib:weinberger1973a}). It is obvious that if \(ab + bc + ca = N\), then \((2a)(2b) + (2b)(2c) + (2c)(2a) = 4N\). So, in case that \(4N\) is one other larger idoneal number for some natural number \(N\), then \(N\) is another. Therefore, there exist 65, 66, or 67 idoneal numbers. By Theorem~\ref{thrm:Mordellthrm1849} and Euler's list of 65 idoneal numbers, we obtain \begin{TT} The number \(1848\) is the largest Euler's idoneal number. \label{thrm:eulergaussthrm2026} \end{TT} This theorem says that the list of 65 idoneal numbers is complete and hence the conjecture of Euler and Gauss is confirmed. %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \section{Outline of the proof of Theorem~\ref{thrm:Mordellthrm1849}} \label{sec:outline} In this paper, we will prove the following two propositions. \begin{PP} Every squarefree positive integer \(N > 1365\) with \(N \equiv 1 \pmod {4}\) can be represented as \begin{equation} N = ab+bc+ca \label{eqn:modFOURresidueONE} \end{equation} where \(a\), \(b\) and \(c\) are three distinct positive integers. \label{prop:modFOURresidueONE} \end{PP} \begin{PP} Every squarefree positive integer \(N > 462\) with \(N \equiv 2 \pmod {4}\) can be represented as \begin{equation} N = ab+bc+ca \label{eqn:modFOURresidueTWO} \end{equation} where \(a\), \(b\) and \(c\) are three distinct positive integers. \label{prop:modFOURresidueTWO} \end{PP} In the work of Grube~\cite{bib:grube1874a} published in 1874, Euler’s results on idoneal numbers were analyzed and extended by employing Gauss’s theory of binary quadratic forms. There are other definition and criterion of an idoneal number that are not the same as but equivalent to Euler’s original definition (see Weil~\cite[Chapter~III, Section~\S X]{bib:weil1964a}). Grube proved the following elementary criterion for Euler's idoneal number (see also Frei~\cite[p.~57, Theorem~14]{bib:frei1985a} and Kani~\cite[p.~204, Proposition~17]{bib:kani2011a}). \begin{LL} {\em (Grube’s criterion)} A natural number \(N \geq 3\) is an idoneal number if and only if for every \(b=1, \cdots, \lfloor\sqrt{N/3}\rfloor\) and every factorization \begin{equation} N +b^2 = ac \mbox{ with } c \geq a \geq 2b \label{eqn:GrubeCriterionO} \end{equation} we have that either \(a=c\) or \(a=2b\). \label{lemma:GrubeCriterion} \end{LL} By putting \(b = x\), \(a = x + y\) and \(c = x+z\) in Grube’s criterion, we see that a natural number \(N \geq 3\) is an idoneal number if and only if the Diophantine equation \[ xy + yz + zx = N \] has no solution in {\em distinct} positive integers \(0 < x < y < z\). Based on Grube's and Euler's results as surveyed by Kani~\cite[Section~2.3]{bib:kani2011a}, the classification of large idoneal numbers is readily available as follows (see~\cite[p.~203, Corollary~14]{bib:kani2011a}). \begin{PP} If a natural number \(N > 1848\) is an idoneal number, then \(N \not\equiv 3 \pmod {4}\). Moreover, if \(N \equiv 1, 2 \pmod {4}\), then \(N\) is squarefree, whereas if \(N \equiv 0 \pmod {4}\), then \(M=N/4\) is a squarefree idoneal number with \(M \equiv 2 \pmod {4}\). \label{prop:GrubeEulerClassify} \end{PP} For example, if \(N > 1848\) and \(N = 4L + 3\) for some positive integer \(L\), then \(N\) can be expressed as \(N=xy+yz+zx\) with \(x=1\), \(y=3\), and \(z=L>3\) and thus \(N\) is {\em not} an idoneal number. It follows easily from the above Propositions~\ref{prop:modFOURresidueONE},~\ref{prop:modFOURresidueTWO} and~\ref{prop:GrubeEulerClassify} that every natural number \(N > 1848\) cannot be an idoneal number and hence Theorem~\ref{thrm:Mordellthrm1849}. In the remainder of this paper, we are going to prove Propositions~\ref{prop:modFOURresidueONE} and~\ref{prop:modFOURresidueTWO}, which, together with the established classification result in Proposition~\ref{prop:GrubeEulerClassify}, can imply Theorem~\ref{thrm:Mordellthrm1849}. %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \section{An equivalent assertion of Propositions~\ref{prop:modFOURresidueONE} and~\ref{prop:modFOURresidueTWO}} \label{sec:equivalent} In this section, we provide one assertion which is equivalent to Propositions~\ref{prop:modFOURresidueONE} and~\ref{prop:modFOURresidueTWO} for every squarefree positive integer \(N>10000\), thanks to Euler's result in the range \(N \leq 10000\) in which Propositions~\ref{prop:modFOURresidueONE} and~\ref{prop:modFOURresidueTWO} are accordingly true. Define \(r_3(n) \) to be the number of representations of a nonnegative integer \(n\) as a sum of three squares and let \(q\) be a nonzero complex number with \(|q| <1\). Define the generating function \[ R_3(q) = \sum_{n=0}^{\infty} r_3(n) (-q)^n = \left( \sum_{m\in\Zfld} (-1)^m q^{m^2} \right)^3. \] In his work regarding mock theta functions of Ramanujan, Andrews found the following representation for \(R_3(q)\) by using theory of \(q\)-series (see~\cite[p.~124, Eqn. (5.16)]{bib:andrews1986a}) \begin{equation} \sum_{n=0}^{\infty} (-1)^n r_3(n) q^n = 1+4\sum_{n=1}^{\infty} \frac{(-1)^n q^n}{1+q^n} -2\sum_{n=1}^{\infty} \sum_{|j| N/d\), we choose \(x=N/d\) and \(x+2y=d\), i.e., \(y=(d-N/d)/2\). It is clear that \(x \equiv 1, 3 \pmod {4}\) implying \(x^2 \equiv 1 \pmod {4}\). Thus, \(2xy=N-x^2\) implies \(2xy \equiv 0 \pmod {4}\) and hence \( 2 \mid y\) and \(x \neq y\). Noting the symmetry in \((d,N/d)\) and \((N/d,d)\), we see that \[ \sum_{ \substack{x \neq y \\ x^2+2xy=N} } 1 = 2^{L-1}. \] Since \(\omega(N)=L\), the identity (\ref{eqn:MortensonOne}) implies (\ref{eqn:SquarefreeOne}). Therefore, the proof is complete. \eof \begin{CC} For every squarefree positive integer \(N \geq 6\) with \(N \equiv 2 \pmod {4}\), we have \begin{equation} r_3(N) = 12 \cdot 2^{\omega(N)-1} + 24\sum_{ \substack{x < y < z \\ xy+yz+zx=N} } 1 \label{eqn:SquarefreeTwo} \end{equation} where every summation index integer \(x\), \(y\) or \(z\) is positive. \label{corollary:SquarefreeTwo} \end{CC} {\em Proof:} Let \(N=2p_1' \cdots p_L'\), where \(p_1', \cdots, p_L'\) are \(L\) distinct {\em odd} primes. Then, \(N/2=p_1' \cdots p_L'\) and it is obvious that \[ \sum_{d \mid (N/2)} 1 = 2^L. \] Noting that \(\omega(N)=L+1\), the identity (\ref{eqn:MortensonTwo}) implies (\ref{eqn:SquarefreeTwo}). The proof is complete. \eof Corollaries~\ref{corollary:SquarefreeOne} and~\ref{corollary:SquarefreeTwo} together imply the following \begin{PP} For every squarefree positive integer \(N >10000\) with \(N \equiv 1, 2 \pmod {4}\), we have \begin{equation} r_3(N) = 12\cdot2^{\omega(4N)-1} + 24\sum_{ \substack{x < y < z \\ xy+yz+zx=N} } 1 \label{eqn:CombinedOneTwo} \end{equation} where every summation index integer \(x\), \(y\) or \(z\) is positive and \(\omega(4N)\) is the number of distinct prime factors of \(4N\). \label{prop:CombinedOneTwo} \end{PP} The determination of \(r_3(N)\) is a major topic in representations of integers as sums of squares (see Bateman~\cite{bib:bateman1951a} and Grosswald's book~\cite[Chapter~4]{bib:grosswald1985a}). According to Gauss's theorem (\cite[p.~51]{bib:grosswald1985a}) and an equality regarding \(r_3(N)\) (see \cite[Eqn.~(4.8), p.~53]{bib:grosswald1985a}), let \(h(-4N)\) stand for the number of classes of primitive binary quadratic form corresponding to the discriminant \(D=-4N\), then, for every {\em squarefree} positive integer \(N >10000\) with \(N \equiv 1, 2 \pmod {4}\), \begin{equation} r_3(N)=12 \cdot h(-4N). \label{eqn:determinationofr3nbyh4N} \end{equation} Set the Kronecker symbol \(\chi(n)=\big(\frac{D}{n}\big)\) with \(D=-4N\) for every {\em squarefree} positive integer \(N >10000\) with \(N \equiv 1, 2 \pmod {4}\). Define the corresponding \(L\)-series \[ L(s,\chi)=\sum_{n=1}^{\infty} \frac{\chi(n) }{n^s} \] for \(s>0\). According to Dirichlet's theorem (\cite[p.~56]{bib:grosswald1985a}), if \(h(-4N)\) is the number of classes of primitive binary quadratic form \(ax^2+2bxy+cy^2\) with \(N=ac-b^2\), then \begin{equation} h(-4N) = \frac{2\sqrt{N}}{\pi} L(1,\chi). \label{eqn:Dirichletforh4N} \end{equation} There are connection and correspondence between the theory of classes of equivalent quadratic forms and the theory of ideals in quadratic fields (see Davenport's book~\cite[pp.~51--53]{bib:davenport1980a}). According to the analytic class number formula for an arbitrary algebraic number field (see, e.g., Neukirch~\cite[p.~467]{bib:neukirch1999a}), let \(h_K\) be the class number of an imaginary quadratic field \(K = \Qfld(\sqrt{D})\) with \(D=-4N<0\) for every {\em squarefree} positive integer \(N >10000\) with \(N \equiv 1, 2 \pmod {4}\), we have as a special case the following result (see, e.g.,~\cite[p.~391]{bib:montgomery2006a}), \begin{equation} h_K= \frac{w\sqrt{|D|}}{2\pi} L(1,\chi) \label{eqn:class number formula} \end{equation} where \(w\) denotes the number of roots of unity in the imaginary quadratic field \(K\). Since \(w=2\) for \(D<-4\), we see from (\ref{eqn:Dirichletforh4N}) and (\ref{eqn:class number formula}) that \begin{equation} h_K= h(-4N)= \frac{\sqrt{|D|}}{\pi} L(1,\chi). \label{eqn:hKformula} \end{equation} Therefore, by using (\ref{eqn:determinationofr3nbyh4N}), from Proposition~\ref{prop:CombinedOneTwo} we can deduce the following \begin{PP} For every squarefree positive integer \(N >10000\) with \(N \equiv 1, 2 \pmod {4}\), let \(h_K\) be the class number of the imaginary quadratic field \(K = \Qfld(\sqrt{D})\) with \(D=-4N<0\), we have \begin{equation} h_K = 2^{\omega(4N)-1} + 2\sum_{ \substack{x < y < z \\ xy+yz+zx=N} } 1 \label{eqn:ImaginaryQuadraticField} \end{equation} where every summation index integer \(x\), \(y\) or \(z\) is positive. Consequently, we have \(h_K \geq 2^{\omega(4N)-1}\) with equality if and only if the Diophantine equation \( xy + yz + zx = N \) has no solution in {\em distinct} positive integers \(0 < x < y < z\) for the given number \(N\). \label{prop:ImaginaryQuadraticField} \end{PP} It is now ready to demonstrate that Propositions~\ref{prop:modFOURresidueONE} and~\ref{prop:modFOURresidueTWO} in the range \(N>10000\) is equivalent to the following assertion. \begin{PP} For every squarefree positive integer \(N >10000\) with \(N \equiv 1, 2 \pmod {4}\), let \(h_K\) be the class number of the imaginary quadratic field \(K = \Qfld(\sqrt{D})\) with \(D=-4N<0\), we have \begin{equation} h_K \neq 2^{\omega(4N)-1}. \label{eqn:EquivalentPropositionOneTwo} \end{equation} \label{prop:EquivalentPropositionOneTwo} \end{PP} In fact, if \(h_K\neq 2^{\omega(4N)-1}\), then, from Proposition~\ref{prop:ImaginaryQuadraticField}, we have \(h_K > 2^{\omega(4N)-1}\) and hence~\(N\) can be expressed as \( N=xy + yz + zx\) for some three distinct positive integers \(x\), \(y\) and \(z\). Conversely, if \(N\) can be written as \( N=xy + yz + zx\) with \(0 < x < y < z\), it follows from (\ref{eqn:ImaginaryQuadraticField}) that \(h_K > 2^{\omega(4N)-1}\) and hence \(h_K\neq 2^{\omega(4N)-1}\). Thus, the assertion of Proposition~\ref{prop:EquivalentPropositionOneTwo} is equivalent to Proposition~\ref{prop:modFOURresidueONE} together with Proposition~\ref{prop:modFOURresidueTWO}. In the remainder of this paper, we are going to prove Proposition~\ref{prop:EquivalentPropositionOneTwo}, which implies Propositions~\ref{prop:modFOURresidueONE} and~\ref{prop:modFOURresidueTWO} and, in turn, Theorem~\ref{thrm:Mordellthrm1849} as shown in Section~\ref{sec:outline}. %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \section{Reduction of range in Proposition~\ref{prop:EquivalentPropositionOneTwo} by existing numerical results for imaginary quadratic fields} \label{sec:reduction} Let \(N >10000\) be a squarefree positive integer with \(N \equiv 1, 2 \pmod {4}\). In this scenario, the imaginary quadratic field \(K = \Qfld(\sqrt{-N})\) has the fundamental discriminant \(D=-4N<0\) and \(K = \Qfld(\sqrt{D})\). Let \(I_K\) denote the multiplicative group of nonzero fractional ideals of \(K\), and \(P_K\) its subgroup of nonzero principal fractional ideals of \(K\). The quotient group \(I_K/P_K\), denoted by \(Cl_K\), is called the ideal class group of \(K\), which is a {\em finite} abelian group. The order of the ideal class group \(Cl_K\) is called the class number of \(K\), denoted by \(h_K=\#Cl_K\). On the contrary we assume that \begin{equation} \#Cl_K = 2^{\omega(4N)-1}. \label{eqn:contraryofEquivalentPropositionOneTwo} \end{equation} By Lagrange's theorem in group theory, any subgroup \(H\) of the finite group \(Cl_K\) must divide the order of the group, namely, \(\#H \mid \#Cl_K\), and hence \(\#H =2^m\) for some nonnegative integer \(m\). By the structure theorem for finite abelian groups (see, e.g.,~\cite{bib:hungerford1974a}), the ideal class group \(Cl_K\) is isomorphic to a unique direct product of a collection of cyclic groups. Then, we have \[ Cl_K \cong \Zfld_{2^{m_1}} \times \cdots \times \Zfld_{2^{m_r}} \] where \(r \geq 1\) and \(m_1\), \(\cdots\), \(m_r\) are nonnegative integers with \(0\leq m_1\leq \cdots \leq m_r\) and \(m_r \geq 1 \). The direct product can be rewritten as \begin{equation} Cl_K \cong {\Zfld_2}^{a_1} \times {\Zfld_{2^2}}^{a_2} \cdots \times {\Zfld_{2^t}}^{a_t} \label{eqn:directproductClK} \end{equation} where \(t \geq 1\) and \(a_1\), \(\cdots\), \(a_t\) are nonnegative integers with \(a_t \geq 1 \). Here, \(a_\ell\) denotes the number of occurrences of \(\Zfld_{2^\ell}\) in the direct product for \(1\leq \ell \leq t\). By genus theory, \(a_1+\cdots+a_t=\omega(|D|)-1\), where \(D=-4N\) is the discriminant of the field \(K\) (see~\cite[p.~222]{bib:lsenhans2020a}). It follows from (\ref{eqn:contraryofEquivalentPropositionOneTwo}) and (\ref{eqn:directproductClK}) that \[ 2^{\omega(4N)-1} =\#Cl_K =2^{a_1} \cdot 2^{2a_2} \cdots 2^{ta_t} \geq 2^{a_1+\cdots+a_t}\cdot 2^{(t-1)a_t} =2^{\omega(|D|)-1}\cdot 2^{(t-1)a_t}. \] So, there must be \(t=1\) and \(a_t = \omega(|D|)-1\). Hence, from (\ref{eqn:directproductClK}), \begin{equation} Cl_K \cong {\Zfld_2}^{\omega(|D|)-1}. \label{eqn:directproductOnlyOneCase} \end{equation} Due to the computational work by Mosunov and Jacobson~\cite{bib:mosunov2016a} in 2016, we know that up to \(2^{40}\) the largest in its absolute value of the fundamental discriminant \(D\) with \(Cl_K\) isomorphic to \( {\Zfld_2}^{\ell} \) for some positive integer \(\ell\) is \( D =-5460\). Since (\ref{eqn:contraryofEquivalentPropositionOneTwo}) implying~(\ref{eqn:directproductOnlyOneCase}) and \(N=|D|/4\), we see that Proposition~\ref{prop:EquivalentPropositionOneTwo} is true in the range up to \(N \leq 2^{38}\). The range has been further expanded owing to the computational work by Elsenhans, Kl\"{u}ners and Nicolae~\cite{bib:lsenhans2020a} in 2020. They showed that for imaginary quadratic fields \(K = \Qfld(\sqrt{D})\) with discriminant \(D<0\) up to \(|D| \leq 3.1 \cdot 10^{20} \), the largest one in its absolute value with \(Cl_K\) isomorphic to \( {\Zfld_2}^{\ell} \) for some positive integer \(\ell\) is still \( D =-5460\). As a result, Proposition~\ref{prop:EquivalentPropositionOneTwo} is true in the range up to \(N \leq 7.5 \cdot 10^{19} \). Thanks to the existing numerical works in~\cite{bib:mosunov2016a} and~\cite{bib:lsenhans2020a}, it suffices to prove Proposition~\ref{prop:EquivalentPropositionOneTwo} for every squarefree positive integer \(N >7.5 \cdot 10^{19} \) with \(N \equiv 1, 2 \pmod {4}\). In the following two sections, we will prepare to develop an explicit lower bound for the class number \(h_K\) of the imaginary quadratic field \(K = \Qfld(\sqrt{-N})\) for such \(N\). Then, we will provide a proof of Proposition~\ref{prop:EquivalentPropositionOneTwo} and, in turn, Theorem~\ref{thrm:Mordellthrm1849}. %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \section{An explicit Hecke's theorem} \label{sec:lowerboundLseries} Let \(N\) be any given squarefree positive integer with \(N >7.5 \cdot 10^{19} \) and \(N \equiv 1, 2 \pmod {4}\). Based on the class number formula (\ref{eqn:hKformula}) for the imaginary quadratic field \(K = \Qfld(\sqrt{D})\) with \(D=-4N<0\), an available lower bound for \(L(1,\chi)\) will induce a lower bound for the class number \(h_K\) of the quadratic field \(K\), and vice versa. In 1918 Hecke \cite{bib:hecke1918a} demonstrated a fundamental link between the real zeros of Dirichlet \(L\)-functions for the quadratic Dirichlet characters and the class numbers of imaginary quadratic fields. An effective Hecke's theorem was proved by Mahler~\cite[p.~302, Theorem~2]{bib:mahler1934a} in 1934 as stated below (see also Friedlander and Iwaniec~\cite[p.~344]{bib:friedlander2018a}). \begin{TT} {\em (Hecke's theorem)} Suppose that \(g\) is a positive constant and that the integer \(d>1\) is greater than a certain number \(d_1\) which depends only on \(g\). Then, if the \(L\)-series denoted by \(L_d(s)\) has no zero in the interval \[ 1 - \frac{g}{\log d} \leq s \leq 1, \] there exists a number \(G>0\), depending only on \(g\), such that the class number \(h\) of \(\Qfld(\sqrt{-d})\) satisfies \[ h \geq G \frac{\sqrt{d}}{\log d}. \] \label{thrm:HeckeTheorem} \end{TT} For the application in this paper, an {\em explicit} Hecke's theorem is needed. There have been some results in the respect and, in particular, those proved by Tatuzawa~\cite{bib:tatuzawa1951a} in 1951 and by Hoffstein~\cite{bib:hoffstein1980a} in 1980. In the following, we are going to establish an explicit Hecke's theorem with a different and rigorous proof which employs algebraic number theory to obtain {\em explicit} constants best suited for the forthcoming application. Let \(K\) be an algebraic number field with degree \(m=[K:\Qfld]\) over the field \(\Qfld\) of rational numbers. We denote by \(O_K\) the ring of integers of \(K\) and by \(\Delta_K\) the discriminant of~\(O_K\) over the ring \(\zfld\) of rational integers. If \(K\) has \(r\) real embeddings and \(t\) pairs of complex conjugate embeddings, then we have \(r+2t = m\). We let \(\sigma_1, \cdots,\sigma_r: K\emb\rfld\) be the \(r\) real embeddings and \(\sigma_{r+1}, \ol{\sigma_{r+1}},\cdots,\sigma_{r+t}, \ol{\sigma_{r+t}}: K\emb\cfld\) the \(t\) pairs of complex conjugate embeddings of \(K\). For each \(a\in K\), the field norm \(\NKQ(a)\in \Qfld\) is defined to be (see, e.g.,~\cite[p.~49]{bib:stewart2002a}) \[ \NKQ(a) = \sigma_1(a) \cdots \sigma_r(a) \sigma_{r+1}(a) \ol{\sigma_{r+1}}(a) \cdots \sigma_{r+t}(a)\ol{\sigma_{r+t}}(a). \] It is clear that, for \(a\in K\) and \(b\in K\), we have \(\NKQ(ab)=\NKQ(a)\NKQ(b)\). If \(a\neq 0\), then \(\NKQ(a)\neq 0\). If \(a\in O_K\), then \(\NKQ(a)\in \Zfld\). If \(a\in \Qfld\), then \(\NKQ(a)=a^{[K:\Qfld]}=a^m\). Let \(\mf{a}\) be a nonzero integral ideal of \(O_K\). Then, the quotient ring \(O_K/\mf{a}\) is finite. The norm of \(\mf{a}\) is defined by \(\norm(\mf{a}) = |O_K/\mf{a}|\). If \(\mf{p}\) is a nonzero prime ideal of \(O_K\), then the residue ring \(O_K/\mf{p}\) is a finite field, which is called the residue class field of \(O_K\) modulo \(\mf{p}\). The norm of \(\mf{p}\) is \(\norm(\mf{p}) = |O_K/\mf{p}|\) being a prime power. If \(\mf{a}\) and \(\mf{b}\) are nonzero integral ideals of \(O_K\), then \(\norm(\mf{a}\mf{b}) = \norm(\mf{a})\norm(\mf{b})\). Note that the norm of the nonzero principal ideal \(\mf{a}=aO_K\) is equal to the absolute value of the field norm \(\NKQ(a)\) \cite[Corollary~5.10]{bib:stewart2002a}, i.e., if \(a\in O_K\) with \(a\neq 0\), then \(\norm(aO_K) = |\NKQ(a)|\). Therefore, if \(a\in O_K\) with \(a\neq 0\) and \(\mf{b}\) is a nonzero integral ideal of \(O_K\), then \(\norm(a\mf{b}) =\norm(aO_K\mf{b})=\norm(aO_K)\norm(\mf{b})= |\NKQ(a)|\norm(\mf{b})\). The Dedekind zeta function \(\zeta_K(s)\) of \(s\in\Cfld\) with \(\real(s)>1\) for the number field \(K\) is defined by \begin{equation} \zeta_K(s) = \sum_{\mf{a}} \frac{1}{{\norm(\mf{a})}^s} = \prod_{\mf{p}} \frac{1}{1-{\norm(\mf{p})}^{-s}} \label{eqn:EulerIdentity} \end{equation} where \(\mf{a}\) varies over the nonzero integral ideals of \(K\) and \(\mf{p}\) runs through the nonzero prime ideals of \(K\). The infinite product over all nonzero prime ideals \(\mf{p}\) of \(O_K\) is the Euler product of the field \(K\). It is known that the Dedekind zeta function \(\zeta_K(s)\) can be analytically continued to \(\Cfld \setminus \{1\}\) and that it has a simple pole at \(s=1\) (see \cite[p.~467]{bib:neukirch1999a}). In the following, we specify \(K = \Qfld(\sqrt{D})\) with \(D=-4N<0\) for the given squarefree positive integer \(N >7.5 \cdot 10^{19} \) with \(N \equiv 1, 2 \pmod {4}\). The field \(K\) is an imaginary quadratic field with discriminant \(\Delta_K=D\), thus \(\Delta_K\) is a {\em fundamental discriminant}. According to \cite[Theorem~2.2.15]{bib:cohen2007a}, the Kronecker symbol \(\big(\frac{\Delta_K}{n}\big)\), \(n\in \Zfld\), defines a real primitive Dirichlet character modulo \(|\Delta_K|=|D|=4N\). We note that if \( n = p\), \(p\) an odd prime, then the Kronecker symbol \(\big(\frac{\Delta_K}{n}\big)\) has the same value as that of the Legendre symbol \(\big(\frac{\Delta_K}{p}\big)\). Note that for an odd prime \(p\) and an integer \(a\in\Zfld\), the Legendre symbol \(\big(\frac{a}{p}\big)\in\{-1,0,1\}\) is function of \(a\) and \(p\) defined as \(0\) when \(p\mid a\) and \(\pm 1\) depending on whether \(a\) is a quadratic residue modulo \(p\) when \(p\nmid a\). It is well known that, for a prime \(p\in \Zfld\), the principal ideal \(p O_K\) decomposes in \(O_K\) as follows. If \(p\mid |\Delta_K|\), then \(p\) ramifies in \(O_K\) and \(p O_K = \mf{p}^2 \) where \(\mf{p}\) is a prime ideal. In this case, \(\big(\frac{\Delta_K}{p}\big)=0\). In particular, since \(2\mid |\Delta_K|\), we have \(\big(\frac{\Delta_K}{2}\big)=0\) and \(2 O_K = \hat{\mf{p}}^2 \), where \(\hat{\mf{p}} \mid 2\) is the prime ideal of \(O_K\) lying over the prime number \(2\in\Zfld\). If \(p\) is an odd prime and \(\big(\frac{\Delta_K}{p}\big)=1\), then \(p\) splits completely in \(O_K\) and \(p O_K = \mf{p}_1\mf{p}_2 \) where \(\mf{p}_1\) and \(\mf{p}_2\) are two different prime ideals. If \(p\) is an odd prime and \(\big(\frac{\Delta_K}{p}\big)=-1\), then \(p\) is inert in \(O_K\) and \(\mf{p} = p O_K\) itself is a prime ideal of \(O_K\). Let \(\chi(n)=\big(\frac{\Delta_K}{n}\big)\) be the real primitive Dirichlet character of \(K\) and \(L(s,\chi)\) be the corresponding Dirichlet \(L\)-function. According to the above decomposition rule and the Euler product in (\ref{eqn:EulerIdentity}), we can obtain \begin{equation} \zeta_K(s) = \zeta(s) L(s,\chi) \label{eqn:DedekindRiemannDirichlet} \end{equation} for \(s\in\Cfld\) with \(\real(s)>1\), where \(\zeta(s)\) is the Riemann zeta function. The Riemann zeta function \(\zeta(s)\) is a meromorphic function on the whole complex plane, which is holomorphic everywhere except for a simple pole at \(s=1\) with residue~\(1\). Since \(\chi\) is nonprincipal and primitive, Dirichlet \(L\)-function \(L(s,\chi)\) is entire on the whole complex plane \(s\in\Cfld\). Thus, the above relation (\ref{eqn:DedekindRiemannDirichlet}) can be employed as an alternative approach to providing the same analytic continuation of \(\zeta_K(s)\) defined in (\ref{eqn:EulerIdentity}) to \(\Cfld \setminus \{1\}\) which has a simple pole at \(s=1\) with residue~\(L(1,\chi)\). It is known that \(L(1,\chi)\neq 0\) (see~\cite[Theorem~6.20]{bib:apostol1976a}). Remind that \(K = \Qfld(\sqrt{\Delta_K})\) is an imaginary quadratic field with discriminant \(\Delta_K=-4N<0\). Let \[ \xi_K(s) =\left( \frac{|\Delta_K|}{4\pi^2} \right)^{s/2} \Gamma(s) \zeta_K(s) \] where \(\Gamma(s)\) is the gamma function. It is known that \(\xi_K(s)\) satisfies the following functional equation (see Stark~\cite[p.~965]{bib:stark1975a}) \[ \xi_K(1-s)=\xi_K(s). \] Therefore, the functional equation for \(\zeta_K(s)\) is given by \begin{equation} \Gamma(1-s) \zeta_K(1-s) = \left( \frac{|\Delta_K|}{4\pi^2} \right)^{s-1/2} \Gamma(s) \zeta_K(s). \label{eqn:DedekindFunctionalEquation} \end{equation} We need to use the following lemma (see Ingham~\cite[p.~31]{bib:ingham1934a}). \begin{LL} If \(k\) is a positive integer, \(c>0\), \(y>0\), then \begin{equation} \frac{1}{2\pi i}\int_{c-i\infty}^{c+i\infty} \frac{y^s}{s(s+1)\cdots(s+k)}ds = \left\{ \begin{array}{ll} {0}, & {\mbox{ if } y < 1,} \\ {\frac{1}{k!}\left(1-\frac{1}{y}\right)^k}, & {\mbox{ if } y \geq 1.} \end{array} \right. \label{eqn:InghamBook} \end{equation} \label{lemma:InghamBook} \end{LL} Lemma~\ref{lemma:InghamBook} implies the following result. \begin{LL} If \(k\) is a positive integer with \(k\geq 2\), \(c>0\), \(y>0\), then \begin{equation} \frac{1}{2\pi i}\int_{c-i\infty}^{c+i\infty} \frac{y^s}{s(s+2)\cdots(s+k)}ds = \left\{ \begin{array}{ll} {0}, & {\mbox{ if } y < 1,} \\ {\frac{1}{k!}\left(1-\frac{1}{y}\right)^{k-1} \left(1+\frac{k-1}{y}\right)}, & {\mbox{ if } y \geq 1.} \end{array} \right. \label{eqn:IntegralLemmaOne} \end{equation} \label{lemma:IntegralLemmaOne} \end{LL} In fact, noticing that \(\frac{1}{s} = \frac{1}{s(s+1)} + \frac{1}{s+1}\) and using the change of variable, for \(y\geq 1\) the integral in (\ref{eqn:IntegralLemmaOne}) equals \[ \frac{1}{k!}\left(1-\frac{1}{y}\right)^k+\frac{1}{y}\frac{1}{(k-1)!}\left(1-\frac{1}{y}\right)^{k-1} = \frac{1}{k!}\left(1-\frac{1}{y}\right)^{k-1} \left(1-\frac{1}{y}+\frac{k}{y}\right). \] Since \(L(1,\chi)\neq 0\), there exists a number \(\beta\in (0,1)\) such that \(L(s,\chi) \neq 0\) for \(s\) in the interval \([\beta, 1)\). Note that the series \(\zeta_K(s)\) in (\ref{eqn:EulerIdentity}) converges absolutely and uniformly in the domain \(\real(s) \geq 1+\delta\) for every \(\delta > 0\) and that \(\zeta_K(s) = \zeta(s) L(s,\chi)\). For a given number \(y>1\), we consider the following complex integral \begin{equation} \mc{I}= \frac{1}{2\pi i}\int_{2-\beta-i\infty}^{2-\beta+i\infty} \frac{\zeta_K(s+\beta) y^s}{s\prod_{\ell=2}^9(s+\ell)} ds =\sum_{\norm(\mf{a})\leq y} \frac{1}{{\norm(\mf{a})}^\beta}\frac{1}{9!}\left(1-\frac{\norm(\mf{a})}{y}\right)^8\left(1+8\frac{\norm(\mf{a})}{y}\right) \label{eqn:ComplexIntegral} \end{equation} where we choose \(c=2-\beta>1\) and \(k=9\) in Lemma~\ref{lemma:IntegralLemmaOne}. It is clear that \(\mc{I}\) is a real number. Let \(T\geq 2\) be any given truncation parameter and the complex variable \(s=\sigma + it\). Define the function \begin{equation} f(s) = \frac{\zeta_K(s+\beta) y^s}{s\prod_{\ell=2}^9(s+\ell)} = \frac{\zeta(s+\beta) L(s+\beta,\chi) y^s}{s\prod_{\ell=2}^9(s+\ell)} \label{eqn:Functionfs} \end{equation} in the rectangle \(\mc{R}\) with \(-1-\beta \leq \sigma \leq 2-\beta\) and \(-T \leq t \leq T\). It is seen that \(f(s)\) has two poles in \(\mc{R}\) at \(s=0\) and \(s=1-\beta\in (0,1)\). Using Cauchy's residue theorem, we obtain \begin{equation} \frac{1}{2\pi i} \left\{ \int_{2-\beta-iT}^{2-\beta+iT} -\int_{-1-\beta+iT}^{2-\beta+iT} -\int_{-1-\beta-iT}^{-1-\beta+iT} +\int_{-1-\beta-iT}^{2-\beta-iT} \right\} f(s)ds = \mathop{\mathrm{Res}}_{s = 0} f(s) + \mathop{\mathrm{Res}}_{s = 1-\beta} f(s). \label{eqn:CauchyResidue} \end{equation} We can prove that the second and fourth integrals in (\ref{eqn:CauchyResidue}) will approach~\(0\) as \(T\to \infty\). \begin{LL} For a given number \(\beta\in (0,1)\) and the function \(f(s)\) given in (\ref{eqn:Functionfs}), we have \begin{equation} \lim_{T\to\infty} \int_{-1-\beta+iT}^{2-\beta+iT}f(s)ds = \lim_{T\to\infty} \int_{-1-\beta-iT}^{2-\beta-iT}f(s)ds =0. \label{eqn:IntegralLemmaTwo} \end{equation} \label{lemma:IntegralLemmaTwo} \end{LL} {\em Proof:} See Appendix~A. % The proof is complete. \eof For the given number \(y>1\), we consider the following complex integral \begin{equation} \mc{J}= \frac{1}{2\pi i}\int_{-1-\beta-i\infty}^{-1-\beta+i\infty} \frac{\zeta_K(s+\beta) y^s}{s\prod_{\ell=2}^9 (s+\ell)} ds. \label{eqn:SecondComplexIntegral} \end{equation} Noting (\ref{eqn:ComplexIntegral}), (\ref{eqn:IntegralLemmaTwo}) and (\ref{eqn:SecondComplexIntegral}) and taking the limit \(T\to\infty\) in (\ref{eqn:CauchyResidue}), we can obtain \begin{equation} \mc{I}=\mc{J}+\mathop{\mathrm{Res}}_{s = 0} f(s) + \mathop{\mathrm{Res}}_{s = 1-\beta} f(s). \label{eqn:ComplexIntegralANDCauchyResidue} \end{equation} Since the class number \(h_K \geq 1\), we see from the class number formula (\ref{eqn:hKformula}) that \[ L(1,\chi) = h_K \frac{\pi}{\sqrt{|D|}} > 0. \] Hence, \(L(s,\chi) > 0\) for \(s\) in the interval \([\beta, 1)\). Therefore, we have \[ \mathop{\mathrm{Res}}_{s = 0} f(s) = \frac{1}{9!} \zeta_K(\beta) =\frac{1}{9!} \zeta(\beta) L(\beta,\chi) < 0. \] Note that \(\zeta(s)\) has a simple pole at \(s=1\) with residue~\(1\). We get \[ \mathop{\mathrm{Res}}_{s = 1-\beta} f(s) = \frac{L(1,\chi)}{1-\beta} \frac{y^{1-\beta}}{\prod_{\ell=2}^9 (1-\beta+\ell)} <\frac{y^{1-\beta}}{9!} \frac{L(1,\chi)}{1-\beta}. \] We can deduce from (\ref{eqn:ComplexIntegralANDCauchyResidue}) that the complex integral \(\mc{J}\) defined in (\ref{eqn:SecondComplexIntegral}) is a real number and that \begin{equation} \mc{I}<\mc{J}+\frac{y^{1-\beta}}{9!} \frac{L(1,\chi)}{1-\beta}. \label{eqn:ComplexIntegralsInequality} \end{equation} It is now ready to prove an explicit Hecke's theorem as follows. \begin{PP} Let \(N\) be any given squarefree positive integer with \(N >7.5 \cdot 10^{19} \) and \(N \equiv 1, 2 \pmod {4}\) and put \(D = -4N\) and \(q = 4N\). Let \(\chi(n)=\big(\frac{D}{n}\big)\) be the Kronecker symbol with the corresponding Dirichlet \(L\)-function \(L(s,\chi)\). If \(L(s,\chi) \neq 0\) for \(s\) in the interval \([\beta, 1)\) with \(0<\beta<1\) satisfying \begin{equation} 1 - \beta < 0.015 \frac{1}{\log q}, \label{eqn:ConditionQ} \end{equation} then \begin{equation} L(1,\chi) > 2.43 (1 - \beta). \label{eqn:ConclusionQ} \end{equation} \label{prop:HeckeExplicit} \end{PP} {\em Proof:} We choose the number \(y=q=4N >3 \cdot 10^{20}\). % \(y=\sqrt{q}=2 \sqrt{N}\). By using \(s=-1-\beta+it\) with \(-\infty \frac{9!}{y^{1-\beta}}\mc{I} - \frac{9!}{y^{1-\beta}}|\mc{J}| \geq \frac{0.9999}{y^{1-\beta}}\sum_{\norm(\mf{a})\leq 2\cdot 10^{10}} \frac{1}{{\norm(\mf{a})}} - \frac{9!}{72}\frac{\pi^4}{y^2}\left( \frac{y}{4\pi^2} \right)^{3/2} \] Noticing that \(y^{1-\beta} \leq q^{0.015 \frac{1}{\log q}}=e^{0.015}\) by (\ref{eqn:ConditionQ}), we get \begin{equation} \frac{L(1,\chi)}{1-\beta} > 0.985\sum_{\norm(\mf{a})\leq 2\cdot 10^{10}} \frac{1}{{\norm(\mf{a})}} - 0.000001. \label{eqn:LfunctionOneLowerBound} \end{equation} For every positive integer \(a\leq 10^5\), we choose \(\mf{a}=aO_K\) and have \(\norm(\mf{a}) =\norm(aO_K) = |\NKQ(a)| = a^{[K:\Qfld]}=a^2 \leq 10^{10}\). Moreover, we have seen that \(2 O_K = \hat{\mf{p}}^2 \), where \(\hat{\mf{p}} \mid 2\) is the prime ideal of \(O_K\) lying over \(2\in\Zfld\), and hence \(\norm(\hat{\mf{p}})=2\). We choose \(\mf{a}=a\hat{\mf{p}}\) with \(\norm(\mf{a}) = |\NKQ(a)|\norm(\hat{\mf{p}})=2a^2\leq 2\cdot 10^{10}\). It is obvious that, for any two positive integers \(a_1\) and \(a_2\), there is \(a_1^2 \neq 2a_2^2\), since \(\sqrt{2}\) is irrational. Therefore, it follows from (\ref{eqn:LfunctionOneLowerBound}) that \[ \frac{L(1,\chi)}{1-\beta} > 0.985 \sum_{n=1}^{100000} \left( \frac{1}{n^2} + \frac{1}{2n^2} \right) - 0.000001 >2.43 \] which implies (\ref{eqn:ConclusionQ}). The proof of Proposition~\ref{prop:HeckeExplicit} is complete. \eof %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \section{An explicit zero-free interval for \(L(s,\chi)\)} \label{sec:zerofreeinterval} Let \(N\) be any given squarefree positive integer with \(N >7.5 \cdot 10^{19} \) and \(N \equiv 1, 2 \pmod {4}\). The Kronecker symbol \(\chi(n)=\big(\frac{\Delta_K}{n}\big)\) is the real primitive Dirichlet character of the imaginary quadratic field \(K = \Qfld(\sqrt{\Delta_K})\) with discriminant \(\Delta_K=-4N<0\). The corresponding Dirichlet \(L\)-function \(L(s,\chi)\) of \(s\in\Cfld\) is entire on the complex plane. We need to search for a number \(\beta\in (0,1)\) such that \(L(s,\chi) \neq 0\) for \(s\) in the interval \((\beta, 1)\). Hecke's conjecture on Dirichlet \(L\)-functions asserts that, for every {\em real} Dirichlet character \(\chi\), we have \(L(s,\chi) \neq 0\) for \(00\) and any real primitive character \(\chi\) of modulus \(q\), if \(\beta\in (0,1)\) is a real zero of \(L(s,\chi)\), then \(1-\beta \geq C(\ve)q^{-\ve}\) for some constant \(C(\ve)>0\). Thus, if \(1-\beta < C(\ve)q^{-\ve}\), then \(L(s, \chi)\neq 0\) for \(\beta < s < 1\). Note that the constant~\(C(\ve)\) in Siegel's result is {\em ineffective}, in that whose existence is proven but it cannot be explicitly calculated by the proof method. The Siegel--Walfisz theorem was obtained in~1937 (see Walfisz~\cite{bib:walfisz1936}) as an application of Siegel's result to distribution of primes in arithmetic progressions. With the Siegel--Walfisz theorem, in~1937 Vinogradov~\cite{bib:vinogradov1937a} found an {\em unconditional} proof of the three primes Goldbach conjecture for all sufficiently large odd integers. Vinogradov's theorem states that every sufficiently large odd integer can be expressed as a sum of three primes. Hardy and Littlewood~\cite{bib:hardy1924a} had shown earlier in~1924 that the same result follows from the generalized Riemann hypothesis (GRH), which, however, remains unproven. The most recent progress in Landau--Siegel zeros was presented in manuscript~\cite{bib:openAI2026a} titled \lq\lq Uniform exclusion of Landau--Siegel zeros". It claims that there is an absolute constant \(c>0\) such that every real zero \(\beta\in (0,1)\) of every primitive nonprincipal real Dirichlet \(L\)-function \(L(s,\chi)\) of conductor \(q\geq 3\), {\em if it exists}, satisfies \((1-\beta) \log q \geq c\). In other words, if \(1-\beta < \frac{c}{\log q}\), then \(L(s, \chi)\neq 0\) for \(\beta < s < 1\). This assertion has remarkably improved Siegel's result. In the current scenario, we need to obtain an effective zero-free interval for \(L(s,\chi)\) with {\em explicit} constants, which will be utilized by the application for establishing Theorem~\ref{thrm:Mordellthrm1849}. The arguments presented in~\cite{bib:openAI2026a} are the basis and will be employed appropriately. We will develop a rigorous and complete proof, which involves detailed derivations that do not appear in~\cite{bib:openAI2026a}. Moreover, effective constants will be {\em explicitly calculated}, which are best suited to the demands of the application. In the following, we will focus on Dirichlet \(L\)-functions \(L(s,\chi)\) associated with the real primitive Dirichlet characters \(\chi\) of the imaginary quadratic fields \(K = \Qfld(\sqrt{-N})\) with discriminant \(\Delta_K=-4N<0\) for all squarefree positive integers \(N >7.5 \cdot 10^{19} \) with \(N \equiv 1, 2 \pmod {4}\). Let \[ q=|\Delta_K|=4N>3 \cdot 10^{20}, \] then \(\chi(n)=\big(\frac{\Delta_K}{n}\big)\in \{-1,0,1\}\) is a real primitive Dirichlet character of modulus~\(q\). It appears to be out of reach of the current approach to prove Hecke's conjecture for the {\em nonexistence} of real zeros of Dirichlet \(L\)-function \(L(s,\chi)\) for every real Dirichlet character \(\chi\) in the whole interval \(0 1\), we have \[ \frac{1}{\sigma - \rho} + \frac{1}{\sigma - \bar{\rho}} = 2\frac{\sigma-\real(\rho)}{|\sigma-\rho|^2} > 0. \] Remind that \(\zeta_K(s) = \zeta(s) L(s,\chi)\) for \(s\in\Cfld\) and hence \(\zeta_K(\beta) =0\). We have, for \(\sigma > 1\), \begin{equation} -\frac{\zeta_K'(\sigma)}{\zeta_K(\sigma)} < -\frac{1}{\sigma-\beta} +\frac{1}{\sigma-1}+\frac{1}{2} \log |\Delta_K|+ \frac{1}{\sigma} -\log \pi +\frac{\Gamma'(\sigma)}{\Gamma(\sigma)} -\log 2. \label{eqn:StarkIneqaility} \end{equation} Note that \(\frac{\Gamma'(s)}{\Gamma(s)} < \frac{\Gamma'(2)}{\Gamma(2)}=1-\gamma\) for \(01\), \begin{equation} -\frac{\zeta_K'(\sigma)}{\zeta_K(\sigma)} = \sum_{\mf{p}} \frac{\log\norm(\mf{p})}{{\norm(\mf{p})}^{\sigma}-1} \label{eqn:EulerIdentityLogDerivative} \end{equation} where \(\mf{p}\) runs through the nonzero prime ideals of \(K\). By using \(\zeta_K(\sigma) = \zeta(\sigma) L(\sigma,\chi)\), we also have \begin{equation} -\frac{\zeta_K'(\sigma)}{\zeta_K(\sigma)} = -\frac{\zeta'(\sigma)}{\zeta(\sigma)}-\frac{L'(\sigma,\chi)}{L(\sigma,\chi)} =\sum_{n=1}^{\infty} (1+\chi(n)) \frac{\Lambda(n)}{n^\sigma} \label{eqn:RiemannDirichletLogDerivative} \end{equation} for \(\sigma>1\), where \(\Lambda(n)\) is the von Mangoldt function defined as \(\log p\) if \(n=p^k\) for some prime \(p\) and integer \(k\geq 1\) and~\(0\) otherwise. We know that Galois extension \(K/\Qfld\) is uniquely determined by the set of prime numbers which split completely in \(K\), as a consequence of Chebotarev's density theorem (see Neukirch~\cite[Chapter~VII, Section~\S 13]{bib:neukirch1999a}). For instance, the dominating terms in the summation (\ref{eqn:EulerIdentityLogDerivative}) are in the prime ideals \(\mf{p}\mid p\) where the prime \(p\) splits completely in~\(K\) and hence \(\norm(\mf{p})=p\). If the prime \(p\) is inert in the imaginary quadratic field \(K\) and \(\mf{p}\mid p\), then \(\chi(p)=\big(\frac{\Delta_K}{p}\big)=-1\), \(\mf{p} = pO_K\) and \(\norm(\mf{p})=p^2\). Furthermore, it is seen from (\ref{eqn:RiemannDirichletLogDerivative}) that the dominating terms in the summation are in the primes \(p\) with \(\chi(p)=\big(\frac{\Delta_K}{p}\big)=1\), which splits completely in \(K\). If we take \(\sigma = 1+2/\log X < 2\), where \(X\geq q\) is a real variable, then, from (\ref{eqn:StarkBound}) and~(\ref{eqn:RiemannDirichletLogDerivative}), we get \[ \frac{1}{2} \log |\Delta_K| + \frac{1}{4}(1-\beta)(\log X)^2 > \sum_{p} (1+\chi(p)) \frac{\log p}{p} \frac{1}{p^{2/\log X}} > \frac{1}{e^2} \sum_{p\leq X} (1+\chi(p)) \frac{\log p}{p} \] where the infinite series \(\sum_{p}\) runs over the primes \(p\in \Zfld\). Therefore, noticing that \(\chi(p)\in \{-1,0,1\}\) and that \(\chi(p)=0\) if and only if \(p\mid q\), we obtain \begin{equation} \sum_{ \substack{p\leq X \\ \chi(p)=1} } \frac{\log p}{p} +\frac{1}{2}\sum_{ \substack{p\leq X \\ p\mid q} } \frac{\log p}{p} < \frac{e^2}{4} \log |\Delta_K| + \frac{e^2}{8}(1-\beta)(\log X)^2 \label{eqn:SplitBound} \end{equation} for all \(X\geq q\). Moreover, by noticing that \(q=|\Delta_K|=4N\) and \(N\) is a squarefree positive integer, we have \[ \sum_{ \substack{p\leq X \\ p\mid q} } \frac{\log p}{p} = \sum_{p\mid q} \frac{\log p}{p} = \frac{\log 2}{2}+ \sum_{ \substack{ p\mid q \\ p>2 } } \frac{\log p}{p} \leq \frac{\log 2}{2} + \frac{1}{3}\log N < \frac{1}{3}\log q. \] It follows from (\ref{eqn:SplitBound}) that, for all \(X\geq q\), \begin{equation} \sum_{ \substack{p\leq X \\ \chi(p)\neq -1} } \frac{\log p}{p} = \sum_{ \substack{p\leq X \\ \chi(p)=1} } \frac{\log p}{p} +\sum_{ \substack{p\leq X \\ p\mid q} } \frac{\log p}{p} < \left(\frac{1}{6}+\frac{e^2}{4}\right) \log q + \frac{e^2}{8}(1-\beta)(\log X)^2. \label{eqn:NonInertBound} \end{equation} It is well known that \(\sum_{p\leq X} \frac{\log p}{p} \sim \log X\) as \(X\to\infty\). By (\ref{eqn:NonInertBound}) in the case that~\(q\) is fixed or that \(\log q \) is {\em relatively small} to \(\log X\) for large \(X\), if the real zero \(\beta\in (0,1)\) were so close to~\(1\) that \((1-\beta)\log X\) is {\em extremely small}, then the primes \(p\leq X\), which are {\em not inert} in~\(K\), would be {\em very rare}. The nature of Landau--Siegel zeros extremely close to~\(1\) in this respect had also been discussed by Friedlander and Iwaniec~\cite{bib:friedlander2018a}. The effect of Landau--Siegel zeros~\(\beta\) extremely close to~\(1\) causing the primes {\em not inert in~\(K\)} to be very rare has been employed significantly in~\cite{bib:openAI2026a} to achieve a discovery that the real zero~\(\beta\) has to be at least \(c/\log q\) away from~\(1\) for an absolute constant \(c>0\), which is much greater than Siegel's distance \(C(\ve)/q^{\ve}\) for an arbitrary positive number \(\ve>0\) with some constant \(C(\ve)>0\) depending on \(\ve\). A basic strategy in~\cite{bib:openAI2026a} is to construct a {\em nonzero} algebraic integer, denoted by \(\Delta\), in a biquadratic field \(L/K\), which has all small enough primes {\em inert} in~\(K\) as its prime factors. Then, one can obtain a {\em larger} lower bound for the absolute value of the field norm \(|\NLQ(\Delta)|\) when the primes {\em not inert} in~\(K\) becomes {\em more rare} due to the real zero~\(\beta\) being {\em closer} to~\(1\). On the other hand, the quantity \(|\NLQ(\Delta)|\) must have an upper bound, depending only on~\(q\), which arises from its definition in terms of real and complex embeddings, since~\(\Delta\) is actually defined as the determinant of a full-rank square matrix with entries in~\(O_L\), the ring of integers of~\(L\), with predefined bounded \(\Zfld\)-coordinates in terms of~\(q\). Using the lower and upper bounds of \(|\NLQ(\Delta)|\), we see that the rarity (or abundance) of primes \(p\leq X\) which are {\em not inert} in~\(K\) must have a bound from above (or below). By the nature of the Landau--Siegel zero \(\beta\) extremely close to~\(1\) as shown in (\ref{eqn:NonInertBound}), combing the available lower and upper bounds of \(|\NLQ(\Delta)|\) will yield a lower bound for \((1-\beta)\log X\). Hence, the distance \(1-\beta\) between the real zero~\(\beta\) and~\(1\) will have a nontrivial lower bound, implying a remarkably enlarged zero-free interval~\((\beta,1)\) for \(L(s,\chi)\). The {\em method of the field norm} using the lower and upper bounds of its absolute value has been previously employed in~1986 by Lenstra~\cite{bib:lenstra1986a} in theory of codes from geometry of numbers. Lenstra used this simple method to construct the code from algebraic number fields and provided some heuristic to show that the code would be of high quality in the sense that the minimum distance of the code can potentially be relatively large for a fixed rate of the code. The author of this paper has used the same {\em method of the field norm} in~\cite{bib:liang2024a} to simplify the construction of codes and further analyzed the Lenstra codes, which have been demonstrated to be of high quality as expected. However, it is {\em crucial} for the achievement in~\cite{bib:openAI2026a} to construct a specific {\em nonzero} algebraic integer \(\Delta\in O_L\) with a biquadratic field \(L/K\), which has the property that all small enough primes {\em inert} in~\(K\) are its prime factors. In the following, we are going to present the construction of \(\Delta\) given in~\cite{bib:openAI2026a} and verify the properties of \(\Delta\) by providing accurate and accessible arguments in details for the purpose of rigor and completeness. We introduce a biquadratic field as follows. For the given two quadratic fields \[ K = \Qfld(\sqrt{-N}) \mbox{ and } F = \Qfld(\sqrt{2}) \] we define a number field~\(L\) as the composite field \[ L = KF = \Qfld(\sqrt{-N}, \sqrt{2}) . \] We need to find the Galois group of \(L\) for the calculation of the field norm \(\NLQ(\cdot)\). The Galois group of \(K\) is \(\Gal(K/\Qfld)=\{e_1,\sigma_1\}\), where \(e_1\) is the identity element and~\(\sigma_1\) is defined by \(\sigma_1(\sqrt{-N})=-\sqrt{-N}\). The Galois group of \(F\) is \(\Gal(F/\Qfld)=\{e_2,\tau_2\}\), where \(e_2\) is the identity element and~\(\tau_2\) is defined by \(\tau_2(\sqrt{2})=-\sqrt{2}\). Since \(K\cap F=\Qfld\), the Galois group of \(L\) is isomorphic to the direct product \[ \Gal(L/\Qfld) = \{e, \sigma, \tau, \sigma\tau\} \cong \Gal(K/\Qfld) \times \Gal(F/\Qfld) \] where \(e=(e_1,e_2)\), \(\sigma=(\sigma_1, e_2)\) and \(\tau=(e_1, \tau_2)\). Hence, \(\sigma\tau=\tau\sigma=(\sigma_1, \tau_2)\) with \[ \sigma(\sqrt{-N}) =(\sigma_1, e_2)\vert_K(\sqrt{-N}) = \sigma_1(\sqrt{-N})=-\sqrt{-N} \] and \[ \tau(\sqrt{2}) =(e_1,\tau_2)\vert_F(\sqrt{2}) = \tau_2(\sqrt{2})=-\sqrt{2}. \] It is clear that \[ \sigma(\sqrt{2}) =(\sigma_1, e_2)\vert_F(\sqrt{2}) = e_2(\sqrt{2})=\sqrt{2} \] and \[ \tau(\sqrt{-N}) =(e_1, \tau_2)\vert_K(\sqrt{-N}) = e_1(\sqrt{-N})=\sqrt{-N}. \] An integral basis of \(K\) is \(\{1, \sqrt{-N}\}\) and hence \(O_K=\Zfld[\sqrt{-N}]\). The field \(F\) has an integral basis of \(\{1, \sqrt{2}\}\) and therefore the ring of algebraic integers \(O_F=\Zfld[\sqrt{2}]\). The determination of the ring of algebraic integers \(O_L\) for the biquadratic field \(L\) had been explicitly provided by Williams~\cite{bib:williams1970a}. It is seen that \[ \mc{R} = \Zfld[\sqrt{-N}, \sqrt{2}] \subset O_L \] which is a proper {\em subring} of \(O_L\). Let \(W \geq q\) be a positive integer. We consider the following subset \[ B_W=\{n_1+n_2 a+n_3 b+n_4 ab \mid 0\leq n_i\leq W-1 \mbox{ for } i=1,2,3,4\}\subset \mc{R} \] where \(n_i\in\Zfld\) for \(1\leq i\leq 4\) with \[ a=\sqrt{-N} \mbox{ and } b=\sqrt{2}. \] It is noted that \(\{1,a,b,ab\}\) is the \(\Qfld\)-basis of the extension \(L/\Qfld\) of degree \([L:\Qfld]=4\). Thus, the four numbers \(1\), \(a\), \(b\) and \(ab=\sqrt{-2N}\) are linearly independent over the rational field \(\Qfld\). Let \(\vec{n}=(n_1,n_2,n_3,n_4)^\top\) be a column vector, where \(n_i\in\Zfld\) for \(1\leq i\leq 4\) and~\(\top\) denotes the transpose. We set \[ \theta_{\vec{n}} = n_1+n_2a+n_3b+n_4ab\in \mc{R}. \] It is clear that \(e(\theta_{\vec{n}})=\theta_{\vec{n}}\), \[ \sigma( \theta_{\vec{n}}) = n_1+n_2\sigma(a)+n_3\sigma(b)+n_4\sigma(a)\sigma(b) = n_1-n_2 a+n_3 b-n_4 ab \in \mc{R} \] and \[ \tau( \theta_{\vec{n}}) = n_1+n_2\tau(a)+n_3\tau(b)+n_4\tau(a)\tau(b) = n_1+n_2 a-n_3 b-n_4 ab \in \mc{R}. \] Moreover, we have \[ \sigma\tau( \theta_{\vec{n}}) = n_1+n_2\sigma\tau(a)+n_3\sigma\tau(b)+n_4\sigma\tau(a)\sigma\tau(b) = n_1-n_2 a-n_3 b+n_4 ab \in \mc{R}. \] Let \(\Zfld_{\geq 0}\) denote the set of all nonnegative integers. Note that the subset \(B_W\) of \(\mc{R}\) has the cardinality of \(\#B_W = W^4\). For each \(\alpha=(\alpha_1, \alpha_2, \alpha_3)\in \Zfld_{\geq 0}^3\), we define a row vector of dimension \(W^4\) as follows \[ R_\alpha = (\theta_{\vec{n}}^{\alpha_1} \sigma( \theta_{\vec{n}})^{\alpha_2} \sigma\tau (\theta_{\vec{n}})^{\alpha_3} ) \] where \(\theta_{\vec{n}}\in B_W\subset \mc{R}\). The \(W^4\) algebraic integers \(\theta_{\vec{n}}\) in \(B_W\) and correspondingly the \(W^4\) entries in \(R_\alpha\) can be placed in a lexicographical order, namely, the alphabetical order. When \(\vec{n}=(0,0,0,0)^\top\), it is agreed that the {\em first} entry in the row vector \(R_\alpha\) is defined as~\(1\) for \(\alpha=(0,0,0)\) and \(0\) for \(\alpha\neq (0,0,0)\). We can see that every entry of the vector~\(R_\alpha\) is an algebraic integer in \(\mc{R}\subset O_L\). We choose the parameter \(H\) with the value \[ H=10^6 \] and define the following four numbers in terms of \(W\) \begin{equation} U = W^{4/3},\;\; T_1=\lceil 8 H^{2/3} U\rceil,\;\; T_2=T_2=\lceil 8 H^{-1/3} U\rceil. \label{eqn:FourNumbersDefinition} \end{equation} Let \(\alpha=(\alpha_1, \alpha_2, \alpha_3)\in \Zfld_{\geq 0}^3\) with \(\alpha_j \leq T_j\) for \(j=1,2,3\). We define the matrix \(\mc{M}\) with \[ T=(T_1+1)(T_2+1)(T_3+1) \] row vectors of dimension \(W^4\) as follows. The row vectors of \(\mc{M}\) are indexed by \(\alpha=(\alpha_1, \alpha_2, \alpha_3)\) with the alphabetical order and the row vector with index \(\alpha\) of \(\mc{M}\) equals~\(R_\alpha\). It is clear that \(T > 512 U^3 = 512 W^4 > W^4\), i.e., the number of row vectors of the \(T \times W^4\) matrix \(\mc{M}\) is greater than the number of its column vectors. The following lemma is a fundamental result which has essentially been given in~\cite{bib:openAI2026a}. Based on the arguments provided by~\cite{bib:openAI2026a}, we will present a detailed proof with extra arguments and derivations which are entailed but do not appear in~\cite{bib:openAI2026a}. \begin{LL} The matrix \(\mc{M}\) has full column rank, i.e., the rank of \(\mc{M}\) equals~\(W^4\), the number of its columns. \label{lemma:IntelligentLemma} \end{LL} {\em Proof:} See Appendix~B. % The proof is complete. \eof Note that every entry of the matrix \(\mc{M}\) is an algebraic integer in \(\mc{R}\subset O_L\). The row rank and the column rank of any matrix are always equal. Lemma~\ref{lemma:IntelligentLemma} guarantees that there exist \(W^4\) row vectors of \(\mc{M}\) which are linearly independent in the number field~\(L\). %%%%%%%%%%%%%%%%%%%%%%%%%%%% \subsection{A specific nonzero algebraic integer \(\Delta\) in \(O_L\)} The row vectors \(R_\alpha\) of the matrix \(\mc{M}\) are indexed by \(\alpha=(\alpha_1, \alpha_2, \alpha_3)\in \Zfld_{\geq 0}^3\) with \(\alpha_j \leq T_j\) for \(j=1,2,3\). We define the \(H\)-weight of the index \(\alpha\) as \[ \wt (\alpha) = \alpha_1 +H \alpha_2 + H\alpha_3 \] where \(H=10^6\) is the chosen parameter. We arrange the order of indices \(\alpha\) of the row vectors \(R_\alpha\) in the matrix \(\mc{M}\) by increasing \(\wt (\alpha)\). In the case that \(\wt (\alpha)=\wt (\hat{\alpha})\) for two different indices \(\alpha\neq \hat{\alpha}\), the arrangement to break tie resorts to using their alphabetical order. It is clear that the first index is \(\alpha=(0,0,0)\) and the corresponding row vector \(R_\alpha\) is an all-one vector. Starting from the first retained index \(\alpha=(0,0,0)\), we consider the next index \(\alpha\) in the order of the \(H\)-weight. It will be retained if the row vector~\(R_\alpha\) can increase the span of the earlier retained rows, namely, if the augmented submatrix consisting of the earlier retained rows appended with the row vector~\(R_\alpha\) continues to have full row rank. According to Lemma~\ref{lemma:IntelligentLemma}, this procedure of selection will proceed in a unique way and end with \(W^4\) retained rows of the matrix \(\mc{M}\). Let \(\mc{P}_{ri}\) be the set of the retained indices~\(\alpha\), which is uniquely determined by the procedure with the \(H\)-weight. It is clear that the ordered set \(\mc{P}_{ri}\) of retained indices has the cardinality of \[ \#\mc{P}_{ri}=W^4. \] We denote by \(\mc{M}_{ri}\) the submatrix of the matrix \(\mc{M}\) consisting of the row vectors \(R_\alpha\) with \(\alpha\in \mc{P}_{ri}\) in the order of the \(H\)-weight. Remind that \(R_\alpha\) is of dimension \(W^4\). We see that \(\mc{M}_{ri}\) is a {\em full-rank} square matrix of size \(W^4\times W^4\), every entry of which is an algebraic integer in \(\mc{R}\subset O_L\). The determinant of \(\mc{M}_{ri}\) is thus {\em nonzero}. We define the {\em nonzero} algebraic integer \begin{equation} \Delta = \det(\mc{M}_{ri}) \in O_L\setminus \{0\} \label{eqn:DeltaDefinition} \end{equation} which will play a vital role in the following process. The algebraic integer \(\Delta\) induces, via the field norm, a {\em nonzero} rational integer given by \begin{equation} \NLQ(\Delta)\in \Zfld\setminus \{0\}. \label{eqn:DeltaNorm} \end{equation} The following result on the set \(\mc{P}_{ri}\) of retained indices will be needed. \begin{LL} We put \[ S_1 = \sum_{\alpha\in\mc{P}_{ri}} \alpha_1 \mbox{ and } S_2 = \sum_{\alpha\in\mc{P}_{ri}} (\alpha_2 + \alpha_3). \] Then, we have \[ S_1 \geq \frac{1}{135} W^4 H^{2/3} U \mbox{ and } S_2 \leq 18 W^4 H^{-1/3} U. \] \label{lemma:IndexSet} \end{LL} {\em Proof:} Since \(U = W^{4/3}\) with \(W\geq q>3\cdot 10^{20}\), \(0\leq \alpha_2 \leq T_2=\lceil 8 H^{-1/3} U\rceil\) and \(0\leq\alpha_3 \leq T_3=\lceil 8 H^{-1/3} U\rceil\), we have \[ S_2 \leq 2 \lceil 8 H^{-1/3} U\rceil \sum_{\alpha\in\mc{P}_{ri}} 1 = 2 W^4 \lceil 8 H^{-1/3} U\rceil \leq 18 W^4 H^{-1/3} U. \] For any fixed \(\alpha_1\) with \(0\leq \alpha_1\leq T_1=\lceil 8 H^{2/3} U\rceil\), there are at most \[ Q_0= (T_2+1)(T_3+1) \leq (8 H^{-1/3} U+2)^2 \leq 66 H^{-2/3} U^2 = 66 H^{-2/3} W^{8/3} \] retained indices \(\alpha=(\alpha_1, \alpha_2, \alpha_3)\). We rearrange elements in the set \[ \{\alpha_1 \mid \alpha=(\alpha_1, \alpha_2, \alpha_3)\in\mc{P}_{ri}\} \] by sorting in a nondecreasing order and get the following set \[ \{ b_1, b_2, \cdots, b_{W^4} \} \] where \(W^4=\#\mc{P}_{ri}\). Therefore, \[ S_1 = \sum_{\alpha\in\mc{P}_{ri}} \alpha_1 = \sum_{\ell=1}^{W^4} b_{\ell}. \] It is seen that \(0=b_1\leq b_2\leq \cdots\leq b_{W^4}\leq T_1\) and each value of \(b_{\ell}\) can repeat itself at most \(Q_0\) times. There exists a positive integer~\(k\) such that \[ (k+1)Q_0 \leq W^4 < (k+2)Q_0. \] Then, we have \[ S_1 \geq \sum_{m=0}^{k} mQ_0 = \frac{k(k+1)}{2} Q_0 \geq \frac{Q_0}{2} \left( \frac{W^4}{Q_0}-2\right) \left( \frac{W^4}{Q_0}-1\right) \geq \frac{0.99}{2} Q_0 \frac{W^4}{Q_0} \frac{W^4}{Q_0} \] and hence \[ S_1 \geq \frac{0.99}{2} W^4 \frac{W^4}{66 H^{-2/3} W^{8/3}} = \frac{0.99}{132} W^4 H^{2/3} U \geq \frac{1}{135} W^4 H^{2/3} U. \] The proof of Lemma~\ref{lemma:IndexSet} is complete. \eof By Lemma~\ref{lemma:IndexSet}, the ratio of \(S_2\) to \(S_1\) has an upper bound given by \begin{equation} \frac{S_2}{S_1} \leq \frac{18\cdot 135}{H} = \frac{2430}{10^6} = 0.00243. \label{eqn:S2overS1bound} \end{equation} %%%%%%%%%%%%%%%%%%%%%%%%%%%% \subsection{An upper bound for \(|\NLQ(\Delta)|\)} Ostrowski's theorem for a number field says that every nontrivial absolute value on~\(L\) is equivalent to either~a \(\mf{p}\)-adic nonarchimedean absolute value for a nonzero prime ideal~\(\mf{p}\) of~\(O_L\) or an archimedean absolute value associated to a real or complex-conjugate pair of embeddings of~\(L\) (see~\cite{bib:ostrowski1916a} and~\cite{bib:conrad}). For a given nonzero integer \(\Delta\in O_L\setminus \{0\}\), the archimedean absolute value \(v\vert\infty\) that corresponds to a real embedding \(\sigma: K\emb\Rfld\) is defined as \(|\Delta|_{v}=|\sigma(\Delta)|\). For archimedean~\(v\vert\infty\) that corresponds to a complex embedding \(\sigma: K\emb\Cfld\), \(|\Delta|_{v}=|\sigma(\Delta)|^2\). For the \(\mf{p}\)-adic nonarchimedean absolute value, we define \[ |\Delta|_{\mf{p}} = {\norm(\mf{p})}^{-v_{\mf{p}}(\Delta)} \] where \(v_{\mf{p}}(\Delta)\in\Zfld_{\geq 0}\) is the \(\mf{p}\)-adic valuation of \(\Delta\). The archimedean and nonarchimedean absolute values on~\(L\) can be tied together by a product formula as follows (see~\cite{bib:conrad}). \begin{LL} For \(\Delta\in O_L\setminus \{0\}\), we have \[ \prod_{v} |\Delta|_{v} = 1 \] where the product runs over the absolute values~\(v\) on~\(L\). \label{lemma:ProductFormula} \end{LL} Suppose that the principal integral ideal \(\Delta O_L\) is factored into prime ideals \[ \Delta O_L = \mf{p}_1^{a_1} \cdots \mf{p}_r^{a_r} \] where \(a_j\) is a positive integer and \(\mf{p}_j\)'s are distinct prime ideals for \(j=1,\cdots,r\). While the archimedean contribution to \(\prod_{v} |\Delta|_{v}\) is \(|\NLQ(\Delta)|\), the nonarchimedean contribution to \(\prod_{v} |\Delta|_{v}\) is given by \[ \prod_{j=1}^{r} {\norm(\mf{p}_j)}^{-v_{\mf{p}_j}(\Delta)} =\prod_{j=1}^{r} {\norm(\mf{p}_j)}^{-a_j}. \] From the product formula, it follows that \begin{equation} \prod_{v\vert\infty} |\Delta|_{v} = |\NLQ(\Delta)| = \prod_{j=1}^{r} {\norm(\mf{p}_j)}^{a_j}. \label{eqn:MethodFieldNorm} \end{equation} We note that the product formula reduces to the fundamental theorem of arithmetic in the case that \(L=\Qfld\). In the method of the field norm, we use the left-hand (or right-hand) side of its absolute value in (\ref{eqn:MethodFieldNorm}) to find an upper (or a lower) bound for \(|\NLQ(\Delta)|\). In the current scenario, the field \(L\) is \(\Qfld(\sqrt{-N}, \sqrt{2}) \) with \(\Gal(L/\Qfld) = \{e, \sigma, \tau, \sigma\tau\}\). It is seen that \(\{e, \sigma\}\) and \(\{\tau, \sigma\tau\}\) are two pairs of complex embeddings. Therefore, \[ |\NLQ(\Delta)| = |\Delta|^2|\tau(\Delta)|^2. \] By using (\ref{eqn:DeltaDefinition}), it is clear that \[ \tau(\Delta) = \tau(\det(\mc{M}_{ri}) ) =\det(\tau(\mc{M}_{ri}) ) \] and hence \[ |\NLQ(\Delta)| = |\det(\mc{M}_{ri})|^2|\det(\tau(\mc{M}_{ri}) )|^2. \] We introduce the following subset \[ C_W=\{n_1+n_2 a+n_3 b+n_4 ab \mid -W+1 \leq n_i\leq W-1 \mbox{ for } i=1,2,3,4\}\subset \mc{R} \] where \(n_i\in\Zfld\) for \(1\leq i\leq 4\). We have \(B_W \subset C_W\). If \(\theta_{\vec{n}}\in C_W\), then \(\sigma( \theta_{\vec{n}})\in C_W\) and \(\tau( \theta_{\vec{n}})\in C_W\) and thus \(\sigma\tau( \theta_{\vec{n}})\in C_W\). Every entry in the matrix \(\mc{M}_{ri}\) has the form of \(\theta_{\vec{n}}^{\alpha_1} \sigma( \theta_{\vec{n}})^{\alpha_2} \sigma\tau (\theta_{\vec{n}})^{\alpha_3}\) where \[ \theta_{\vec{n}}\in B_W \subset C_W \] and \(\alpha=(\alpha_1, \alpha_2, \alpha_3)\in \mc{P}_{ri}\). Thus, every entry in the matrix \(\tau(\mc{M}_{ri})\) has the form of \[ \tau(\theta_{\vec{n}}^{\alpha_1} \sigma( \theta_{\vec{n}})^{\alpha_2} \sigma\tau (\theta_{\vec{n}})^{\alpha_3}) = \tau( \theta_{\vec{n}})^{\alpha_1} \sigma\tau( \theta_{\vec{n}})^{\alpha_2} \sigma (\theta_{\vec{n}})^{\alpha_3} \] where \( \sigma\tau=\tau \sigma\) and \( \sigma\sigma=\tau\tau=e\) in the Galois group \(\Gal(L/\Qfld)\). It is clear that, for any \(\theta_{\vec{n}}=n_1+n_2 a+n_3 b+n_4 ab\in C_W\), \[ |\theta_{\vec{n}}| \leq (W-1)(1+|a|+|b|+|ab|) =(W-1)(1+\sqrt{N}+\sqrt{2}+\sqrt{2N}) \] and hence from \(q=4N>3\cdot 10^{20}\) that \begin{equation} |\theta_{\vec{n}}| \leq W(1+\sqrt{2})(1+\sqrt{N}) = W(1+\sqrt{2})(1+\sqrt{q}/2) \leq 1.3 W\sqrt{q} =\theta_{max}. \label{eqn:ThetaMax} \end{equation} Therefore, every row vector indexed by \(\alpha=(\alpha_1, \alpha_2, \alpha_3)\in \mc{P}_{ri}\) of the two matrices~\(\mc{M}_{ri}\) and~\(\tau(\mc{M}_{ri})\), which both have the same size of \(W^4\times W^4\), has the length at most \[ \sqrt{W^4}\theta_{max}^{\, \alpha_1+ \alpha_2+ \alpha_3} = W^2\theta_{max}^{\, \alpha_1+ \alpha_2+ \alpha_3}. \] Hadamard's inequality provides an upper bound on the determinant of a square matrix, whose entries are complex numbers, in terms of the lengths of its row vectors. According to Hadamard's inequality, we have \[ \max\{|\det(\mc{M}_{ri})|, |\det(\tau(\mc{M}_{ri}) )|\} \leq \prod_{\alpha\in \mc{P}_{ri}} W^2\theta_{max}^{\, \alpha_1+ \alpha_2+ \alpha_3} =W^{2W^4} \theta_{max}^{\, S_1+S_2}. \] Therefore, we obtain \[ |\NLQ(\Delta)| = |\det(\mc{M}_{ri})|^2|\det(\tau(\mc{M}_{ri}) )|^2 \leq \left( W^{2W^4} \theta_{max}^{\, S_1+S_2} \right)^4 \] and hence \[ \log |\NLQ(\Delta)| \leq 4 \log \left( W^{2W^4} \theta_{max}^{\, S_1+S_2} \right). \] By noting (\ref{eqn:ThetaMax}), we can attain the following upper bound \begin{equation} \frac{1}{4}\log |\NLQ(\Delta)| \leq 2 W^4\log W + (S_1+S_2) (\log W +\log \sqrt{q}+\log 1.3). \label{eqn:UpperBoundFieldNorm} \end{equation} %%%%%%%%%%%%%%%%%%%%%%%%%%%% \subsection{A lower bound for \(|\NLQ(\Delta)|\)} In the following, we use the right-hand side in (\ref{eqn:MethodFieldNorm}) to find a lower bound of \(|\NLQ(\Delta)|\). We consider all primes \(p > H\) which are {\em inert} in~\(K\). It is to be seen that if \(p \leq \alpha_1\) for some \(\alpha=(\alpha_1, \alpha_2, \alpha_3)\in \mc{P}_{ri}\), then \(p\) must be a prime factor of \(\Delta\) in the sense that \(\Delta=p t\) for some algebraic integer \(t\in O_L\). Let \(p\in\Zfld\) with \(p>H\) and \(\chi(p)=-1\). Thus, \(p\) is an odd prime and \( p\nmid |\Delta_K|\). Remind that \(a=\sqrt{-N}\), \(b=\sqrt{2}\) and \(\mc{R} = \Zfld[a, b]\). By Euler's criterion, we have \[ \chi(p) = \left(\frac{\Delta_K}{p}\right) = \left(\frac{-4N}{p}\right) = \left(\frac{-N}{p}\right) \equiv (-N)^{\frac{p-1}{2}} \pmod {p \Zfld} \] and hence \begin{equation} a^{ p} = (-N)^{\frac{p-1}{2}} a \equiv -a \pmod {p \mc{R}} \label{eqn:ModForapap} \end{equation} In a similar fashion, we get \begin{equation} b^{ p} = 2^{\frac{p-1}{2}} b \equiv \left(\frac{2}{p}\right) b \pmod {p \mc{R}} \label{eqn:ModForbpbp} \end{equation} Since \(p\) is odd, there is \(\big(\frac{2}{p}\big) \in\{-1,1\}\). In the first case that \(\big(\frac{2}{p}\big)=1\), by using (\ref{eqn:ModForbpbp}) we have \begin{equation} b^{ p} \equiv b \pmod {p \mc{R}} \label{eqn:ModForbpbpFirst} \end{equation} Let \(\theta_{\vec{n}} = n_1+n_2a+n_3b+n_4ab\in \mc{R}\). Then, by using the multinomial theorem and Fermat's little theorem, we obtain \[ \theta_{\vec{n}}^{p} \equiv n_1^{p}+n_2^{p}a^{p}+n_3^{p}b^{p}+n_4^{p}a^{p}b^{p} \equiv n_1+n_2a^{p}+n_3b^{p}+n_4a^{p}b^{p} \pmod {p \mc{R}} \] and hence, from (\ref{eqn:ModForapap}) and (\ref{eqn:ModForbpbpFirst}), \[ \theta_{\vec{n}}^{p} \equiv n_1 - n_2 a + n_3 b - n_4 ab \pmod {p \mc{R}} \] i.e., \begin{equation} \theta_{\vec{n}}^{p} \equiv \sigma(\theta_{\vec{n}}) \pmod {p \mc{R}}. \label{eqn:PrimeFactorFirst} \end{equation} For each \(\alpha=(\alpha_1, \alpha_2, \alpha_3)\in \mc{P}_{ri}\) with \(\alpha_1\geq p\), we have \(\alpha_1 =pk+r\) with \(0\leq r \alpha_1\) to get a new matrix~\(\Wtilde{\mc{M}}_{ri}\) with row vectors \(\Wtilde{R}_\alpha\). Since \[ (\theta_{\vec{n}}^{p}- \sigma(\theta_{\vec{n}}))^k \theta_{\vec{n}}^{r} =\sum_{m=0}^k\binom{k}{m} (-1)^m (\sigma(\theta_{\vec{n}}))^m \theta_{\vec{n}}^{pk+r - pm}, \] we have \[ (\theta_{\vec{n}}^{p}- \sigma(\theta_{\vec{n}}))^k \theta_{\vec{n}}^{r} = \theta_{\vec{n}}^{\alpha_1} + \sum_{m=1}^k\binom{k}{m} (-1)^m \theta_{\vec{n}}^{\alpha_1 - pm} (\sigma(\theta_{\vec{n}}))^m. \] Hence, for each \(\alpha=(\alpha_1, \alpha_2, \alpha_3)\in \mc{P}_{ri}\) with \(\alpha_1\geq p\), \begin{equation} \Wtilde{R}_\alpha = R_\alpha + \sum_{m=1}^k\binom{k}{m} (-1)^m R_{\alpha - (pm, -m,0)} \label{eqn:RowVectorRelationFirst} \end{equation} which is the \(\alpha\)-indexed row vector in the matrix~\(\Wtilde{\mc{M}}_{ri}\). It is claimed that \(\det(\Wtilde{\mc{M}}_{ri}) =\det(\mc{M}_{ri})\). In fact, for the {\em first} index \(\alpha=(\alpha_1, \alpha_2, \alpha_3)\in \mc{P}_{ri}\) for which \(\Wtilde{R}_\alpha \neq R_\alpha\), it is clear that \(\alpha \neq (0,0,0)\) and the \(H\)-weight \(\wt(\alpha)>0\). Note that the index \(\alpha - (pm, -m,0)\) of \(R_{\alpha - (pm, -m,0)}\) in (\ref{eqn:RowVectorRelationFirst}) {\em may or may not} be in the ordered set \(\mc{P}_{ri}\) of retained indices. For \(p > H\), the index \(\alpha - (pm, -m,0) = (\alpha_1-pm, \alpha_2 + m, \alpha_3)\) has the \(H\)-weight \begin{equation} \wt(\alpha - (pm, -m,0)) = \wt((\alpha_1-pm, \alpha_2 + m, \alpha_3)) = \wt(\alpha) -(p-H)m < \wt(\alpha) \label{eqn:SmallerWeight} \end{equation} for \(1\leq m\leq k\). According to the procedure of selection for the index set \(\mc{P}_{ri}\), it follows from (\ref{eqn:SmallerWeight}) that the row vector \(R_{\alpha - (pm, -m,0)}\) must be in the span of the retained row vectors before \(R_\alpha\). Therefore, by using (\ref{eqn:RowVectorRelationFirst}) and (\ref{eqn:SmallerWeight}), we attain \begin{equation} \Wtilde{R}_\alpha = R_\alpha + \sum_{\hat{\alpha}} c_{\hat{\alpha}} R_{\hat{\alpha}} \label{eqn:LinearCombFirst} \end{equation} where the summation \(\sum_{\hat{\alpha}}\) runs over \(\hat{\alpha}\in\mc{P}_{ri}\) with \(\wt(\hat{\alpha}) < \wt(\alpha)\) and the coefficients \(c_{\hat{\alpha}} \in L\) are obtained in the operation for the form of linear combination. Since \(\alpha\in \mc{P}_{ri}\) is the {\em first} index for which \(\Wtilde{R}_\alpha \neq R_\alpha\), all \(R_{\hat{\alpha}}\) in the summation (\ref{eqn:LinearCombFirst}) are row vectors in the matrix~\(\Wtilde{\mc{M}}_{ri}\), i.e., \(R_{\hat{\alpha}} = \Wtilde{R}_{\hat{\alpha}}\). Applying the theory of determinants, while the row vector \( \Wtilde{R}_\alpha \) in the matrix~\(\Wtilde{\mc{M}}_{ri}\) is replaced by \(R_\alpha\), the determinant of the matrix remains {\em unchanged}. For this updated matrix after row replacement, we will repeat the process, but the determinant of the matrix keeping the same. At the end of the procedure, the matrix~\(\Wtilde{\mc{M}}_{ri}\) reduces to the matrix~\(\mc{M}_{ri}\). So, we have proved that \[ \det(\Wtilde{\mc{M}}_{ri}) =\det(\mc{M}_{ri})=\Delta. \] It can be seen from (\ref{eqn:PrimeFactorFirst}) and (\ref{eqn:RowVectorNewFirst}) that every entry in the row vector \(\Wtilde{R}_\alpha\) belongs to~\(p^k \mc{R}\). Applying the theory of determinants, we have \[ \Delta=\det(\Wtilde{\mc{M}}_{ri}) \in p^k \mc{R}. \] In the second case that \(\big(\frac{2}{p}\big)=-1\), by using (\ref{eqn:ModForbpbp}) we have \begin{equation} b^{ p} \equiv -b \pmod {p \mc{R}} \label{eqn:ModForbpbpSecond} \end{equation} It follows from (\ref{eqn:ModForapap}) and (\ref{eqn:ModForbpbpSecond}) that \[ \theta_{\vec{n}}^{p} \equiv n_1+n_2a^{p}+n_3b^{p}+n_4a^{p}b^{p} \equiv n_1 - n_2 a - n_3 b + n_4 ab \pmod {p \mc{R}} \] i.e., \[ \theta_{\vec{n}}^{p} \equiv \sigma\tau(\theta_{\vec{n}}) \pmod {p \mc{R}} \] We can use the same proof as that in the first case with corresponding replacements such as the row vector in (\ref{eqn:RowVectorNewFirst}) replaced by \begin{equation} \Wtilde{R}_\alpha = ((\theta_{\vec{n}}^{p}- \sigma\tau(\theta_{\vec{n}}))^k \theta_{\vec{n}}^{r} \sigma( \theta_{\vec{n}})^{\alpha_2} \sigma\tau (\theta_{\vec{n}})^{\alpha_3} ) \label{eqn:RowVectorNewSecond} \end{equation} and the row vectors \(R_{\alpha - (pm, -m,0)}\) with indices \(\alpha - (pm, -m,0)\) in (\ref{eqn:RowVectorRelationFirst}) replaced by the row vectors \(R_{\alpha - (pm, 0, -m)}\) with indices \(\alpha - (pm, 0, -m)\). In both cases of \(\big(\frac{2}{p}\big) = 1\) and~\(-1\), respectively, we can achieve the following result. For each \(\alpha=(\alpha_1, \alpha_2, \alpha_3)\in \mc{P}_{ri}\) with \(\alpha_1\geq p\), \[ \Delta \in p^k \mc{R} \mbox{ with } k=\left\lfloor \frac{\alpha_1}{p} \right\rfloor . \] Therefore, we have \[ \Delta \in p^{E_p} \mc{R} \mbox{ with } E_p=\sum_{\alpha\in\mc{P}_{ri}} \left\lfloor \frac{\alpha_1}{p} \right\rfloor. \] According to (\ref{eqn:DeltaDefinition}), we have \(\Delta \in O_L\) and \(\Delta\neq 0\). Note that \(\mc{R} \subset O_L\). We can write \(\Delta=p^{E_p} t\) with \(t\in\mc{R}\) and \(t\neq 0\). Thus, \(\NLQ(t)\in\Zfld\) is a {\em nonzero} integer and \[ |\NLQ(\Delta)| = |\NLQ(p^{E_p})| |\NLQ(t)| = (p^{E_p})^{[L:\Qfld]}|\NLQ(t)| = p^{4E_p}|\NLQ(t)| \geq p^{4E_p}. \] Consequently, \(p^{4E_p} \mid |\NLQ(\Delta)|\) for all primes \(p>H\) with \(\chi(p)=-1\), and hence the following lower bound \begin{equation} \frac{1}{4}\log |\NLQ(\Delta)| \geq \sum_{ \substack{p>H \\ \chi(p)=-1} } E_p \log p \mbox{ with } E_p=\sum_{\alpha\in\mc{P}_{ri}} \left\lfloor \frac{\alpha_1}{p}\right\rfloor. \label{eqn:LowerBoundFieldNorm} \end{equation} %%%%%%%%%%%%%%%%%%%%%%%%%%%% \subsection{Estimation of the distance between the real zero \(\beta\) and~\(1\)} We have analyzed the effect of the Landau--Siegel zero~\(\beta\) extremely close to~\(1\) causing the primes {\em not inert} in the imaginary quadratic fields \(K = \Qfld(\sqrt{-N})\) to be very rare, whose estimation has been given in (\ref{eqn:NonInertBound}). In the following, the method of the field norm using the upper bound of its absolute value \(|\NLQ(\Delta)|\) given in (\ref{eqn:UpperBoundFieldNorm}) and the lower bound given in (\ref{eqn:LowerBoundFieldNorm}) will be employed to attain an estimation for the distance between the real zero \(\beta\) and~\(1\). Suppose that the Landau--Siegel zero~\(\beta\in (0,1)\) of \(L(s,\chi)\) exists, which is real and simple and satisfies \(L(\beta,\chi)=0\). Let \(W = \lfloor q^{\eta}\rfloor\) with parameter \(\eta \geq 16\) to be determined later. Remind that \(U = W^{4/3} > q\). We choose the real variable \(X=U\) in~(\ref{eqn:NonInertBound}) and obtain \[ \sum_{ \substack{p\leq U \\ \chi(p)\neq -1} } \frac{\log p}{p} < \left(\frac{1}{6}+\frac{e^2}{4}\right) \log q + \frac{e^2}{8} (1-\beta)(\log U)^2. \] The lower bound for \(|\NLQ(\Delta)|\) given in (\ref{eqn:LowerBoundFieldNorm}) yields the following \[ \frac{1}{4}\log |\NLQ(\Delta)| \geq \sum_{ \substack{ H 3 \cdot 10^{20}\). It is clear that \(W = \lfloor q^{\eta}\rfloor\) with \(\eta \geq 16\) satisfies \(q^{15} \leq W \leq q^{\eta}\). We have put \(U=W^{4/3}\) and \(H=10^6\). Therefore, \[ \frac{\log |\NLQ(\Delta)|} {4 S_1 \log U} \leq 1.00243\frac{3}{4} + \frac{1.00243\log q}{2\log U} + 0.001 < 0.7529 + 0.5013\frac{\log q}{\log U}. \] Since \(S_1 \geq \frac{1}{135} H^{2/3} W^4 U\), we have \[ 1.0163 \frac{W^4 U}{S_1 \log U} \leq 1.0163 \frac{135}{10000 \log U} < 0.0001. \] Combining the lower and upper bounds of \(|\NLQ(\Delta)|\), we can attain \[ 1 - \frac{\log H}{\log U} - \frac{1.5}{\log U} - 0.7530 \leq \left(\frac{1}{6}+\frac{e^2}{4}+0.5013\right) \frac{\log q}{\log U} + \frac{e^2}{8}(1-\beta) \log U. \] It is estimated that \(\log H/\log U \leq 6/400=0.015\). Thus, we have \[ 0.229 < \left(\frac{1}{6}+\frac{e^2}{4}+0.5013\right) \frac{\log q}{\log U} + \frac{e^2}{8}(1-\beta) \log U < 2.5153 \frac{\log q}{\log U} + 0.9237 (1-\beta) \log U. \] In \(W = \lfloor q^{\eta}\rfloor\), we choose \[ \eta=16.4751. \] Then, \(W = \lfloor q^{16.4751}\rfloor \geq q^{16.4751} - 1 = q^{16.4750}(q^{0.0001} - q^{-16.4750}) > q^{16.4750}\). Noting that \(\log U = (4/3) \log W \leq (4/3) \eta \log q\), we get \[ 0.229 < 2.5153 \frac{3}{4\cdot 16.4750} + 0.9237 \frac{4}{3} \eta (1-\beta) \log q \] and hence \[ (1-\beta) \log q > \frac {3(0.229-0.1146)}{3.6948 \eta} > 0.005638, \] i.e., \begin{equation} 1 - \beta > 0.005638 \frac{1}{\log q}. \label{eqn:LandauSiegelDistance} \end{equation} We can summarize the above result with explicit constants in the form of a zero-free interval located in \((0,1)\) for \(L(s,\chi)\), which will be utilized in the next section. \begin{PP} Let \(N\) be any given squarefree positive integer with \(N >7.5 \cdot 10^{19} \) and \(N \equiv 1, 2 \pmod {4}\) and put \(D = -4N\) and \(q = 4N\). Let \(\chi(n)=\big(\frac{D}{n}\big)\) be the real primitive Dirichlet character of \(K = \Qfld(\sqrt{D})\) and \(L(s,\chi)\) be the corresponding Dirichlet \(L\)-function. If the number \(\beta\in (0,1)\) satisfies \begin{equation} 1 - \beta \leq 0.0056 \frac{1}{\log q} \label{eqn:SiegelExplicit} \end{equation} then \(L(s,\chi) \neq 0\) for \(s\) in the interval \([\beta, 1)\). \label{prop:SiegelExplicit} \end{PP} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \section{Proof of Proposition~\ref{prop:EquivalentPropositionOneTwo}} \label{sec:ThePropositionProof} It is now ready to prove Proposition~\ref{prop:EquivalentPropositionOneTwo} for every squarefree positive integer \(N >7.5 \cdot 10^{19}\) with \(N \equiv 1, 2 \pmod {4}\), which, in turn, proves Theorem~\ref{thrm:Mordellthrm1849} as stated in Section~\ref{sec:reduction}. By using the class number formula given in~(\ref{eqn:hKformula}), it is clear that Proposition~\ref{prop:HeckeExplicit} together with Proposition~\ref{prop:SiegelExplicit} can imply the following result. \begin{TT} Let \(N\) be any given squarefree positive integer with \(N >7.5 \cdot 10^{19} \) and \(N \equiv 1, 2 \pmod {4}\) and put \(D = -4N\) and \(q = 4N\). Let \(h_K\) be the class number of the imaginary quadratic field \(K = \Qfld(\sqrt{D})\) and \(\chi(n)=\big(\frac{D}{n}\big)\) be the Kronecker symbol with the corresponding Dirichlet \(L\)-function \(L(s,\chi)\). Then, we have \begin{equation} L(1,\chi) > 0.013608 \frac{1}{\log q} \label{eqn:SiegelHeckeExplicitLatOne} \end{equation} and \begin{equation} h_K > 0.00433 \frac{\sqrt{q}}{\log q}. \label{eqn:SiegelHeckeExplicithKformula} \end{equation} \label{thrm:SiegelHeckeExplicit} \end{TT} In fact, from Proposition~\ref{prop:SiegelExplicit} we can choose \(\beta = 1 - 0.0056/\log q \in (0,1)\), which satisfies~(\ref{eqn:ConditionQ}) in applying Proposition~\ref{prop:HeckeExplicit}. We are going to prove that (\ref{eqn:EquivalentPropositionOneTwo}) in Proposition~\ref{prop:EquivalentPropositionOneTwo} holds, namely, \[ h_K \neq 2^{\omega(4N)-1} \] where \(\omega(4N)\) is the number of distinct prime factors of \(4N\). If the squarefree positive integer \(N\) satisfies \(N \equiv 1 \pmod {4}\), we can write \[ N = p_1'\cdots p_\ell' \] where \(p_1', \cdots, p_\ell'\) are \(\ell\) distinct {\em odd} primes with an even number of primes \(\equiv 3 \pmod {4}\). For any squarefree positive integer \(N\) with \(N \equiv 2 \pmod {4}\), we can write \[ N = 2p_1' \cdots p_\ell' \] where \(p_1', \cdots, p_\ell'\) are \(\ell\) distinct {\em odd} primes. In both cases, we have \(\omega(4N) = \ell + 1\). Therefore, we need to prove that \begin{equation} h_K \neq 2^\ell. \label{eqn:ToBeProved} \end{equation} Since \(N >7.5 \cdot 10^{19}\), we have \(q=4N>3 \cdot 10^{20}\). By using (\ref{eqn:SiegelHeckeExplicithKformula}), we get \[ h_K > 0.00433 \frac{\sqrt{q}}{\log q} > 1590610. \] In the case that \(1 \leq \ell \leq 20\), we have \[ 2^\ell \leq 2^{20} = 1048576 < h_K. \] For any given \(\ell \geq 21\), we have \[ q = 4N > 2p_1'\cdots p_\ell' \] where \(p_1', \cdots, p_\ell'\) are \(\ell\) distinct {\em odd} primes. The primorial \(p_n\#\) is defined as the product of the first \(n\) primes \[ p_n\# = \prod_{k=1}^n p_k \] where \(p_k\) is the \(k\)th prime number. Therefore, \(q > p_{\ell+1}\#\). It is clear that the function \(\frac{x}{\log x}\) of real variable \(x>e\) is an increasing function. For \(\ell \geq 21\), we have \(p_{\ell+1}\# > p_{21}^{\ell-19} p_{20}\#\) and hence \[ \frac{\sqrt{q}}{\log q} \geq \frac{\sqrt{p_{\ell+1}\#}}{\log (p_{\ell+1}\#)} \geq \frac{(\sqrt{p_{21}})^{\ell-19} \sqrt{p_{20}\#} } {(\ell-19) \log p_{21}+\log (p_{20}\#)}. \] Therefore, by using (\ref{eqn:SiegelHeckeExplicithKformula}), we obtain for \(\ell \geq 21\) \[ \frac{h_K}{2^\ell} > \frac{0.00433}{2^\ell}\frac{\sqrt{q}}{\log q} \geq \frac{0.00433}{2^{19}}\frac{(\sqrt{p_{21}}/2)^{\ell-19} \sqrt{p_{20}\#} } {(\ell-19) \log p_{21}+\log (p_{20}\#)} \] where \(p_{20}=71\) and \(p_{21}=73\). Since \( (\ell-19) \log p_{21}+\log (p_{20}\#) \leq (\ell-19) \log p_{21} \log (p_{20}\#)\) for \(\ell \geq 21\), we have \[ \frac{h_K}{2^\ell} \geq \frac{0.00433} {2^{19} \log p_{21}} \frac{\sqrt{p_{20}\#}} {\log (p_{20}\#)} \frac{(\sqrt{p_{21}}/2)^{\ell-19}} {\ell-19}. \] Noting that the right-hand side is an increasing function for \(\ell \geq 21\), we can attain \[ \frac{h_K}{2^\ell} \geq \frac{0.00433} {2^{19} \log p_{21}} \frac{\sqrt{p_{20}\#}} {\log (p_{20}\#)} \frac{(\sqrt{p_{21}}/2)^{2}} {2}. \] It is easily checked that \[ \frac{0.00433} {\log p_{21}}\frac{(\sqrt{p_{21}}/2)^{2}} {2} = \frac{0.00433} {\log 73}\frac{(\sqrt{73}/2)^{2}} {2} > 0.0092 \] and \[ \frac{\sqrt{p_{20}\#}} {\log (p_{20}\#)} > 3.8353\cdot 10^{11}. \] Thus, \[ \frac{h_K}{2^\ell} > \frac{0.0092} {2^{19}} \cdot 3.8353 \cdot 10^{11} > 1. \] Therefore, we obtain \(h_K>2^\ell\) and hence \(h_K\neq 2^\ell\) in (\ref{eqn:ToBeProved}) for all \(\ell\geq 1\). The proof of Proposition~\ref{prop:EquivalentPropositionOneTwo} is complete. \eof % \vspace{6cm} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \section*{Appendix~A: Proof of Lemma~\ref{lemma:IntegralLemmaTwo}} For \(T\geq T_0\), where \(T_0 \geq 2\) is a sufficiently large but fixed positive number, we consider the following integral \[ \rho(T) = \int_{-1-\beta+iT}^{2-\beta+iT} f(s) ds \] where the number \(\beta\in (0,1)\) is fixed and the function \(f(s)\) is defined by \[ f(s) = \frac{\zeta_K(s+\beta) y^s}{s\prod_{\ell=2}^9(s+\ell)} = \frac{\zeta(s+\beta) L(s+\beta,\chi) y^s}{s\prod_{\ell=2}^9(s+\ell)} \] for a given number \(y>1\). By using \(s=\sigma+iT\) with \(-1-\beta \leq \sigma \leq 2-\beta\), the complex integral \( \rho(T) \) can be rewritten as \[ \rho(T) = \int_{-1-\beta}^{2-\beta} f(\sigma+iT) d\sigma. \] With a change of variable, we obtain \[ \rho(T) = \int_{-1}^{2} f(\sigma-\beta+iT) d\sigma = \int_{-1}^{2} \frac{\zeta(\sigma+iT) L(\sigma+iT,\chi) y^{\sigma-\beta+iT}}{(\sigma-\beta+iT)\prod_{\ell=2}^9(\sigma-\beta+iT+\ell)} d\sigma. \] We are going to prove that \(\lim_{T\to\infty} |\rho(T)| = 0\) and hence \(\lim_{T\to\infty} \rho(T) = 0\). It is clear that \begin{equation} |\rho(T) | \leq \int_{-1}^{0} |f(\sigma-\beta+iT)| d\sigma + \int_{0}^{1} |f(\sigma-\beta+iT)| d\sigma + \int_{1}^{2} |f(\sigma-\beta+iT)| d\sigma. \label{eqn:ThreeCases} \end{equation} In the case that \(0\leq\sigma\leq 1\), we can use the properties of \(\zeta(s)\) and \(L(s,\chi)\), where \(s=\sigma+iT\). Since \(T\geq T_0\), we have (see~\cite[p.~142, Theorem~4]{bib:pan1991a}) \[ |\zeta(\sigma+iT)| \leq C_1 T^{(1-\sigma)/2} \log T \] for \(0\leq\sigma\leq 1\), where \(C_1>0\) is an absolute constant. Moreover, since \(\chi\) is a real primitive character of modulus \(q\geq 3\), it is known that (see~\cite[p.~269, Theorem~4]{bib:pan1991a}) \[ |L(\sigma+iT,\chi)| \leq C_2 (qT)^{(1-\sigma)/2} \log (qT) \] for \(0\leq\sigma\leq 1\), where \(C_2>0\) is an absolute constant. Therefore, \begin{equation} \int_{0}^{1} |f(\sigma-\beta+iT)| d\sigma = \int_{0}^{1} \frac{|\zeta(\sigma+iT)| |L(\sigma+iT,\chi)| y^{\sigma-\beta}}{|\sigma-\beta+iT| \prod_{\ell=2}^9 |\sigma-\beta+iT+\ell|} d\sigma \leq C_3 \frac{y^{1-\beta}}{T} \label{eqn:ThreeCasesFirst} \end{equation} where \(C_3 = C_3(q) > 0\) is a constant. In the case that \(1\leq\sigma\leq 2\), we split it into two situations of \(1\leq\sigma\leq 3/2\) and \(3/2 < \sigma\leq 2\). Applying the Phragm\'{e}n--Lindel\"{o}f principle, Rademacher proved the following upper bound~\cite[p.~200]{bib:rademacher1959a} \[ |\zeta_K(\sigma+iT)| \leq 3 \frac{|1+\sigma+iT|}{|1-\sigma-iT|} \left( \frac{|\Delta_K|}{4\pi^2} |1+\sigma+iT|^2 \right)^{\frac{3/2-\sigma}{2}} \zeta(3/2)^2 \] for \(1\leq\sigma\leq 3/2\). On the other hand, we have \[ |\zeta_K(\sigma+iT)| \leq \zeta(\sigma)^2 \leq \zeta(3/2)^2 \] for \(3/2 \leq \sigma\leq 2\). Therefore, \begin{equation} \int_{1}^{2} |f(\sigma-\beta+iT)| d\sigma = \int_{1}^{2} \frac{ |\zeta_K(\sigma+iT)| y^{\sigma-\beta}}{|\sigma-\beta+iT| \prod_{\ell=2}^9 |\sigma-\beta+iT+\ell|} d\sigma \leq C_4 \frac{y^{2-\beta}}{T} \label{eqn:ThreeCasesSecond} \end{equation} where \(C_4 = C_4(q) > 0\) is a constant. In the case that \(-1\leq\sigma\leq 0\), we apply the function equation (\ref{eqn:DedekindFunctionalEquation}) for \(\zeta_K(s)\) to obtain %\begin{equation} \[ |\Gamma(1-\sigma-iT)| |\zeta_K(1-\sigma-iT)| = \left( \frac{|\Delta_K|}{4\pi^2} \right)^{\sigma-1/2} |\Gamma(\sigma+iT)| |\zeta_K(\sigma+iT)|. \] %\label{eqn:FunctionalEquationCaseThird} %\end{equation} Thus, we have \begin{eqnarray*} \lefteqn{ \int_{-1}^{0} |f(\sigma-\beta+iT)| d\sigma } \nonumber \\ & = & \int_{-1}^{0} \frac{ |\zeta_K(\sigma+iT)| y^{\sigma-\beta}}{|\sigma-\beta+iT| \prod_{\ell=2}^9 |\sigma-\beta+iT+\ell|} d\sigma \nonumber \\ & = & \int_{-1}^{0} \left( \frac{|\Delta_K|}{4\pi^2} \right)^{1/2-\sigma} \frac{|\Gamma(1-\sigma-iT)| |\zeta_K(1-\sigma-iT)| y^{\sigma-\beta}}{|\Gamma(\sigma+iT)| |\sigma-\beta+iT| \prod_{\ell=2}^9 |\sigma-\beta+iT+\ell|} d\sigma \nonumber \\ & = & \int_{1}^{2} \left( \frac{|\Delta_K|}{4\pi^2} \right)^{\sigma-1/2} \frac{|\Gamma(\sigma-iT)| |\zeta_K(\sigma-iT)| y^{1-\sigma-\beta}}{|\Gamma(1-\sigma+iT)| |1-\sigma-\beta+iT| \prod_{\ell=2}^9 |1-\sigma-\beta+iT+\ell|} d\sigma \nonumber \\ & \leq & \left( \frac{|\Delta_K|}{4\pi^2} \right)^{3/2} \int_{1}^{2} \frac{|\Gamma(\sigma-iT)| |\zeta_K(\sigma-iT)| }{|\Gamma(1-\sigma+iT)| |1-\sigma-\beta+iT| \prod_{\ell=2}^9 |1-\sigma-\beta+iT+\ell|} d\sigma \end{eqnarray*} Remind that we have Rademacher's upper bound \[ |\zeta_K(\sigma-iT)| \leq 3 \frac{|1+\sigma-iT|}{|1-\sigma+iT|} \left( \frac{|\Delta_K|}{4\pi^2} |1+\sigma-iT|^2 \right)^{\frac{3/2-\sigma}{2}} \zeta(3/2)^2 \] for \(1\leq\sigma\leq 3/2\) and the following bound \[ |\zeta_K(\sigma-iT)| \leq \zeta(\sigma)^2 \leq \zeta(3/2)^2 \] for \(3/2 \leq \sigma\leq 2\). By using Stirling's formula for the gamma function \(\Gamma(s)\), we can obtain (see~\cite[p.~55]{bib:pan1991a}) \[ |\Gamma(\sigma+it)| = \sqrt{2\pi} e^{-\frac{\pi}{2} |t|} |t|^{\sigma-1/2} (1+O(1/|t|)) \] for \(|t|\geq 1\) and \(-5<\sigma<5\) with an absolute implied constant. Thus, when \(T\geq T_0\) with~\(T_0\) sufficiently large but fixed, there is \[ \frac{|\Gamma(\sigma-iT)|}{|\Gamma(1-\sigma+iT)|} = |T|^{2\sigma-1} (1+O(1/|T|)) \leq C_5 |T|^3 \] for \(1\leq \sigma \leq 2\), where \(C_5>0\) is an absolute constant. Therefore, combing the given upper bounds, we get \begin{equation} \int_{-1}^{0} |f(\sigma-\beta+iT)| d\sigma \leq C_6 \frac{1}{T} \label{eqn:ThreeCasesThird} \end{equation} for \(T\geq T_0\), where \(C_6 = C_6(q) > 0\) is a constant. Noting (\ref{eqn:ThreeCasesFirst}), (\ref{eqn:ThreeCasesSecond}) and (\ref{eqn:ThreeCasesThird}), it follows from (\ref{eqn:ThreeCases}) that \[ |\rho(T)| \leq C_3 \frac{y^{1-\beta}}{T} + C_4 \frac{y^{2-\beta}}{T} + C_6 \frac{1}{T} \] for \(T\geq T_0\), which implies \(|\rho(T)| \to 0\) as \(T\to\infty\). In a similar fashion, it can be shown that the following integral \[ \int_{-1-\beta-iT}^{2-\beta-iT} f(s) ds \to 0 \] when \(T\to\infty\). The proof of Lemma~\ref{lemma:IntegralLemmaTwo} is complete. \eof %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \section*{Appendix~B: Proof of Lemma~\ref{lemma:IntelligentLemma}} In this section, we are going to demonstrate that the matrix~\(\mc{M}\) given in Section~\ref{sec:zerofreeinterval} has full column rank. Remind that the matrix ~\(\mc{M}\) is of size \(T\times W^4\), where~\(W\) is a positive integer with \(W\geq q>3\cdot 10^{20}\) and \(T=(T_1+1)(T_2+1)(T_3+1)\) with \[ H=10^6,\;\; U = W^{4/3},\;\; T_1=\lceil 8 H^{2/3} U\rceil,\;\; T_2=T_2=\lceil 8 H^{-1/3} U\rceil. \] It is clear that the matrix~\(\mc{M}\) has more rows than columns due to the following \[ T \geq 8 H^{2/3} U (8 H^{-1/3} U)^2 = 512 U^3 = 512 W^4 > W^4. \] We have \(T_j\geq 8 H^{-1/3} U = 8 (W/H)^{1/3}W > 10^{5}W>3(W-1)\) for \(j=1,2,3\) and \[ \prod_{j=1}^3 [T_j - 3(W-1) +1] > \prod_{j=1}^3 (T_j+1-3W) > T - 6W(T_1T_2+T_2T_3+T_3T_1) \] and hence, from \(T_1>T_2=T_3\), \[ \prod_{j=1}^3 [T_j - 3(W-1) +1] > T - 6W(3T_1T_2) > T - (18/10^{5})T_1T_2T_3 >0.99 T > 500 W^4. \] We put \(b_j = T_j - 3(W-1) \geq 1\) for \(j=1,2,3\), which satisfies \[ \prod_{j=1}^3 (b_j+1) > 500 W^4 > (4W-3)^4. \] We define the following subset of column indices \[ E_W=\{\vec{n}=(n_1,n_2,n_3,n_4)^\top\mid 0\leq n_i\leq W-1 \mbox{ for } i=1,2,3,4\}\subset \Zfld^4. \] We denote \(\vec{0}=(0,0,0,0)^\top\in E_W\) as the index of the first column in the matrix~\(\mc{M}\). The row indices are \(\alpha=(\alpha_1, \alpha_2, \alpha_3)\in \Zfld^3\) with \(0\leq \alpha_j \leq T_j\) for \(j=1,2,3\). Both row and column indices are, respectively, arranged in a lexicographical order, namely, the alphabetical order. The entry of the matrix~\(\mc{M}\) at row \(\alpha=(\alpha_1, \alpha_2, \alpha_3)\) and column \(\vec{n}\in E_W\) is given by \begin{equation} \mc{M}_{\alpha, \vec{n}} = \theta_{\vec{n}}^{\alpha_1} \sigma( \theta_{\vec{n}})^{\alpha_2} \sigma\tau (\theta_{\vec{n}})^{\alpha_3} \label{eqn:EntryM} \end{equation} with \[ \theta_{\vec{n}} = n_1+n_2a+n_3b+n_4ab\in \mc{R} = \Zfld[a,b]. \] Remind that \(a=\sqrt{-N}\) and \(b=\sqrt{2}\). It is agreed that for \(\vec{n}=\vec{0}\) with \(\theta_{\vec{0}}=0\), \( \mc{M}_{\alpha, \vec{n}}\) is defined as~\(1\) for \(\alpha=(0,0,0)\) and \(0\) for \(\alpha\neq (0,0,0)\). We can see that every entry \(\mc{M}_{\alpha, \vec{n}}\) of the matrix~\(\mc{M}\) is an algebraic integer in \(\mc{R}\subset O_L\). Let \(R_\alpha\) denote the \(W^4\)-dimensional row vector of~\(\mc{M}\) with row index \(\alpha\) and \(C_{\vec{n}}\) the~\(T\)-dimensional column vector of~\(\mc{M}\) with column index \(\vec{n}\in E_W\). It is clear that the first row \(R_{(0,0,0)}\) in~\(\mc{M}\) is an all-one vector and the first column~\(C_{\vec{0}}\) in~\(\mc{M}\) is a standard unit vector with \(1\) in the first position. {\em On the contrary}, we assume that the matrix~\(\mc{M}\) does not have full column rank. As a consequence, all the column vectors \(C_{\vec{n}}\), \(\vec{n}\in E_W\), of the matrix~\(\mc{M}\) must be linearly dependent in the number field \(L\). Thus, there exist numbers \(v_{\vec{n}}\in L\), not all zeros, such that \begin{equation} \sum_{\vec{n}\in E_W} v_{\vec{n}} C_{\vec{n}} = {\bf 0} \in L^{T} \label{eqn:ZeroCombination} \end{equation} where \( {\bf 0} \in L^{T}\) is the zero vector. We define the support subset \begin{equation} \mc{S} = \{\vec{n} \in E_W \mid v_{\vec{n}} \neq 0\} \subseteq E_W \subset \Zfld^4 \label{eqn:SupportDefinition} \end{equation} which has the cardinality \(\#\mc{S} \geq 2\), since every column vector of \(\mc{M}\) is a nonzero vector with~\(1\) in the first position. By noticing (\ref{eqn:EntryM}), we see from (\ref{eqn:ZeroCombination}) that, for every row index \(\alpha=(\alpha_1, \alpha_2, \alpha_3)\) of the matrix~\(\mc{M}\), \[ \sum_{\vec{n}\in \mc{S}} v_{\vec{n}} \theta_{\vec{n}}^{\alpha_1} \sigma( \theta_{\vec{n}})^{\alpha_2} \sigma\tau (\theta_{\vec{n}})^{\alpha_3} = 0. \] Therefore, we have \begin{equation} 0 = \sum_{\alpha}c_\alpha \sum_{\vec{n}\in E_W} v_{\vec{n}} \theta_{\vec{n}}^{\alpha_1} \sigma( \theta_{\vec{n}})^{\alpha_2} \sigma\tau (\theta_{\vec{n}})^{\alpha_3} = \sum_{\vec{n}\in E_W} v_{\vec{n}} \sum_{\alpha} c_\alpha \theta_{\vec{n}}^{\alpha_1} \sigma( \theta_{\vec{n}})^{\alpha_2} \sigma\tau (\theta_{\vec{n}})^{\alpha_3} \label{eqn:ZeroSumSum} \end{equation} where the summation \(\sum_{\alpha}\) runs over the row indices \(\alpha\) of \(\mc{M}\) and \(c_\alpha\in \Cfld\) are arbitrarily given complex numbers. Put the \(3\times 4\) matrix \begin{equation} A= \left( \begin{array}{rrrr} {1} & {a} & {b} & {ab}\\ {1} & {-a} & {b} & {-ab} \\ {1} & {-a} & {-b} & {ab} \end{array} \right) \label{eqn:MatrixA} \end{equation} we get the following equality, for \(\vec{n}\in E_W \subset \Zfld^4\), \[ A\vec{n} =(\theta_{\vec{n}}, \sigma(\theta_{\vec{n}}), \sigma\tau (\theta_{\vec{n}}))^\top \in\mc{R}^3. \] We introduce the following arbitrary 3-variate polynomial arising from (\ref{eqn:ZeroSumSum}) \begin{equation} B(z_1,z_2,z_3) = \sum_{\alpha} c_\alpha z_1^{\alpha_1}z_2^{\alpha_2}z_3^{\alpha_3} = \sum_{\alpha_1=0}^{T_1}\sum_{\alpha_2=0}^{T_2}\sum_{\alpha_3=0}^{T_3} c_{(\alpha_1,\alpha_2,\alpha_3 )} z_1^{\alpha_1}z_2^{\alpha_2}z_3^{\alpha_3} \label{eqn:PolynomialBz} \end{equation} with complex variables \(z_1\), \(z_2\) and \(z_3\). It is defined that \(z_j^{0} = 1\) for \(j=1,2,3\) in the ring of polynomials \(\Cfld[z_1, z_2, z_3]\). We call \(B(z_1,z_2,z_3)\) as a zero polynomial if all coefficients \(c_\alpha\)'s are equal to zero. We have, from (\ref{eqn:ZeroSumSum}), that \[ \sum_{\vec{n}\in E_W} v_{\vec{n}} B(A\vec{n}) = \sum_{\vec{n}\in \mc{S}} v_{\vec{n}} B(A\vec{n}) = 0 \] for every {\em nonzero} polynomial \(B(z_1,z_2,z_3)\) with complex variables \(z_1\), \(z_2\) and \(z_3\), given in~(\ref{eqn:PolynomialBz}), where \(\sum_{\alpha}\) is a summation over the row indices \(\alpha=(\alpha_1, \alpha_2, \alpha_3)\) of the matrix~\(\mc{M}\). In the following, we will construct a {\em nonzero} polynomial \[ \hat{B}(z_1,z_2,z_3) = \sum_{\alpha_1=0}^{T_1}\sum_{\alpha_2=0}^{T_2}\sum_{\alpha_3=0}^{T_3} \hat{c}_{(\alpha_1,\alpha_2,\alpha_3 )} z_1^{\alpha_1}z_2^{\alpha_2}z_3^{\alpha_3} \] with complex variables \(z_1\), \(z_2\) and \(z_3\), whose coefficients \(\hat{c}_{(\alpha_1,\alpha_2,\alpha_3 )}\)'s are not all zeros, such that \begin{equation} \sum_{\vec{n}\in\mc{S}} v_{\vec{n}} \hat{B} (A\vec{n}) \neq 0, \label{eqn:ContradictionConstruct} \end{equation} which gives a {\em contradiction}. As a result, the matrix~\(\mc{M}\) must have full column rank. We define \[ \mc{P}=\conv(\mc{S}) \subset [0, W-1]^4 \subset \Rfld^4 \mbox{ and } \mc{K}=4\mc{P}. \] Remind that \(b_j = T_j - 3(W-1) \geq 1\) for \(j=1,2,3\). It is seen that \[ \mc{K}\subset [0, 4(W-1)]^4 \subset \Rfld^4 \mbox{ and } \#(\mc{K} \cap \Zfld^4) \leq (4W-3)^4 <\prod_{j=1}^3 (b_j+1). \] Therefore, there exists a {\em nonzero} 3-variate polynomial \begin{equation} R(z_1,z_2,z_3) = \sum_{\alpha_1=0}^{b_1}\sum_{\alpha_2=0}^{b_2}\sum_{\alpha_3=0}^{b_3} \hat{r}_{(\alpha_1,\alpha_2,\alpha_3 )} z_1^{\alpha_1}z_2^{\alpha_2}z_3^{\alpha_3} \label{eqn:PolynomialR} \end{equation} with complex variables \(z_1\), \(z_2\) and \(z_3\) and \(\hat{r}_{(\alpha_1,\alpha_2,\alpha_3)}\in\Cfld\) such that \begin{equation} R(A\vec{k})=0 \mbox{ for all } \vec{k} \in \mc{K} \cap \Zfld^4 \label{eqn:PolynomialZeroRegion} \end{equation} since \(A\vec{k} \in\Cfld^3\) and \(\#\{A\vec{k} \mid \vec{k} \in \mc{K} \cap \Zfld^4 \} \leq \#(\mc{K} \cap \Zfld^4)\). The \(3\times 4\) matrix \(A\) given by (\ref{eqn:MatrixA}) has full row rank. Thus, for any vector \(z\in\Cfld^3\), there is a vector \(x\in\Cfld^4\) such that \(Ax=z\). As a consequence, the 4-variate polynomial~\(R(Ax)\) with complex variables \(x=(x_1,x_2,x_3,x_4)^\top\) is {\em nonzero}. By using the fundamental theorem of algebra and the method of mathematical induction, we can readily prove that the nonzero 4-variate polynomial \(R(Ax)\) cannot vanish on the entire integer lattice \(\Zfld^4\). Noting (\ref{eqn:PolynomialZeroRegion}), we see that there exists an \(\vec{m}\in\Zfld^4\) but \(\vec{m}\notin\mc{K}\) such that \(R(A\vec{m})\neq 0\). It is clear that \(\mc{K}\) is a nonempty, closed and convex subset of \(\Rfld^4\). The projection of a point \(\vec{m}\in\Rfld^4\) onto the set \(\mc{K}\), denoted by \(\proj_\mc{K}(\vec{m})\), is defined as the solution (which must exist and be unique) to the mathematical program of \(\min_{x\in \mc{K}}\|\vec{m}-x\|\), where \(\|x\|=\sqrt{x^\top x}\) denotes the Euclidean norm or 2-norm of the column vector \(x\in\Rfld^4\). Moreover, we denote the distance between the point \(\vec{m}\) and the closed convex subset~\(\mc{K}\) by \( \dist(\vec{m}, \mc{K})=\min_{x\in \mc{K}}\|\vec{m}-x\| = \|\vec{m}-\proj_\mc{K}(\vec{m})\| \). For \(x\in\Rfld^4\) and \(y\in\Rfld^4\), the inner product of \(x\) and \(y\) is given by \[ \lgl x, y \rgl = x^\top y \] which implies that \(\lgl x, y \rgl = \lgl y, x \rgl\) and \(\lgl x, x \rgl = \|x\|^2\). The projection operator \(\proj_\mc{K}(\cdot)\) has the following property (see, e.g.,~\cite[Lemma~1]{bib:liang2001a}). If \(x\in \mc{K}\), then, for any \(\vec{m}\in\Rfld^4\), \[ \lgl \vec{m}-\proj_\mc{K}(\vec{m}), x-\proj_\mc{K}(\vec{m}) \rgl \leq 0. \] We can choose a specific element from the set of all \(\vec{m}\in\Zfld^4\setminus\mc{K}\) satisfying \[ R(A\vec{m})\neq 0 \] which has the {\em shortest} distance \( \dist(\vec{m}, \mc{K})\) from \(\mc{K}\), which is still denoted by \(\vec{m}\in\Zfld^4\). We define two points \(\vec{p}\in\Rfld^4\) and \(\vec{h}\in\Rfld^4\) as follows \begin{equation} \vec{p} = \proj_\mc{K}(\vec{m}) \mbox{ and } \vec{h} = \vec{m} - \vec{p} \label{eqn:phTwoPoints} \end{equation} which has the property that, for all \(x\in \mc{K}=4\mc{P}\subset\Rfld^4\), \[ \lgl \vec{h}, x-\vec{p} \rgl =\lgl \vec{m} - \vec{p}, x-\vec{p} \rgl \leq 0. \] For all \(\vec{v} \in \mc{P}\subset\Rfld^4\), we have \(4\vec{v} \in \mc{K}=4\mc{P}\) and therefore \(\lgl \vec{h}, 4\vec{v} - \vec{p} \rgl \leq 0\). Hence, \begin{equation} \lgl \vec{h}, \vec{v} \rgl \leq \lgl \vec{h}, \vec{p}/4 \rgl \label{eqn:PropertyPointP} \end{equation} where \(\vec{p}/4\in \mc{P}\) due to \(\vec{p}\in \mc{K}\). We introduce the following supporting face \begin{equation} \mc{G} = \{ \vec{v} \in \mc{P} \mid \lgl \vec{h}, \vec{v} \rgl = \max_{\vec{w}\in \mc{P} } \lgl \vec{h}, \vec{w} \rgl \} \subset\Rfld^4 \label{eqn:DefinitionFaceG} \end{equation} which has dimensions {\em at most three}. It is clear from (\ref{eqn:PropertyPointP}) that \(\vec{p}/4\in \mc{G}\). According to Carath\'{e}odory's convexity theorem \cite{bib:caratheodory1911a}, if the convex hull of a set of points has~\(\ell\) dimensions, then any point in the convex hull can be written as a convex combination of at most \(\ell+1\) vertices. Since \(\vec{p}/4\in \mc{P}\subset\Rfld^4\), there exist~\(k\) vertices \(\vec{v}_1, \cdots, \vec{v}_k\in\mc{S}\subset\mc{P}=\conv(\mc{S})\) with \(1\leq k \leq 5\) such that \[ \vec{p}/4 = \sum_{\ell=1}^k \lambda_\ell \vec{v}_\ell \] where \(\lambda_\ell > 0\) for \(1\leq \ell \leq k\) and \(\sum_{\ell=1}^k \lambda_\ell = 1\). We can prove that it is enough for~\(k\) to be at most four. In fact, if \(k=5\), then, by using (\ref{eqn:PropertyPointP}), \[ \lgl \vec{h}, \vec{p}/4 \rgl = \left \lgl \vec{h}, \sum_{\ell=1}^5 \lambda_\ell \vec{v}_\ell \right\rgl = \sum_{\ell=1}^5 \lambda_\ell \lgl \vec{h}, \vec{v}_\ell \rgl \leq \sum_{\ell=1}^5 \lambda_\ell \lgl \vec{h}, \vec{p}/4 \rgl = \lgl \vec{h}, \vec{p}/4 \rgl \] which implies that, for \(1\leq \ell \leq 5\), \[ \lgl \vec{h}, \vec{v}_\ell \rgl = \lgl \vec{h}, \vec{p}/4 \rgl. \] Therefore, by (\ref{eqn:DefinitionFaceG}), we have \(\vec{v}_\ell \in\mc{G}\) for \(1\leq \ell \leq 5\). It follows that \[ \vec{p}/4 \in \conv(\{ \vec{v}_1,\vec{v}_2,\vec{v}_3,\vec{v}_4,\vec{v}_5\}) \subset \mc{G} \] which has dimensions at most three. By using Carath\'{e}odory's theorem again, \(\vec{p}/4\) can be written as a convex combination of at most four vertices in \(\{ \vec{v}_1,\vec{v}_2,\vec{v}_3,\vec{v}_4,\vec{v}_5\}\). Therefore, combining the above results, there exist~\(k\) vertices \(\vec{u}_1, \cdots, \vec{u}_k\in\mc{S}\cap\mc{G}\) with \(1\leq k \leq 4\) such that \[ \vec{p}/4 = \sum_{\ell=1}^k \lambda_\ell \vec{u}_\ell \] where \(\lambda_1\geq\cdots\geq\lambda_k> 0\) and \(\sum_{\ell=1}^k \lambda_\ell = 1\). Thus, there must be \(\lambda_1\geq 1/4\). We define the point \begin{equation} \vec{u} = \vec{u}_1\in\mc{S}\cap\mc{G} \label{eqn:uPoint} \end{equation} which has the property of \[ \vec{p} - \vec{u} = 4\sum_{\ell=1}^k \lambda_\ell \vec{u}_\ell - \vec{u} = (4\lambda_1 - 1) \vec{u}_1 + \sum_{\ell=2}^k 4\lambda_\ell \vec{u}_\ell \in 3\mc{P}. \] In the case that \(\mc{S}\setminus\mc{G}\neq\emptyset\), for every \(\vec{n}\in\mc{S}\setminus\mc{G} \subset\mc{P}\), by noting (\ref{eqn:DefinitionFaceG}) we have \[ \lgl \vec{h}, \vec{u} - \vec{n} \rgl = \lgl \vec{h}, \vec{u} \rgl - \lgl \vec{h}, \vec{n} \rgl > 0. \] We define two points \(\vec{p}_1\) and \(\vec{m}_1\) by \[ \vec{p}_1 = \vec{p} - \vec{u} + \vec{n} \in \mc{K}=4\mc{P} \mbox{ and } \vec{m}_1 = \vec{m} - \vec{u} + \vec{n} \in \Zfld^4. \] It is clear that \(\vec{m}_1= \vec{p}_1 + \vec{h}\), where \(\vec{h} = \vec{m} - \vec{p} = \vec{m} - \proj_\mc{K}(\vec{m})\). For any \(0<\tau<1\), we have \(\tau \vec{p} +(1-\tau) \vec{p}_1 \in \mc{K}\) and \[ \|\vec{m}_1 - [\tau \vec{p} +(1-\tau) \vec{p}_1]\|^2 = \|\vec{h} - \tau (\vec{u} - \vec{n})]\|^2 = \|\vec{h}\|^2 -2\tau \lgl \vec{h}, \vec{u}-\vec{n} \rgl + \tau^2 \|\vec{u} - \vec{n}\|^2. \] Let \(\eta=2 \lgl \vec{h}, \vec{u}-\vec{n} \rgl / \|\vec{u} - \vec{n}\|^2>0\). Then, for any \(0<\tau<\min\{1,\eta\}\), we get \[ (\dist(\vec{m}_1, \mc{K}))^2 \leq \|\vec{m}_1 - [\tau \vec{p} +(1-\tau) \vec{p}_1]\|^2 < \|\vec{h}\|^2. \] Hence, \(\dist(\vec{m}_1, \mc{K}) < \|\vec{h}\|=\|\vec{m} - \proj_\mc{K}(\vec{m})\|=\dist(\vec{m}, \mc{K})\). According to the property of the chosen point \(\vec{m}\), we obtain \begin{equation} R(A\vec{n} + A(\vec{m} - \vec{u})) = R(A\vec{m}_1) = 0 \mbox{ for } \vec{n}\in\mc{S}\setminus\mc{G}. \label{eqn:NonzeroCaseFirst} \end{equation} Remind that \(\#\mc{S} \geq 2\) and the point \(\vec{u} \in\mc{S}\cap\mc{G}\). It is clear that \[ \mc{S}=(\mc{S}\cap\mc{G}) \cup (\mc{S}\setminus\mc{G}). \] In the case that \(\#(\mc{S}\cap\mc{G}) \geq 2\), there exists at least one \(\vec{n}\in\mc{S}\cap\mc{G}\) with \(\vec{n}\neq\vec{0}\). Every \(\vec{n}\in\mc{S}\cap\mc{G}\subset\Zfld^4\) locates in the affine space \(\mc{G}\subset\Rfld^4\) of dimensions at most three. By using Gaussian elimination, the data-fitting linear equations arising from the integer coordinates of all \(\vec{n}\in\mc{S}\cap\mc{G}\) can be solved in the rational field~\(\Qfld\) via {\em exact} arithmetic. Therefore, we can find four rational numbers \(\Wtilde{r}_1\), \(\Wtilde{r}_2\), \(\Wtilde{r}_3\) and \(\Wtilde{r}_4\), which are not all zeros, and the fifth number \(\Wtilde{k}\in\Qfld\) such that every \(\vec{n}=(n_1,n_2,n_3,n_4)^\top\in\mc{S}\cap\mc{G}\) satisfies the following affine equation \[ \Wtilde{r}_1 n_1 + \Wtilde{r}_2 n_2 + \Wtilde{r}_3 n_3 + \Wtilde{r}_4 n_4 = \Wtilde{k}. \] Multiplying both sides of the equation by the largest denominator of the nonzero numbers in \(\{ \Wtilde{r}_1, \Wtilde{r}_2, \Wtilde{r}_3, \Wtilde{r}_4, \Wtilde{k}\}\subset \Qfld\), the above equation is equivalent to \[ r_1 n_1 + r_2 n_2 + r_3 n_3 + r_4 n_4 = k \] where \( r_1, r_2, r_3, r_4, k\in\Zfld\) with \(r_1^2+r_2^2+r_3^2+r_4^2>0\). We can define the following affine hyperplane \begin{equation} \mc{H}_x = \{x\in\Cfld^4 \mid r_1 x_1 + r_2 x_2 + r_3 x_3 + r_4 x_4 = k\} \label{eqn:HyperplaneX} \end{equation} where \(x=(x_1, x_2, x_3, x_4)^\top\) is a column vector. Therefore, \[ \mc{S}\cap\mc{G} \subset \mc{H}_x. \] The \(3\times 4\) matrix~\(A\) given by (\ref{eqn:MatrixA}) has the following four \(3\times 3\) submatrices by deleting one of the four columns of the matrix \[ \left( \begin{array}{rrr} {a} & {b} & {ab}\\ {-a} & {b} & {-ab} \\ {-a} & {-b} & {ab} \end{array} \right), \; \left( \begin{array}{rrr} {1} & {b} & {ab}\\ {1} & {b} & {-ab} \\ {1} & {-b} & {ab} \end{array} \right), \; \left( \begin{array}{rrr} {1} & {a} & {ab}\\ {1} & {-a} & {-ab} \\ {1} & {-a} & {ab} \end{array} \right) \mbox{ and } \left( \begin{array}{rrr} {1} & {a} & {b} \\ {1} & {-a} & {b} \\ {1} & {-a} & {-b} \end{array} \right) \] which have {\em nonzero} determinants of \(4a^2b^2\), \(-4ab^2\), \(-4a^2b\) and \(4ab\), respectively. Without loss of generality, we can assume that \[ r_4\neq 0 \] and will work with the fourth \(3\times 3\) submatrix. Note that if \(r_4=0\) but \(r_j\neq 0\) for some \(j\in\{1,2,3\}\), we can work with the \(j\)th \(3\times 3\) submatrix in a similar fashion. We introduce the following matrix and its inverse \begin{equation} \Gamma= \left( \begin{tabular}{ccc|c} $1$ & $0$ & $0$ & $0$ \\ $0$ & $1$ & $0$ & $0$ \\ $0$ & $0$ & $1$ & $0$ \\ \cline{1-4} $r_1$ & $r_2$ & $r_3$ & $r_4$ \end{tabular} \right) \mbox{ and } \Gamma^{-1}= \left( \begin{tabular}{ccc|c} $1$ & $0$ & $0$ & $0$ \\ $0$ & $1$ & $0$ & $0$ \\ $0$ & $0$ & $1$ & $0$ \\ \cline{1-4} $-r_1/r_4$ & $-r_2/r_4$ & $-r_3/r_4$ & $1/r_4$ \end{tabular} \right). \label{eqn:MatrixGammaWithInverse} \end{equation} Then, under the invertible linear transformation of \(y=\Gamma x\), the image of the affine hyperplane \(\mc{H}_x\) given by (\ref{eqn:HyperplaneX}) becomes the following affine hyperplane \begin{equation} \mc{H}_y = \{y\in\Cfld^4 \mid y_4 = k\} \label{eqn:HyperplaneY} \end{equation} where \(y=(y_1, y_2, y_3, y_4)^\top\) is a column vector. We can define the following linear transformation \[ z = A \Gamma^{-1} y \] where \(z=(z_1, z_2, z_3)^\top\) is a column vector and \(A \Gamma^{-1}\) is a \(3\times 4\) matrix with full row rank. It can be computed that \[ z = C(y_1,y_2,y_3)^\top + \frac{k}{r_4}(ab, -ab, ab)^\top \] where \(C\) is a \(3\times 3\) matrix given by \[ C = \left( \begin{array}{rrr} {1} & {a} & {b} \\ {1} & {-a} & {b} \\ {1} & {-a} & {-b} \end{array} \right) +\left( \begin{array}{r} {ab} \\ {-ab} \\ {ab} \end{array} \right) (-r_1/r_4, -r_2/r_4, -r_3/r_4). \] It is easily calculated that \[ 1+(-r_1/r_4, -r_2/r_4, -r_3/r_4)\left( \begin{array}{rrr} {1} & {a} & {b} \\ {1} & {-a} & {b} \\ {1} & {-a} & {-b} \end{array} \right)^{-1} \left( \begin{array}{r} {ab} \\ {-ab} \\ {ab} \end{array} \right) = 1 + \frac{r_3}{r_4}a - \frac{r_2}{r_4}b - \frac{r_1}{r_4}ab \] which must be {\em nonzero} since \(\{1,a,b,ab\}\) is the \(\Qfld\)-basis of the extension \(L/\Qfld\) of degree \([L:\Qfld]=4\). By using the Sherman--Morrison formula~\cite{bib:sherman1950a}, we see that the \(3\times 3\) matrix~\(C\) is invertible and its inverse \(C^{-1}\) can be given explicitly. Therefore, we obtain \[ (y_1,y_2,y_3)^\top = C^{-1} (z_1, z_2, z_3)^\top - \frac{k}{r_4}C^{-1}(ab, -ab, ab)^\top. \] Hence, we can define the following three linear polynomials \begin{equation} L_j(z) = y_j = c_{j1} z_1+c_{j2} z_2+c_{j3} z_3+d_j \mbox{ for } j=1, 2, 3 \label{eqn:LinearPolynomialsLj} \end{equation} where the numbers \(c_{j1}, c_{j2}, c_{j3}, d_j\in L\) for \(j=1, 2, 3\). It is clear that the invertible linear transformation \(y=\Gamma x\) implies that \(y_j = x_j\) for \(j=1, 2, 3\) and that \(z = A \Gamma^{-1} y = Ax\). By (\ref{eqn:LinearPolynomialsLj}), the linear polynomials \(L_j(z)\)'s have the property that for all \(x=(x_1, x_2, x_3, x_4)^\top \in\mc{H}_x\), \[ L_j(Ax) = L_j(z) = y_j = x_j \mbox{ for } j=1, 2, 3. \] In particular, every \(\vec{n}=(n_1,n_2,n_3,n_4)^\top\in\mc{S}\cap\mc{G}\subset \mc{H}_x\) satisfies \[ L_j(A\vec{n})=n_j \mbox{ for } j=1, 2, 3. \] Remind that \(\vec{u}=(u_1,u_2,u_3,u_4)^\top\in\mc{S}\cap\mc{G}\subset \mc{H}_x\) is given by (\ref{eqn:uPoint}). If \(\vec{n}\in\mc{S}\cap\mc{G}\) but \(\vec{n}\neq\vec{u}\), then \[ (n_1, n_2, n_3) \neq (u_1, u_2, u_3). \] Otherwise, by using (\ref{eqn:HyperplaneX}) and \(r_4\neq 0\), we have \(n_4=u_4\) and hence \(\vec{n} = \vec{u}\). We set the Lagrange-type interpolating polynomial of \(z_1\), \(z_2\) and \(z_3\) as follows \[ Q(z) = \prod_{ \substack{ 1 \leq j \leq 4 \\ j \neq 4} } \; \prod_{ \substack{ 0 \leq a \leq W-1 \\ a \neq u_j} } \frac{L_j(z) - a}{u_j - a} \] where \(\vec{u}=(u_1,u_2,u_3,u_4)^\top\in\mc{S}\cap\mc{G}\subset E_W\). It is clear that \(Q(z)\) is a {\em nonzero} \(3\)-variate polynomial of total degree at most \(3(W-1)\) and it has the following property \begin{equation} Q(A\vec{n}) = \left\{ \begin{array}{ll} {1}, & {\mbox{ if } \vec{n}=\vec{u},} \\ {0}, & {\mbox{ if } \vec{n} \in\mc{S}\cap\mc{G} \mbox{ but } \vec{n}\neq\vec{u}.} \end{array} \right. \label{eqn:PropertyPolynomialQ} \end{equation} It is now ready to construct a {\em nonzero} polynomial \(\hat{B}(z)=\hat{B}(z_1,z_2,z_3)\) as follows. We note that \(\#(\mc{S}\cap\mc{G}) + \# (\mc{S}\setminus\mc{G}) = \#\mc{S} \geq 2\) and the specific point \(\vec{u} \in\mc{S}\cap\mc{G}\). If \(\mc{S}\setminus\mc{G} = \emptyset\), then \(\#(\mc{S}\cap\mc{G}) = \#\mc{S} \geq 2\). We can set \(\hat{B}(z) = Q(z)\), which satisfies \[ \sum_{\vec{n}\in\mc{S}} v_{\vec{n}} \hat{B} (A\vec{n}) = \sum_{\vec{n}\in\mc{S}\cap\mc{G}} v_{\vec{n}} Q (A\vec{n}) = v_{\vec{u}} Q (A\vec{u}) = v_{\vec{u}} \neq 0. \] If \(\mc{S}\setminus\mc{G} \neq \emptyset\) and \(\mc{S}\cap\mc{G} = \{\vec{u}\}\), we can set \(\hat{B}(z) =R(z + A(\vec{m} - \vec{u}))\). It is clear that \[ \sum_{\vec{n}\in\mc{S}} v_{\vec{n}} \hat{B} (A\vec{n}) = \sum_{\vec{n}\in\mc{S}\setminus\mc{G}} v_{\vec{n}} \hat{B} (A\vec{n}) + v_{\vec{u}} \hat{B} (A\vec{u}) = \sum_{\vec{n}\in\mc{S}\setminus\mc{G}} v_{\vec{n}} R(A\vec{m}_1) + v_{\vec{u}} R (A\vec{m}) \] where \(\vec{m}_1 = \vec{n} + \vec{m} - \vec{u} \in \Zfld^4\). Hence, from (\ref{eqn:NonzeroCaseFirst}), \[ \sum_{\vec{n}\in\mc{S}} v_{\vec{n}} \hat{B} (A\vec{n}) = v_{\vec{u}} R (A\vec{m}) \neq 0. \] If \(\mc{S}\setminus\mc{G} \neq \emptyset\) and \(\#(\mc{S}\cap\mc{G}) \geq 2\), we set \(\hat{B}(z) = R(z + A(\vec{m} - \vec{u})) Q(z)\). Then, we have \[ \sum_{\vec{n}\in\mc{S}} v_{\vec{n}} \hat{B} (A\vec{n}) %= \sum_{\vec{n}\in\mc{S}\setminus\mc{G}} v_{\vec{n}} \hat{B} (A\vec{n}) % +\sum_{\vec{n}\in\mc{S}\cap\mc{G}} v_{\vec{n}} \hat{B} (A\vec{n}) = \sum_{\vec{n}\in\mc{S}\setminus\mc{G}} v_{\vec{n}} R(A\vec{m}_1) Q (A\vec{n}) +\sum_{\vec{n}\in\mc{S}\cap\mc{G}} v_{\vec{n}} R(A\vec{m}_1) Q (A\vec{n}) \] where \(\vec{m}_1 = \vec{n} + \vec{m} - \vec{u} \in \Zfld^4\). By using (\ref{eqn:NonzeroCaseFirst}) and (\ref{eqn:PropertyPolynomialQ}), we obtain \[ \sum_{\vec{n}\in\mc{S}} v_{\vec{n}} \hat{B} (A\vec{n}) = \sum_{\vec{n}\in\mc{S}\cap\mc{G}} v_{\vec{n}} R(A\vec{m}_1) Q (A\vec{n}) = v_{\vec{u}} R (A\vec{m}) Q (A\vec{u}) = v_{\vec{u}} R (A\vec{m}) \neq 0. \] Therefore, we find a {\em nonzero} polynomial of three complex variables \(z_1\), \(z_2\) and \(z_3\) \begin{eqnarray*} \lefteqn{ \hat{B}(z_1,z_2,z_3) } \nonumber \\ & = & Q(z) R(z - A(\vec{u} - \vec{m})) \nonumber \\ & = & Q(z) \sum_{\alpha_1=0}^{b_1}\sum_{\alpha_2=0}^{b_2}\sum_{\alpha_3=0}^{b_3} \hat{r}_{(\alpha_1,\alpha_2,\alpha_3 )} (z_1-s_1)^{\alpha_1}(z_2-s_2)^{\alpha_2}(z_3-s_3)^{\alpha_3} \nonumber \\ & = & \sum_{\alpha_1=0}^{T_1}\sum_{\alpha_2=0}^{T_2}\sum_{\alpha_3=0}^{T_3} \hat{c}_{(\alpha_1,\alpha_2,\alpha_3 )} z_1^{\alpha_1}z_2^{\alpha_2}z_3^{\alpha_3} \end{eqnarray*} with the shift \(A(\vec{u} - \vec{m}) = (s_1,s_2,s_3)^\top\), which satisfies \[ \sum_{\vec{n}\in\mc{S}} v_{\vec{n}} \hat{B} (A\vec{n}) \neq 0. \] Thus, the proof of Lemma~\ref{lemma:IntelligentLemma} is complete. \eof %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % \section{Acknowledgment} % \label{sec:ack} % The author would like to thank for many useful conversations and suggestions % on the work in this paper. % Specifically, the author is very grateful for his pointing out the reference % and providing the author some guidance in understanding the result therein. %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \begin{thebibliography}{1} \bibitem{bib:andrews1986a} G. E. Andrews, The fifth and seventh order mock theta functions, {\em Trans. Amer. Math. Soc.}, {\bf 293} no. 1 (1986), 113--134. \bibitem{bib:apostol1976a} T. M. Apostol, {\em Introduction to Analytic Number Theory}, New York, NY: Springer, 1976. \bibitem{bib:bateman1951a} P. T. Bateman, On the representations of a number as the sum of three squares, {\em Transactions of the American Mathematical Society}, {\bf 71} no. 1 (1951), 70--101. \bibitem{bib:caratheodory1911a} C. Carath\'{e}odory \"{U}ber den variabilit\"{a}tsbereich der fourier’schen konstanten von positiven harmonischen funktionen, {\em Rendiconti del Circolo Matematico di Palermo}, {\bf 32} (1911), 193--217. \bibitem{bib:cohen2007a} H. Cohen, {\em Number Theory Volume I: Tools and Diophantine Equations}, Graduate Texts in Math. 239, New York, NY: Springer, 2007. \bibitem{bib:conrad} K. Conrad, Ostrowski's theorem for number fields, {\em Expository Papers}, Online available: https://kconrad.math.uconn.edu/blurbs \bibitem{bib:conrey2002a} J. B. Conrey and K. Soundararajan, Real zeros of quadratic Dirichlet L-functions, {\em Invent. Math.}, {\bf 150} no. 1 (2002), 1--44. \bibitem{bib:crandall1999a} R. E. Crandall, New representations for the Madelung constant, {\em Exp. Math.}, {\bf 8} (1999), 367--379. \bibitem{bib:davenport1980a} H. Davenport, {\em Multiplicative Number Theory}, 2nd Edition, Graduate Texts in Math. 74, New York, NY: Springer, 1980. \bibitem{bib:lsenhans2020a} A. S. Elsenhans, J. Kl\"{u}ners, and F. Nicolae, Imaginary quadratic number fields with class groups of small exponent, {\em Acta Arith.}, {\bf 193} no. 3 (2020), 217--233. \bibitem{bib:euler1778a} L. Euler, De formulis speciei \(mxx + nyy\) ad numeros primos explorandos idoneis earumque mirabilibus proprietatibus (Presented 16 March 1778), {\em Nova acta acad. scien. Petropolitonae} {\bf 12} (1794), 1801, 22--46 = Leonhardi Euleri Opera Omnia I, {\bf 4} (1916), 269--289. \bibitem{bib:frei1985a} G. Frei, Leonhard Euler’s convenient numbers, {\em Math. Intell.}, {\bf 7} no. 3 (1985), 55--58, 64. \bibitem{bib:friedlander2018a} J. B. Friedlander and H. Iwaniec, A note on Dirichlet \(L\)-functions, {\em Expo. Math.}, {\bf 36} (2018), 343--350. \bibitem{bib:gauss1986a} C. F. Gauss, {\em Disquisitiones Arithmeticae}, Translated by A. A. Clarke, 1966. New York, NY: Springer-Verlag, 1986. \bibitem{bib:grosswald1985a} E. Grosswald, {\em Representations of Integers as Sums of Squares}, New York, NY: Springer, 1985. \bibitem{bib:grube1874a} F. Grube, Ueber einige Euler'sche \"{S}atze aus der Theorie der quadratischen Formen, {\em Zeitschrift Math. Physik}, {\bf 19} (1874), 492--519. \bibitem{bib:hardy1924a} G. H. Hardy and J. E. Littlewood, Some problems of \lq\lq partitio numerorum" (V): A~further contribution to the study of Goldbach's problem, {\em Proceedings of the London Mathematical Society}, {\bf s2--22} (1924), 46--56. \bibitem{bib:hecke1918a} E. Hecke, in the paper by E. Landau, \"{U}ber die Klassenzahl imagin\"{a}rquadratischer Zahlk\"{o}rper, {\em G\"{o}ttinger Nachrichlen}, {\bf 1918} (1918), 285--295. \bibitem{bib:hoffstein1980a} J. Hoffstein, On the Siegel–Tatuzawa theorem, {\em Acta Arith.}, {\bf 38} (1980), 167--174. \bibitem{bib:hungerford1974a} T. W. Hungerford, {\em Algebra}, Graduate Texts in Math. 73, New York, NY: Springer, 1974. \bibitem{bib:ingham1934a} A. E. Ingham, {\em The Distribution of Prime Numbers}, Cambridge, U.K., 1934. \bibitem{bib:kani2011a} E. Kani, Idoneal numbers and some generalizations, {\em Ann. Sci. Math. Qu\'{e}bec}, {\bf 35} no. 2 (2011), 197--227. \bibitem{bib:lenstra1986a} H. W. Lenstra, Codes from algebraic number fields, in M. Hazewinkel, J. K. Lenstra, and L. G. L. T. Meertens (eds), {\em Mathematics and Computer Science II, Fundamental Contributions in the Netherlands since 1945}, CWI Monograph 4, Amsterdam, Netherlands: North-Holland, 1986, pp. 95--104. \bibitem{bib:liang2024a} X. B. Liang, The \(q\)-ary Gilbert--Varshamov bound can be improved for all but finitely many positive integers \(q\), arXiv:2403.08727, March 2024. \bibitem{bib:liang2001a} X. B. Liang, A recurrent neural network for nonlinear continuously differentiable optimization over a compact convex subset, {\em IEEE Transactions on Neural Networks}, {\bf 12} no. 6 (2001), 1487--1490. \bibitem{bib:mahler1934a} K. Mahler, On Hecke's theorem on the real zeros of the \(L\)-functions and the class number of quadratic fields, {\em Journal of the London Mathematical Society}, {\bf s1-9} no. 4 (1934), 298--302. \bibitem{bib:montgomery2006a} H. L. Montgomery and R. C. Vaughan, {\em Multiplicative Number Theory I. Classical Theory}, Cambridge Studies in Advanced Mathematics 97, Cambridge, U.K.: Cambridge University Press, 2006. \bibitem{bib:mordell1923a} L. J. Mordell, On the number of solutions in positive integers of the equation \(yz + zx + xy = n\), {\em Amer. J. Math.}, {\bf 45} (1923), 1--4. \bibitem{bib:mortenson2017a} E. T. Mortenson, A Kronecker-type identity and the representations of a number as a sum of three squares, {\em Bull. London Math. Soc.}, {\bf 49} (2017), 770--783. \bibitem{bib:mosunov2016a} A. S. Mosunov and M. J. Jacobson, Unconditional class group tabulation of imaginary quadratic fields to \(|\Delta|< 240\), {\em Mathematics of Computation}, {\bf 85} (2016), 1983--2009. \bibitem{bib:neukirch1999a} J. Neukirch, {\em Algebraic Number Theory}, Berlin, Germany: Springer, 1999. \bibitem{bib:openAI2026a} OpenAI, Uniform exclusion of Landau--Siegel zeros, {\em Manuscript}, Oct.~1 (2026), 1--9. \bibitem{bib:ostrowski1916a} A. Ostrowski, \"{U}ber einige l\"{o}sungen der funktionalgleichung \(\varphi(x) \cdot \varphi(x) = \varphi(xy)\), {\em Acta Math.}, {\bf 41} (1916), 271--284. \bibitem{bib:pan1991a} C. D. Pan and C. B. Pan, {\em Fundamentals of Analytic Number Theory}, Beijing: Science Press, 1991 (in Chinese). \bibitem{bib:rademacher1959a} H. Rademacher, On the Phragm\'{e}n--Lindel\"{o}f theorem and some applications, {\em Mathematische Zeitschrift}, {\bf 72} (1959), 192--204. \bibitem{bib:rosser1941a} J. B. Rosser, Explicit bounds for some functions of prime numbers, {\em Amer. J. Math.}, {\bf 63} (1941), 211--232. \bibitem{bib:rosser1962a} J. B. Rosser and L. Schoenfeld, Approximate formulas for some functions of prime numbers, {\em Illinois J. Math.}, {\bf 6} no. 1 (1962), 64--94. \bibitem{bib:sherman1950a} J. Sherman and W. Morrison, Adjustment of an inverse matrix corresponding to a change in one element of a given matrix, {\em Annals of Mathematical Statistics}, {\bf 21} no.~1 (1950), 124--127. \bibitem{bib:siegel1935a} C. L. Siegel, \"{U}ber die Classenzahl quadratischer Zahlk\"{o}rper, {\em Acta Arith.}, {\bf 1} (1935), 83--86. \bibitem{bib:stark1974a} H. M. Stark, Some effective cases of the Brauer--Siegel theorem, {\em Invent. Math.}, {\bf 23} (1974), 135--152. \bibitem{bib:stark1975a} H. M. Stark, The analytic theory of algebraic numbers, {\em Bulletin of the American Mathematical Society}, {\bf 81} no. 6 (1975), 961--972. \bibitem{bib:stewart2002a} I. Stewart and D. Tall, {\em Algebraic Number Theory and Fermat's Last Theorem}, 3rd Edition, Natick, MA: A. K. Peters, 2002. \bibitem{bib:tatuzawa1951a} T. Tatuzawa, On Siegel’s theorem, {\em Japan. J. Math.}, {\bf 21} (1951), 163--178. \bibitem{bib:vinogradov1937a} I. M. Vinogradov, Representation of an odd number as a sum of three primes, {\em Dokl. Akad. Nauk SSSR}, {\bf 15} (1937), 291--294. \bibitem{bib:walfisz1936} A. Walfisz, Zur additiven Zahlentheorie. II., {\em Mathematische Zeitschrift}, {\bf 40} (1936), 592--607. \bibitem{bib:watkins2004a} M. Watkins, Real zeros of real odd Dirichlet \(L\)-functions, {\em Math. Comp.}, {\bf 73} no. 245 (2004), 415--423. \bibitem{bib:weil1964a} A. Weil, {\em Number Theory: An approach through history}, Boston: Birkh\"{a}user, 1964. \bibitem{bib:weinberger1973a} P. Weinberger, Exponents of the class groups of complex quadratic fields, {\em Acta Arith.}, {\bf 22} (1973), 117--124. \bibitem{bib:williams1970a} K. S. Williams, Integers of biquadratic fields, {\em Canadian Mathematical Bulletin}, {\bf 13} no. 4 (1970), 519--526. \end{thebibliography} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \indent \mbox{} \\ \indent {\small Louisiana State University, Baton Rouge, LA 70803} \mbox{} \\ \indent {\small \em E-mail:} xbliang@lsu.edu \end{document} % \typeout{get arXiv to do 4 passes: Label(s) may have changed. Rerun}