Let be the maximal unramified extension of , with residue field . First show that every geometric solution of lies in .
The multiplication-by-n morphism on the reduced elliptic curve is surjective over . Choose with , defined over some finite finite field extension . Let be the corresponding finite unramified extension. By the surjectivity of good reduction over a local field, lift to . Then . The multiplication isomorphism of a formal group law gives a unique with , so is an -division point of defined over .
Taking gives every element of over : reduction is injective on this torsion point of an elliptic curve group because is injective on the formal kernel, and each reduced -torsion point has the unique corrected lift just constructed. Every other division point differs from one lift by an element of . Hence the entire field is unramified, not merely a field containing one choice of .
To bound the composite uniformly in , put . This division field of an elliptic curve is unramified. The Galois group of is procyclic, generated topologically by its Frobenius element , and fixes every element of . If , then
Iteration gives . In particular . Thus every such , for every together, lies in the unique unramified extension of degree . If is the composite of all these fields, the uniform unramified division field over a local field gives
The prime-to- hypothesis is essential to the inverse-series argument; no assertion about arbitrary -division is being made.
In this setting a formal group law means a one-dimensional commutative series with
These identities force terms of total degree at least two. There is a unique formal inverse with .
A morphism to another formal group law is a series satisfying . The invertible morphism criterion for formal group laws is
Necessity follows by comparing linear coefficients in . For sufficiency, solve recursively for a compositional inverse : at every stage the new coefficient is obtained by dividing by the unit , so all coefficients stay in . Applying to the morphism identity shows that is itself a group homomorphism of formal group laws.
In particular, the multiplication series satisfies . Since , the multiplication isomorphism of a formal group law makes invertible over . Its series and inverse converge on , so multiplication by is bijective on , and on for every finite extension .
An elliptic curve has good reduction over if it admits an integral Weierstrass equation of an elliptic curve with unit elliptic-curve discriminant. Equivalently, the reduction of its Minimal Weierstrass equation is a nonsingular cubic over the residue field . Its smooth integral projective model is a group scheme with the point as identity.
Choose homogeneous coordinates in the valuation ring with at least one coordinate a unit, and reduce them modulo its maximal ideal . This defines . The chord-and-tangent group law extends over the smooth integral model, so reduction is a group homomorphism. For any point of , choose an affine projective chart containing it. Smoothness means some partial derivative of its equation is nonzero in . Lift the other coordinate arbitrarily and apply the Hensel lemma to the coordinate with unit derivative. This constructs a point of above the prescribed point, proving the surjectivity of good reduction over a local field.
The kernel of reduction of an elliptic curve consists precisely of points reducing to . The parameter at gives a bijection between this kernel and : the integral formal-coordinate series solve the equation uniquely near . Addition in these coordinates is the formal group of an elliptic curve, not ordinary addition in . Thus
Here the group operation on the last expression is its formal group law.
Let be the Frobenius isogeny and let be its Trace of Frobenius. Its characteristic equation is , so the trace of the square of an elliptic-curve endomorphism is . The elliptic-curve point count over a finite field therefore gives
The prime-square point-count formula is consequently
One can also obtain it directly from the degree of an isogeny: the maps and are separable isogenies, with degrees and . Their composition is , whose kernel of an isogeny is exactly . Multiplicativity of degree gives the same product.
Work first where all three coordinates are finite and the joining line is not vertical. By the chord-and-tangent group law, the third intersection of with the elliptic curve is , whose first coordinate is also . Substitution gives the monic polynomial
Its roots are , counted with intersection multiplicity. Comparing its coefficients with the elementary symmetric polynomials proves
This symmetric-coordinate identity for elliptic-curve addition is an identity of rational functions. It includes tangent cases by specialization. Literally assigning finite when a point is would be meaningless; such cases must be interpreted on the projective curve. A nonsingular equation in the printed short form has characteristic different from two.
Here is how the identity yields the quadratic form for the degree of an isogeny. With , , write and . As an equation for , it becomes
Both and satisfy it, because replacing by does not change . Thus its two branches are the sum and difference maps. Their common denominator is the square of . The following divisor on an algebraic curve calculation keeps track of cancellations and exceptional points rigorously, instead of assuming degrees of displayed numerators always add.
On , equality of the two first coordinates means or . Each coordinate has a double pole at . Consequently the principal divisor identity is
where is the diagonal and is the graph of negation. Equivalently, the two zero divisors are the inverse images of under difference and sum, exactly the two branches identified above. Their generic multiplicities are one; the divisor identity also accounts for their intersections at 2-torsion points.
For nonzero isogenies of elliptic curves with , pull this identity back by . Taking degrees of the resulting principal divisor on gives the divisor proof of the degree parallelogram law:
If one map is zero, this is immediate. If , it follows from . This also proves the parallelogram law for a general Weierstrass equation of an elliptic curve in characteristic two: the same divisor identity uses the quotient by negation, even though the particular symmetric-coordinate formula above is unavailable.
Put and . Applying the parallelogram law to gives the recurrence , and hence for every integer . Its polarization is symmetric and integer-valued. For fixed , the parallelogram law makes odd and gives . Interchanging and adding proves additivity, since integers have no two-torsion. Thus has bilinearity, and is a positive quadratic form on , with whenever .
For a nonzero isogeny of elliptic curves , its degree of an isogeny is the degree of the induced extension of function fields. Since commutes with negation, its first coordinate is a rational function of alone. Write it in lowest terms as
The coordinate maps are finite morphisms of degree two. Multiplying function field degrees in the commutative diagram gives the degree of an isogeny from its x-coordinate map:
This is the total degree, so the argument also covers an inseparable isogeny of elliptic curves. Counting distinct points in the kernel of an isogeny would give only its separable degree. The zero group homomorphism is assigned degree zero separately.
On a Short Weierstrass form in characteristic of a field other than two, the elliptic-curve addition formula gives
There is no cancellation: at a root of , the numerator equals , which is nonzero because the elliptic-curve discriminant is nonzero. The numerator has degree four and the denominator degree three. Hence
For completeness, the same answer holds in characteristic two, where the displayed short equation is not a nonsingular model. On a general Weierstrass equation of an elliptic curve use
where , , , and . The resultant of this numerator and denominator is . Their resultant is therefore nonzero in every nonsingular case; even when the denominator drops degree, the numerator retains degree four.
The Rasiowa–Sikorski lemma constructs a generic filter over each . Every resulting generic extension remains a countable transitive model of ZFC: there are only countably many ground-model names externally. The order has the same elements and ordering at every stage, and atomless forcing order structure is absolute because all its quantifiers are bounded to . Hence the generic filter for an atomless order is new result gives for every .
The increasing union is transitive and contains . If it satisfied Axiom of power set for , there would be a set with
Choose with . The next-stage generic filter belongs to and is an actual subset of . This subset assertion is absolute for the transitive set , so . Transitivity of and then give , a contradiction. Thus the power-set failure in an increasing union of generic extensions occurs already at the fixed ground-model order:
The stages form an increasing chain, not an elementary chain, so the elementary chain theorem does not assert ZFC for their union.
Put and let . Conditions from Fn forcing agree on common coordinates because is directed, so is a function. For each , the ground-model set
is dense: add a value at that coordinate if necessary. The generic filter meets all these sets, making total.
For distinct , the ground-model set
is dense. Choose fresh for both rows of a finite condition and assign and there. Genericity therefore makes the rows pairwise different. The generic coordinate reals for finite-function forcing are , and in the generic extension
The family is a set in , for example by collecting the ground-model names and evaluating the corresponding name for their indexed family. This argument only needs as the specified ground-model ordinal; it does not silently assume a cardinal preservation by chain-condition forcing result.
Suppose, towards a contradiction, that . Then is a ground-model set by axiom schema of separation. It is dense. If , it already lies in . If , atomless forcing order structure gives incompatible forcing conditions . Both cannot belong to the directed filter , so at least one is a strengthening of in .
All compatibility and extension quantifiers range over the same ground-model set , so this density argument is also valid internally in the transitive model . Genericity requires , contradicting the definition of . Therefore a generic filter for an atomless order is new:
The assumption is essential: a forcing atom determines a ground-model generic filter. For an atom , the conditions compatible with form a generic filter : two such conditions have strengthenings below , which have a common strengthening by the atom property; every dense set has a member below . In a general partial order, need not be the principal filter above .
The two-argument version of Fn forcing consists of finite partial functions:
Thus a stronger condition specifies more values. The empty partial function is the greatest condition. Two conditions are compatible forcing conditions exactly when they agree on their common domain; if they do, their set union is a common strengthening. This is in the three-argument convention for Fn forcing. If or is empty, only the empty condition exists. For infinite and at least two elements in , assigning two different values at a fresh coordinate proves that this is an atomless forcing order.
A forcing atom is a condition such that any two strengthenings of are compatible forcing conditions:
An atomless forcing order has no such condition; equivalently,
The meaning of is that there is no common stronger condition. For an arbitrary partial order, an atom need not be a minimal element: the definition concerns compatibility below it. This distinction prevents a minimal-element definition from misclassifying an order with descending but mutually compatible conditions.
We prove power set in a generic extension by bounding possible subnames in the ground model, rather than presupposing the desired power set in . Let , and let . In form
Every is a forcing name. Its value is a subset of : an active pair has for some , so implies and .
Now take any with , and choose a forcing name with . By axiom schema of separation and definability of the syntactic forcing relation,
The atomic membership truth lemma for forcing shows . One inclusion follows immediately from its soundness direction. For the other, if , choose with and . The truth direction supplies forcing ; strengthen within below and to obtain an active pair in representing .
Finally the ground-model forcing name
exists by Axiom schema of replacement and the ground-model power set axiom. Since is nonempty, all contribute their values, and
This set belongs to by the definition of a generic extension. The construction uses all conditions in the outer pairs and therefore does not require a greatest condition in .
Use standard notation for forcing: means that is stronger. A generic filter is nonempty, upward closed and downward directed, and meets every dense subset of a forcing order in the ground model. Names below are forcing names in , with pairs ordered as .
The semantic forcing relation is
Here is the evaluation of a forcing name. Countability of supplies such generic filters through every condition by the Rasiowa–Sikorski lemma.
Define the syntactic forcing relation by mutual well-founded recursion on the forcing names for the atomic cases, then induction on the first-order formula. Its membership clause is
For equality, first abbreviate
and set exactly when both inclusions hold. Each recursive call lowers the rank of at least one forcing name without raising the other. This makes the mutual recursion well-founded.
For a basis of connectives consisting of logical conjunction, negation and existential quantification, the remaining clauses are
The last line is the existential clause of syntactic forcing; witnesses need only occur densely, rather than be forced by itself with one preselected name. Other connectives are defined by logical abbreviations. The recursion gives a definable relation inside for each fixed first-order formula, with quantification over the class of its names. If has no greatest element, use canonical forcing names , which still evaluate to . It also proves monotonicity: strengthening a condition preserves what it forces. The forcing theorem identifies the two relations and supplies the truth lemma.
The assumed beth number equality means in the ambient universe. Put with , using the relative constructible hierarchy defined above.
The base is transitive because every member of a member of is a finite ordinal, hence itself a subset of . Moreover and , and is an inner model of ZF. The latter standard fact follows from the hierarchy and reflection: bounded-rank witnesses give pairing and union; reflection gives separation and replacement; ambient replacement bounds the stages of all relatively constructible subsets of any fixed set, giving power set. It does not require axiom of choice inside . Since no new subsets of can appear in an inner class,
Since inner models with all reals preserve omega-one, it suffices to check that their real-code argument applies to . Every ambient countably infinite ordinal has a well-order code on , coded by a subset of in . Finite ordinals and are already shared. This code belongs to , is well-founded there, and its Mostowski collapse theorem interpretation inside is the same ordinal as outside. Hence the ordinal is countable in . Conversely, any countability witness in remains a witness in the ambient universe. Thus .
If satisfied the Continuum hypothesis in its usual well-orderable formulation, it would contain a bijection from onto its power set of . The same bijection would exist externally from onto , contradicting . Therefore
This proof uses agreement on all reals and on , not an unwarranted assertion that satisfies axiom of choice or computes every higher cardinal number correctly.
A suitable relative condensation lemma fixes the base pointwise. Let be a nonzero limit ordinal, and let be an elementary substructure with
Then the Mostowski collapse theorem gives an isomorphism onto a transitive set, and
For the collapse to apply, the restricted membership relation is well-founded because it is actual membership. It is extensional: if two members of differ, an element distinguishing them in can be chosen in by elementary substructure structure. Since is transitive and all its members are in , transfinite induction on their rank of a set shows that fixes every member of , and then .
By the preceding relative constructible level recognition, . Elementary substructure agreement transfers this to , and the collapse isomorphism transfers it to . Thus and for a nonzero limit ordinal .
For the bound, let . The relative constructible hierarchy has ordinal height : at a successor the definable power set adds exactly the previous ordinal height as a new ordinal, and at limits take unions. The order type of is at most , so ; strict increase of ordinal addition in the right argument gives . The requirement is essential to this version: merely having need not make the collapse fix the base.

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