For with rational 2-torsion , the quotient by that point is the two-isogenous curve
The two-isogeny descent maps a nonexceptional point to the square class of its -coordinate, with mapping to . The images are finite collections of squarefree divisors of and , determined by testing the associated homogeneous quartics for rational points. If their orders are and , then
which determines the Mordell-Weil rank .
The method requires a rational 2-isogeny, and deciding whether every locally soluble quartic is globally soluble can be difficult. Computing only local conditions gives a 2-isogeny Selmer group and hence an upper bound; a nontrivial Tate-Shafarevich group can make that bound strict. Even after finding the rank, a separate saturation and point search may be needed to find generators.
Take to contain every finite prime dividing and every prime of bad reduction of . The local theory of reduction of an elliptic curve shows that Kummer classes of rational points are unramified outside . Choose a basis of the constant group . Kummer theory and the Weil pairing identify the resulting two scalar coordinates of
with power classes in . The ramification statement places both coordinates in . Restriction to is injective by the nondegeneracy proved in part b, and therefore
Define the S-unramified power class group by
There is an exact sequence from the -unit group modulo th powers into and then into the -torsion of the ideal class group. By the Dirichlet unit theorem,
after absorbing the fixed roots of unity into the exponent. The ideal class group has fixed finite order . Since , choose a constant depending only on with and the unit contribution bounded by . Then
For , choose with and define the elliptic Kummer pairing
Replacing by with changes nothing because all -torsion is -rational; replacing by permits replacing by , again without changing the value. The group laws prove bilinearity. An automorphism pairing trivially with every class fixes every division point and hence . Conversely, if pairs trivially with every automorphism, a chosen is Galois fixed, so and . The pairing is therefore nondegenerate.
For , choose with and define the Kummer pairing
Changing by an th power or changing its root leaves the quotient unchanged because . Multiplication of radicals proves bilinearity. If an automorphism pairs trivially with every class, it fixes all generating radicals and hence all of . If a class pairs trivially with every automorphism, its radical lies in , so the class is trivial. Thus the pairing is well-defined, bilinear, and nondegenerate on both sides.
Writing , , and turns the cubic into . The birational coordinates
give the Weierstrass equation
The original projective cubic has no common zero of its three partial derivatives modulo any , so it is already a smooth proper model and has good reduction at every such prime.
If , then , all nine inflection points are rational, and contains , so it is not cyclic. If , cubing is a bijection on . Counting on the Fermat model gives . A finite elliptic-curve group has the form with and , so . For odd , the equation has exactly one root because cubing is bijective, so there is only one nonzero rational 2-torsion point and . Hence the group is cyclic. For it has order three and is cyclic as well.
The Weil pairing is nondegenerate and Galois equivariant. If all of is rational over a field, pairing a basis produces a primitive cube root of unity in that field. Thus a quadratic field with full 3-torsion must contain and must equal it.
More generally, if , Frobenius acts as the identity on . Its characteristic polynomial is therefore congruent to modulo . Comparing coefficients gives
In particular with .
The Hessian determinant of is a nonzero scalar multiple of . Hence the inflection points are
There are nine of them. Since is an inflection point, these are exactly . They are all defined over
so .
Apply the Riemann-Roch theorem to the divisors . Since the genus is one and the canonical divisor is trivial, for . Choose
Then and have exact pole orders two and three at . The seven functions
lie in the six-dimensional space , so they satisfy one relation. Comparing pole orders and completing squares and cubes gives a nonsingular Weierstrass equation of an elliptic curve
The functions define the morphism away from . Their pole orders show that it extends with . It has degree one and is therefore an isomorphism of smooth projective curves.
For , the duplication formula is
At , the tangent slope is , so and . If , the unique lowest-valuation terms in the numerator and denominator are respectively and , giving
Induction yields .
For a minimal integral equation, let be the parameter of the formal group of an elliptic curve. Define
where is the kernel of reduction to the identity. The parameter identifies with the formal group on . For odd , the formal logarithm converges on and is an analytic group isomorphism
For , the logarithm gives . The formal duplication series satisfies , so ; successive lifting makes surjective. Its kernel is rational 2-torsion, but has no root in because it has no root modulo . Thus is an isomorphism and
A one-dimensional commutative formal group law over a ring is a series satisfying
An isomorphism from to is a series with and
Over a characteristic-zero field , every such formal group is isomorphic to the additive formal group. Differentiate the associativity identity and define the invariant differential
Termwise integration is possible in characteristic zero; the formal logarithm
has leading term . Invariance of gives
and evaluation at removes the integration constant. Hence . Its unit linear coefficient gives a compositional inverse, so it is an isomorphism to . Therefore any two one-dimensional commutative formal groups over are isomorphic.
Equality of the two point groups implies equality of their orders. Since ,
so
Its two integral solutions are and . The Hasse theorem for elliptic curves excludes the first for every prime and permits the second only when . Thus or .
Both occur. Over , the smooth curve has five rational points and trace . Over , the smooth curve has seven rational points and trace . In either case the point-count formula gives . Since , equal orders give equality of groups.
The zeta function of an elliptic curve over a finite field is the formal power series
The proof of Hasse's theorem gives the characteristic equation . If are the roots of , then the elliptic-curve point count over a finite field is
Using therefore gives
The Hasse theorem for elliptic curves states that
Let be the Frobenius isogeny of an elliptic curve and put . The degree on is a positive-definite quadratic form, its associated bilinear form gives , and . Consequently
for all integers . If , this real quadratic form is indefinite, so by density of rational slopes it is negative at some nonzero integer pair , contradicting nonnegativity of the degree. Hence , which is the claimed bound.
Assume multiplication in were recursive. The multiplication half of Tennenbaum's coding argument says that, for a fixed nonstandard code , both
are computably enumerable from the multiplication table. The proof uses the canonical prime-power coding in PA; bounded inequalities are replaced by existential sum-of-four-squares conditions using the Lagrange four-square theorem, and the resulting witnesses can be searched for effectively from multiplication. Dovetailing the two searches decides the coded set. Applied to , this would make recursive, contradicting the hypothesis. Therefore multiplication in cannot be recursive.
Suppose such a formula existed. Apply the diagonal lemma to to obtain a sentence for which
Because , the equivalence holds in . But the defining property of says exactly when , producing exactly when , a contradiction.
The diagonal lemma says that for every one-variable formula there is a sentence such that
Let be the computable function taking the code of a one-variable formula to the code of . By the assumed representation theorem, choose a Sigma-1 formula representing . Given , put
and let . Taking , representability proves in that the unique relevant is , yielding the required equivalence.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact