At the tangent slope is zero. The elliptic-curve addition formula gives
The chord from to has slope , so its sum has -coordinate and -coordinate . Thus .
Reduction at the good prime seven gives . For , the right sides are respectively . There are respectively choices of . Including the point at infinity gives . Its nonzero torsion points of an elliptic curve of order two are , so it cannot be cyclic. Its two-primary component is and its three-primary component is cyclic of order three; hence
In particular its exponent is six.
The reduction of an elliptic curve is a group homomorphism defined on every -point by projectivity. Thus reduces to the identity for every rational . A finite point with integral coordinates reduces to an affine point, whose projective last coordinate is one, so it cannot reduce to the identity at infinity. Therefore every nonzero finite point has nonintegral coordinates. If , it has no affine coordinates at all. This is the reduction exponent obstruction to integral multiples.
An elliptic curve has good reduction of an elliptic curve at if it admits a Weierstrass equation of an elliptic curve over whose reduced projective cubic is nonsingular. Equivalently its minimal discriminant is a -adic unit.
For the given integral short equation,
It therefore directly supplies good reduction outside . These three primes cannot be rescued by changing the model. An admissible change of Weierstrass model changes the discriminant by a twelfth power, so its valuation changes by a multiple of twelve. The displayed valuations are not congruent to zero modulo twelve. No integral model can have unit discriminant at any of those primes. The good primes are exactly .
Put , and , all in characteristic three. Since , the numerator and denominator have no common factor, and has degree three. The map has degree two. Comparing the degrees in gives , so . This is the degree of an isogeny from its x-coordinate map.
In characteristic three, direct differentiation gives
The supplied -coordinate is , so the invariant differential on an elliptic curve satisfies
In particular is separable. Its dual isogeny satisfies . Since and , the scalar by which pulls back the differential is zero.
Pullback on the elliptic invariant differential is additive for sums of homomorphisms, by the addition identity proved in (a). Consequently
The differential criterion for separability of an isogeny therefore gives separability exactly when , with arbitrary. Such a map is automatically nonzero. When , every nonzero resulting map is inseparable; the zero map is not a separable isogeny. In fact the zero map occurs only at : equality of the degrees of and in a nontrivial vanishing relation would force , and then cancellation would force , contradicting their different differential scalars.
Write the cubic in the Weierstrass equation of an elliptic curve as . A suitable invariant differential on an elliptic curve is
It is regular and nonzero wherever . At a point with , nonsingularity gives , and differentiating the equation shows , again regular and nonzero. At the identity , use the parameter : the expansions start , , so . Thus it is a nowhere-vanishing regular differential on the whole smooth projective curve.
Here is a direct proof of translation invariance of a Weierstrass differential. Fix , let vary, and write . On the open set where the chord-and-tangent group law uses an ordinary chord, put . The addition formulas are and . The line-intersection identity is
Differentiate this polynomial in at to obtain . Differentiating along the curve now gives , and hence
This proves translation invariance on a dense open set. Since the translation on an elliptic curve is an automorphism and both sides are regular differentials, it proves invariance everywhere, including the exceptional addition cases. Translation by is the identity.
Translation invariance also gives for the addition map: its differential on a tangent pair is the sum of the two translated tangent vectors. Therefore for every integer .
Let , with the zero endomorphism assigned degree zero. The assumed degree identity, applied to and , gives
Induction gives for positive ; negation is an automorphism, so the result holds for negative as well. This is quadratic degree recursion for elliptic multiplication.
For a prime , the invariant differential on an elliptic curve has nonzero pullback under , so that map is a separable isogeny. Translation identifies all its fibres and their local multiplicities, so its geometric kernel has exactly its degree distinct points. It is killed by , and therefore
The algebraic closure is essential here; the assertion is not generally true for the rational-point subgroup over itself. This is prime-to-characteristic geometric torsion.
For , the pullback differential vanishes. Its total degree is , and its inseparable degree is at least , so its kernel has at most geometric points. Thus has dimension at most one over , while every other prime-torsion subgroup has dimension at most two. The rational-point group is finite and abelian. The structure theorem for finite abelian groups says that the number of cyclic factors of an -primary component equals the dimension of its subgroup killed by . Each component therefore has at most two factors. Combining the smaller primary factors into one cyclic group and the larger ones into another yields
One may also choose , since the -primary component is cyclic. This explains two generators for elliptic curves over finite fields.
For a finite Galois extension of local fields, let , , and, for integers , define the lower ramification groups by
In particular, is the inertia group. The identity satisfies every bound because .
If the extension is totally ramified, its residue fields agree. Choose representatives in of their common residue field. Every has a convergent uniformiser expansion with these representatives , all fixed by . For ,
Each summand in the second factor has valuation . Thus a bound implies the same bound on , by convergence and the valuation inequality. Necessity follows by testing . This proves the uniformizer criterion for lower ramification groups:
A propositional type is a set of propositional formulas; a Boolean valuation realizes it if every member is true, and omits it if at least one member is false. A consistent propositional theory locally omits if every formula which implies all members of modulo is refutable modulo . Equivalently, whenever is consistent, there is a for which is consistent. For a consistent propositional type, this says that it is a nonprincipal propositional type.
The extended omitting types theorem for propositional logic says that if a consistent locally omits each of a countable family , there is one Boolean valuation satisfying and omitting them all. It also works inside any prescribed finite condition consistent with .
To prove it, start with such a condition , taking when none is prescribed. At stage , choose such that
Such a choice exists by local omission. More explicitly, failure would imply for every , hence , contradicting the stage invariant. Every finite subset of lies inside a consistent stage. By the propositional compactness theorem and the completeness theorem for propositional logic, it has a Boolean valuation. That Boolean valuation satisfies and makes the selected member of every type false. All types are therefore omitted simultaneously. No effective test for consistency is assumed, and the argument does not require the ambient propositional language to be countable. Only the family of omission requirements is countable.
If halts on every input, simulate on input while counting its steps, and output that count when it halts. The resulting function is a total computable function. Consequently yes: one may take the exact running time,
This construction does not promise a simple closed expression or a bound of any particular complexity class; it uses the promised totality of this particular machine.
For a machine computing a partial computable function, its exact halting-time function is still a partial computable function, with the same domain. A finite bound cannot cover a genuinely infinite computation. Even restricting attention to inputs on which halts, a total computable function bounding all halting times need not exist. In fact the precise characterization is the computable bound on halting time criterion:
For the forward implication, compute and simulate for that many steps. If it has not halted, the proposed bound ensures that it never will. This decides the domain. Conversely, first decide whether is in the domain; return zero outside it and the simulated halting time inside it. This defines a total computable function satisfying the bound. The time needed to compute the bound itself is irrelevant to this argument.
A universal halting recognizer has undecidable domain by the halting problem, so it has no such total bound. On the other hand, a machine that immediately halts on even inputs and loops on odd inputs computes a nontotal partial computable function but has a constant bound on its halting times. Thus nontotality alone does not decide whether a total bound exists.
Work internally in the ground model and write . Conditions are finite partial functions with the coordinate-wise value bounds in the PDF, ordered by inclusion, so compatible conditions agree on their common domain and their union is a common strengthening.
Suppose there were many pairwise incompatible conditions. Each fixed finite domain carries fewer than possible functions: it uses finitely many ordinals below , and each coordinate has fewer than choices. Regularity therefore lets us select distinct domains. The finite-set form of the generalized delta-system lemma gives a subfamily of size with common intersection . There are fewer than possible value assignments to the finite root . Regularity gives a further subfamily of size agreeing on the root. Any two of its conditions have a union in , contradicting incompatibility. Thus has the -chain condition. Strong inaccessibility is more than is needed for this finite-support argument; regular uncountability suffices.
For each and , requiring to be in the domain is dense. For each , requiring to occur as a value at some is also dense: choose a fresh and extend the condition. Hence the generic union defines, for each such , a surjection . Every ground ordinal below is therefore countable in .
By the chain condition and the cardinal-preservation argument, remains an uncountable cardinal in the extension; the same small-value argument preserves its regularity as well. All ordinals are unchanged. Since every smaller ordinal is countable and is not,
This is the finite Lévy collapse to omega-one. The dense-set construction proves the collapse below , while the chain condition is what prevents collapsing itself.
Start with a ground model containing a normal splitting Suslin tree , and force with , the finite partial functions from to . Such a starting model is relatively consistent with ZFC: the constructible universe has , and implies the existence of a Suslin tree.
This Cohen forcing is Knaster. In an uncountable family of finite conditions, the delta-system lemma yields an uncountable family whose domains have one common root; thinning to common values on that finite root makes its members pairwise compatible. If is Knaster and is CCC, the product is CCC: thin any uncountable family to pairwise compatible coordinates, then use CCC to find two compatible coordinates. Thus forces that the old is still CCC A name for an uncountable antichain would otherwise produce an uncountable antichain in this product by deciding its nodes.
Countable levels and the tree's splitting property persist, and the splitting argument from the previous part rules out a new cofinal branch in a CCC tree. Therefore the old is still Suslin. Meanwhile the forcing adds at least distinct reals, with all cardinals preserved, so .
We obtain a model with a Suslin tree and . Hence existence of a Suslin tree does not imply the Continuum hypothesis. This uses Knaster forcing preserves Suslin trees, not a claim that arbitrary CCC forcing preserves them.

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