For , a root would have valuation zero because five is a unit. It would therefore reduce to a unit cube modulo nine. The only cube residue classes modulo nine are , none equal to five. Thus no root exists in .
For , the valuation equation would be , impossible because the valuation of a nonzero element of is an integer. Thus no root exists in .
For , and the derivative . Hensel's lemma lifts this simple root to a root in . Thus a root exists in .
The expansion isThe notation has the units digit before the comma and successive positive powers afterwards, as defined in the source. To check it, the geometric series converges in the 3-adic norm and its sum is .
For the general repeating block, givesBoth numerator and denominator are integers, and the denominator is a -adic unit.
The reduction has equation . At the origin both first partial derivatives vanish, so the point is singular, also when . A lift reducing to the origin would require . Its two cubes would then lie in , whereas the right side of the original equation has valuation one. This is impossible.
For an example which does lift, chooseIt has the same reduction and the rational point reduces to the origin. Over , which has characteristic zero, a singular affine point would require , which does not lie on this curve. Its projective closure is also smooth: the simultaneous partial derivatives of cannot vanish at a projective point. Thus this is a nonsingular curve for every prime , including three. A singular point in the reduction can therefore fail to lift or can lift, depending on the original equation.
Let be the nonzero reductions of . The square set in has members, including zero. Multiplication by , and separately the transformation , preserve this cardinality. Hence the two sets in the hint have total cardinality and must intersect. This gives a solution modulo .
The solution cannot have both coordinates zero since . If , choose any integral lift of and apply Hensel's lemma to the polynomial in : its derivative at the reduced root is . If , use the other variable instead. The nonzero derivative uses . Thus a solution lifts to as required.
For a nonsingular curve with integers , the Nagell–Lutz theorem states that a finite rational torsion point has integer coordinates and satisfies either orThe point at infinity is the identity and is treated separately. Integrality is the result allowed in the source. To prove the remaining divisibility, suppose . Then the doubled point is finite and also torsion, so its coordinates are integral. Its tangent slope is and its abscissa is . Thus is an integer. A rational number whose square is an integer is itself an integer, so divides . In particular divides . It also divides . Evaluating the permitted polynomial identity at the integer therefore proves the divisibility of by .
For , the point equals its negative and has order two. The theorem gives a finite set of torsion candidates, but the divisibility condition by itself does not assert that every candidate is torsion.
Here . A nonzero ordinate of a torsion point must have its square dividing 31, so . The curve equation then becomes , whose only integer solution is . No point with exists over the rationals: the monic cubic has no integer root, since its only possible integer roots are and neither works.
It remains to test . Doubling either gives abscissa , which is not an integer. If the original point were torsion its double would satisfy the integrality part of the Nagell–Lutz theorem, a contradiction. ThereforeThe rational point consequently has infinite order, so its multiples give infinitely many distinct rational points.
The curve has good reduction at five and seven: its discriminant is , and the hypotheses make a unit at those primes. Over the cubing map is a bijection, soThe character sum vanishes after replacing by a variable ranging over the whole field. Over , where , the possible cubes are zero once, one three times, and minus one three times. The corresponding right sides are two, three and one. Two and one are nonzero squares while three is not, so the count is .
Rational torsion injects into the reduction group at a good odd prime, a standard reduction theorem. Thus its order divides . If a point of order three existed, its coordinates would be integral by the Nagell–Lutz theorem. Since , the duplication formula givesThus either and , or and .
At the prime in the hypothesis, is a nonsquare unit. Since , there is a nontrivial cube root of unity , and . Hence is a nonzero square, so both and are nonsquares. Neither ordinate equation is possible even modulo . There is no rational point of order three, proving
Write the equation as . Its duplication formula uses slope and . At the three listed points the slopes are respectively , , and . Substitution givesThese are nonidentity points of order two, so each listed point has exactly order four.
For the three distinct roots zero, one and four give the full two-torsion subgroup of order four over . At least one of is a square: if neither of the first two is, their product is. If is a square, the first listed point exists over the field. If three is a square, the third exists. If is a square, the second can be written and exists without requiring the two separate square roots. The duplication computations remain valid after reduction; their ordinates do not vanish unless or three. Thus a rational two-torsion point has a half over the field. Together with a different two-torsion point this generates a subgroup of order eight. Consequently for every stated prime.
Over the rationals there are already four two-torsion points, including the identity. Counting at five gives eight points: the abscissas zero, one and four give one ordinate each, two and three give two each, and there is the identity. Thus rational torsion has order dividing eight.
There are no rational points of order four. For a curve , translating to zero and using the duplication formula shows that a half of must satisfy . For the three roots here, the candidate abscissas are , , and . The last two pairs are nonrational; at the ordinate squares are , also impossible over . A group of order eight containing this two-torsion subgroup would contain an element of order four, because an elliptic curve has only four points killed by two. Hence
For a point with , consider the valuation at any rational prime. If , the term has strictly lower valuation than and , since the coefficients are integral. Thus , forcing even. If and , the factor is a unit, so , again even. At valuation zero there is no odd exponent to remove.
Therefore every odd valuation in the square class of lies at a prime dividing , and all negative valuations are even. Removing rational squares gives a signed squarefree integer with . For the assigned class is that of , whose squarefree representative also divides ; the identity has representative one. HenceThe brackets stress that these integers represent square classes, which is the target of .
For rank-one two-isogeny descent with parameters three and minus three, use the standard two-isogeny rank formula. For and its dual curve , let be the abscissa square-class maps, with their usual values at and the identity. If is the Mordell–Weil rank, thenFor the present curve , its possible classes are , and the identity and supply . Exclude the class three as follows. A point in that class has , with coprime integers , and substitution in the curve gives the necessary quartic equationwith integer . Modulo three this forces . Coprimality then makes a unit modulo three, and modulo nine the right side is , while , a contradiction. The class minus one is excluded as well, since multiplying it by the known class minus three would give three. Therefore the first image has size two.
The dual curve is . Its quadratic factor is on the real line, so every nonzero rational abscissa is positive. By (i) its image is contained in . The point supplies 21 and the point supplies three. As the square-class map is a homomorphism, their product supplies seven. All four occur. Hence the descent formula gives , so
Fix and put for . Then . Apply the given approximate parallelogram identity with its two arguments and . The quadratic terms cancel exactly, leavingSet . Starting from , the inequality gives . Summing from one to therefore yieldsThus works independently of , including .
The preceding bound at gives for every point . For , take to obtainFor , summing the geometric tail givesThus the sequence is Cauchy and converges by completeness of the real numbers. The estimate also gives a quantitative bound on its distance from the limit.
For prime-power contraction in a formal group, a one-dimensional formal group over has terms of total degree at least two with coefficients in . Induction under composition therefore givesFor this converges and the non-Archimedean inequality gives . The residue characteristic implies ; in equal characteristic the linear coefficient is zero, which only improves the bound.
Let , so . If there is nothing to prove. Otherwise put . Inductively , and then . ThusCompleteness ensures convergence of the formal-series evaluations. The contraction argument in fact does not need the extra discreteness assumption.
For prescribing a factor by elliptic-curve tripling, quadratic reciprocity gives when . Choose with and choose an integer by the Chinese remainder theorem so thatThen and it is four modulo .
The curve has discriminant . At , , since otherwise would force . Also cannot vanish: squaring would give , forcing or 11, neither in the required class. At , makes , and excludes . Thus both reductions are nonsingular.
The point is on every curve in this family. Doubling it uses the invertible denominator two and givesModulo this difference vanishes, and the doubling ordinate is , so and is the identity. Modulo , taking gives , so and have distinct abscissas and their sum is a finite point.
Consequently the attempted addition computing modulo asks to invert a denominator divisible by and not by . Its numerator is nonzero modulo , since the two ordinates there are minus one and one, so this is not a removable coincidence. The Euclidean gcd used for inversion returnsa proper factor. Thus the specified elliptic-curve computation successfully factors .
Articles by others on the same topic
There are currently no matching articles.