Namespaces
Variants
Actions

Difference between revisions of "User:Richard Pinch/sandbox-CZ"

From Encyclopedia of Mathematics
Jump to: navigation, search
Line 1: Line 1:
  
 
=Modulus (algebraic number theory)=
 
 
Also an '''extended ideal''', a formal product of [[place]]s of an [[algebraic number field]].  It is used to encode [[ramification]] data for [[abelian extension]]s of a number field.
 
 
Let $K$ be an algebraic number field with ring of integers $R$.  A ''modulus'' is a formal product
 
$$
 
\mathfrak{m} = \prod_{\mathfrak{p}} \mathfrak{p}^{\nu(\mathfrak{p})}
 
$$
 
where $\mathfrak{p}$ runs over all places of $K$, finite or infinite, the exponents $\nu$ are zero except for finitely many $\mathfrak{p}$, for real places $\mathfrak{r}$ we have $\nu(\mathfrak{r})=0$ or $1$ and for complex places $\nu=0$.
 
 
We extend the notion of [[congruence]] to this setting.  Let $x$ and $y$ be elements of ''K''.  For a finite place $\mathfrak{p}$, that is, a prime ideal of the ring of integers, we define $x$ and $y$ to be congruent modulo $\mathfrak{p}^n$ if ''x''/''y'' is in the [[valuation ring]] $R_{\mathfrak{p}}$ of ${\mathfrak{p}}$ and congruent to 1 modulo $\mathfrak{p}^n$ in $R_{\mathfrak{p}}$ in the usual sense of ring theory.  For a real place $\mathfrak{r}$ we define $x$ and $y$ to be congruent modulo $\mathfrak{r}$ if $x/y$ is positive in the real embedding of $K$ associated to the place $\mathfrak{r}$.  Finally, we define $x$ and $y$ to be congruent modulo $\mathfrak{m}$ if they are congruent modulo $\mathfrak{p}^{\nu(\mathfrak{p})}$ whenever $\nu(\mathfrak{p}) > 0$.
 
 
==Ray class group==
 
We split the modulus $\mathfrak{m}$ into $\mathfrak{m}_\text{fin}$ and $\mathfrak{m}_\text{inf}$, the product over the finite and infinite places respectively.  Define
 
$$
 
K_{\mathfrak{m}} = \left\lbrace a/b \in K \mid a,b \in R,~ ab ~\mbox{coprime to}~ \mathfrak{m}_\mbox{fin} \right\rbrace \,,
 
$$
 
$$
 
K_{\mathfrak{m},1} = \left\lbrace x \in K_{\mathfrak{m}} \mid x \equiv 1 \pmod \mathfrak{m} \right\rbrace \ .
 
$$
 
 
We call the group $K_{\mathfrak{m},1}$ the ''ray modulo'' $\mathfrak{m}$.
 
 
Further define the subgroup of the ideal group $I^{\mathfrak{m}}$ to be the subgroup generated by ideals coprime to $\mathfrak{m}_\text{fin}$.  The ''ray class group'' modulo $\mathfrak{m}$ is the quotient $I^{\mathfrak{m}} / i(K_{\mathfrak{m},1})$, where $i$ is the map from $K$ to principal ideals in the ideal group.  A coset of $i(K_{\mathfrak{m},1})$ is a ''ray class''.
 
 
Hecke's original definition of [[Hecke character]]s may be interpreted in terms of [[Character|character]]s of the ray class group with respect to some modulus $\mathfrak{m}$.
 
 
===Properties===
 
* When $\mathfrak{m} = 1$, the ray class group is just the [[ideal class group]].
 
* The ray class group is finite.  Its order is the ''ray class number''.
 
* The ray class number divides the [[Class number (number theory)|class number]] of $K$.
 
 
==References==
 
* Harvey Cohn. "A classical invitation to algebraic numbers and class fields" (Springer-Verlag, 1978) ISBN 0-387-90345-3.  pp.163-187
 
* Harvey Cohn. "Introduction to the construction of class fields". Cambridge studies in advanced mathematics '''6''' (Cambridge University Press, 1985) ISBN 0-521-24762-4.
 
* Gerald J. Janusz.  "Algebraic Number Fields".  Pure and Applied Mathematics '''55''' (Academic Press, 1973) ISBN 0-12-380250. pp.107-113.
 
  
 
=Continuant=
 
=Continuant=

Revision as of 19:10, 1 September 2013


Continuant

An algebraic function of a sequence of variables which has applications in generalized continued fractions and as the determinant of a tridiagonal matrix.

The $n$-th continuant, $K(n)$, of a sequence $\mathbf{a} = a_1,\ldots,a_n,\ldots$ defined recursively by $$ K(0) = 1 ; $$ $$ K(1) = a_1 ; $$ $$ K(n) = a_n K(n-1) + K(n-2) \ . $$ It may also be obtained by taking the sum of all possible products of $a_1,\ldots,a_n$ in which any pairs of consecutive terms are deleted.

An extended definition takes the continuant with respect to three sequences $\mathbf a$, $\mathbf b$, $\mathbf c$, so that $K(n)$ is a function of $a_1,\ldots,a_n$, $b_1,\ldots,b_{n-1}$, $c_1,\ldots,c_{n-1}$. In this case the recurrence relation becomes $$ K(0) = 1 ; $$ $$ K(1) = a_1 ; $$ $$ K(n) = a_n K(n-1) - b_{n-1}c_{n-1} K(n-2) \ . $$ Since $b_r$ and $c_r$ enter into $K$ only as the product $b_r c_r$ there is no loss of generality in assuming that the $b_r$ are all equal to 1.

The simple continuant gives the value of a continued fraction of the form $[a_0;a_1,a_2,\ldots]$. The $n$-th convergent is $$ \frac{K(n+1,(a_0,\ldots,a_n))}{K(n,(a_1,\ldots,a_n))} \ . $$

The extended continuant is the determinant of the tridiagonal matrix $$ \begin{pmatrix} a_1 & b_1 & 0 & 0 & \ldots & 0 & 0 \\ c_1 & a_2 & b_2 & 0 & \ldots & 0 & 0 \\ 0 & c_2 & a_3 & b_3 & \ldots & 0 & 0 \\ \vdots & \ddots & \ddots & \ddots & & \vdots & \vdots \\ 0 & 0 & 0 & 0 & \ldots & c_{n-1} & a_n \end{pmatrix} \ . $$

References

  • Thomas Muir. A treatise on the theory of determinants. (Dover Publications, 1960 [1933]), pp. 516-525.

ABC conjecture

In mathematics, the ABC conjecture relates the prime factors of two integers to those of their sum. It was proposed by David Masser and Joseph Oesterlé in 1985. It is connected with other problems of number theory: for example, the truth of the ABC conjecture would provide a new proof of Fermat's Last Theorem.

Statement

Define the radical of an integer to be the product of its distinct prime factors

\[ r(n) = \prod_{p|n} p \ . \]

Suppose now that the equation \(A + B + C = 0\) holds for coprime integers \(A,B,C\). The conjecture asserts that for every \(\epsilon > 0\) there exists \(\kappa(\epsilon) > 0\) such that

\[ |A|, |B|, |C| < \kappa(\epsilon) r(ABC)^{1+\epsilon} \ . \]

A weaker form of the conjecture states that

\[ (|A| \cdot |B| \cdot |C|)^{1/3} < \kappa(\epsilon) r(ABC)^{1+\epsilon} \ . \]

If we define

\[ \kappa(\epsilon) = \inf_{A+B+C=0,\ (A,B)=1} \frac{\max\{|A|,|B|,|C|\}}{N^{1+\epsilon}} \ , \]

then it is known that \(\kappa \rightarrow \infty\) as \(\epsilon \rightarrow 0\).

Baker introduced a more refined version of the conjecture in 1998. Assume as before that \(A + B + C = 0\) holds for coprime integers \(A,B,C\). Let \(N\) be the radical of \(ABC\) and \(\omega\) the number of distinct prime factors of \(ABC\). Then there is an absolute constant \(c\) such that

\[ |A|, |B|, |C| < c (\epsilon^{-\omega} N)^{1+\epsilon} \ . \]

This form of the conjecture would give very strong bounds in the method of linear forms in logarithms.

Results

It is known that there is an effectively computable \(\kappa(\epsilon)\) such that

\[ |A|, |B|, |C| < \exp\left({ \kappa(\epsilon) N^{1/3} (\log N)^3 }\right) \ . \]

References

Szpiro's conjecture

A conjectural relationship between the conductor and the discriminant of an elliptic curve. In a general form, it is equivalent to the well-known ABC conjecture. It is named for Lucien Szpiro who formulated it in the 1980s.

The conjecture states that: given ε > 0, there exists a constant C(ε) such that for any elliptic curve E defined over Q with minimal discriminant Δ and conductor f, we have

\[ \vert\Delta\vert \leq C(\varepsilon ) \cdot f^{6+\varepsilon }. \, \]

The modified Szpiro conjecture states that: given ε > 0, there exists a constant C(ε) such that for any elliptic curve E defined over Q with invariants c4, c6 and conductor f, we have

\[ \max\{\vert c_4\vert^3,\vert c_6\vert^2\} \leq C(\varepsilon )\cdot f^{6+\varepsilon }. \, \]

References

How to Cite This Entry:
Richard Pinch/sandbox-CZ. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Richard_Pinch/sandbox-CZ&oldid=30301