First reduce the polynomial modulo seven. At residues , its values are respectively . Its only residue root is therefore , and is a unit. By Hensel lemma, this residue root lifts uniquely to the 7-adic integers; any other root would have to reduce to the same residue root. Thus there is exactly one root in , congruent to modulo seven.
Modulo five the values at are , so there is no residue root and hence no root in . Modulo three the only possible residue root is . But writing gives
Thus that residue root cannot lift even modulo nine, and there is no root in . A repeated residue root alone would not establish this obstruction; the second congruence is needed.
Modulo two both residues are roots. The even residue is simple because is a 2-adic unit, so Hensel lemma gives exactly one even root. For any odd 2-adic integer, , whence . No odd root can exist. Consequently the full answer is
Use the simple-root form of Hensel lemma. Let be a complete discrete valuation ring, let be a uniformizer, and let . If is a root of with , then there is exactly one root reducing to .
Choose a lift of . Suppose . To construct a lift satisfying the next congruence, write . The polynomial expansion gives
Since is a unit, its residue is invertible in the residue field. There is a unique residue class of making this zero modulo . Thus and . This produces a Cauchy sequence in the complete discrete valuation ring. Its limit satisfies by continuity of polynomial evaluation, and .
For uniqueness, suppose are two such roots. Polynomial division of their difference gives
Because , the second factor is a unit. Hence . The simple-root hypothesis is used both for constructing successive lifts and for this uniqueness argument.
Let for , and write and . The Hecke operator acts on the Fourier expansion by . Since , the primitive relation is . Hence and for . Substituting the argument directly in the Fricke involution gives
Thus, in the basis , put and let be the reversal matrix, . The matrices are
If the exam's rescaling is used, multiply the second matrix by .
Here is an explicit irreducibility argument for the prime-power old block at a bad prime. Any nonzero common invariant complex subspace contains an eigenvector of the restricted . Its eigenvalue is either or zero. If , the -eigenspace is ; containing it gives by reversal, then every by successive powers of . The kernel of is . If instead contains this vector, reversal and give
This is nonzero: the bad-prime eigenvalue of a trivial-character newform satisfies when , and when , whereas . If , the kernel is already , and the same reversal-and-shift argument works. Therefore the block has no nonzero proper subspace invariant under and the Fricke operator, and hence none invariant under the full ring in the question.
The commuting normal operators , together with the finite-order diamond operators, admit simultaneous diagonalization for the Petersson inner product. Their restrictions to the new subspace of cusp forms have one-dimensional common eigenspaces by the newform multiplicity-one theorem. This additional theorem is the essential newform input: normality alone would allow higher multiplicities. Since every commutes with the good-prime operators and preserves the new space, it preserves each such line and is scalar on it. Normalize its nonzero first Fourier coefficient to one to obtain a newform. This gives the requested simultaneous eigenbasis of the new space.
By definition, every old form is a linear combination of lower-level oldforms by argument dilation. Repeatedly split each lower-level cusp space into its old space and its Petersson inner product orthogonal new space; induction on the level shows that the specified dilations of newforms span the full space. To prove independence, separate distinct primitive eigenforms by their good-prime eigenvalues, using the newform multiplicity-one theorem. For a fixed normalized form, its dilations are independent: order the distinct positive integers increasingly, and the coefficient of the least occurring kills its coefficient in any vanishing linear combination. Repeat for the next least . Thus these dilations are indeed a basis.
For trivial character, part (a) shows that commutes with all the good-prime operators, so it preserves the one-dimensional primitive line. Also for the determinant-normalized slash operator; a nonzero trivial-character form has even . Therefore
The power of in an unnormalized Fricke eigenvalue depends on the convention. The plain slash action gives , while the Hecke-style action gives . The PDF prints ; that value requires the deliberate rescaling and does not follow under either usual convention. Under that rescaling its displayed eigenvalue is ; all the preceding eigenspace and conjugation statements are unchanged.
Use the normalized Fricke involution , and let . Choose integers with . The matrix lies in , and has determinant one and lies in , with . The displayed identity in the PDF reads . Taking double cosets therefore identifies the reversed correspondence with the diamond operator times the original one. Conjugation by reverses the two diagonal entries, so
The same finite-correspondence change of variables in the Petersson inner product transfers a matrix to its inverse and yields . The diamond operators commute with , so . Thus is a normal operator. Multiplying by a nonzero scalar does not change the conjugation formula.
Set . It fixes because . Write , ; the eigenvalues of are .
The stabilizer of an interior point of in is conjugate to the compact rotation group. Its intersection with a discrete subgroup is finite: otherwise compactness gives accumulating elements, and their quotients accumulate at the identity. Thus has finite order in the projective group. Its eigenvalues then satisfy for some positive integer , forcing . Hence . This is a necessary condition only.
The normalized Eisenstein series satisfy and . Their weights are four and six. The valence formula for the modular group makes the normalized weight-twelve cusp form have one simple cusp zero and no zero in . Comparing its first coefficient gives .
Odd weights vanish because acts by . Weight two vanishes by the valence formula for the modular group: the forced zero at alone contributes . For every remaining nonnegative even weight, except two, choose with . Subtract the constant coefficient of times . The remainder is a cusp form; division by produces a holomorphic modular form of weight . The cusp and interior orders justify this division. Induction on the weight proves
The integral triangular basis of level-one modular forms is , with and . The induction just given shows these span, and their distinct leading terms show linear independence. Every coefficient is integral by the hypothesis on and the displayed Eisenstein expansions. In , compare coefficients successively: , then is minus an integer combination of already integral coefficients, and similarly for every . The largest permitted is at most , so the stipulated initial coefficients make every integral. Therefore all Fourier coefficients of are integers.
Let and . For in the modular group, left multiplication by powers of and by performs subtraction and exchange on its first-column entries. The Euclidean algorithm reduces to , since the determinant condition makes them coprime. The resulting matrix is , and is already generated. Hence generate .
The standard fundamental domain of the modular group is , with the vertical sides identified by and the circular sides by . To prove every orbit meets it, choose a coprime integer pair minimizing . A minimum exists because only finitely many pairs have this quantity below any fixed bound: bounds , then . Complete the pair to a determinant-one matrix. Its image has maximal imaginary part in the orbit, since . Translate its real part into . If its modulus were below one, inversion would increase its imaginary part, a contradiction. This is the reduction to the standard modular region.
First the eigenvalues of Hecke operators are real. Here is the needed Petersson inner product argument: unfold the finite coset sum defining into its correspondence domain, then change variables by each matrix. The determinant-normalized slash action preserves in the paired integrand, and transfers a representative to its inverse. Multiplying that inverse by the positive scalar gives its adjugate without changing the slash action. Adjugation reverses the integer determinant- correspondence, so the resulting sum is again . Consequently . Taking proves reality of , since .
Fix one prime and set and . The Hecke multiplication relations proved in (a) give , and . The distinct-root assumption excludes .
If , write , . Solving the linear recurrence gives . If is rational, infinitely many satisfy , hence . If it is irrational, density of the corresponding irrational rotation gives infinitely many in the open arc where .
If , let be the real roots of , choosing . Then . Its even-index terms are positive and tend to infinity, whether is positive or negative. Thus the prime-power coefficients of a level-one eigenform are often large and positive, and in either case
For a prime number , the defining finite sum for the Hecke operator simplifies to
The first summand has no term. In the second, summing the th roots of unity selects precisely the terms whose index is divisible by , and its coefficient is . Comparing with , using , gives . This also follows from the general coefficient computation in part (a).
Use the determinant-normalized slash operator and the usual Hecke operator normalization. A normalized eigenform is a nonzero cusp form with and for every . We first establish the operator facts needed here, rather than assume the Hecke multiplication relations.
Integer matrices of determinant have the determinant-n matrix representatives for Hecke operators , with and . Integer row operations give these representatives: the Euclidean algorithm reduces the first column to , and a shear reduces modulo . Right multiplication by the modular group permutes the left cosets, so is modular. Rational changes of coordinate preserve cusp vanishing, so it remains a cusp form. Substituting its Fourier expansion of a modular form and summing gives
In particular , and the normalization gives for every .
For coprime , applying this coefficient formula twice amounts to choosing independently a divisor of and one of . Their product runs exactly once through the divisors of , with the same factor and coefficient index. Thus . For a prime , put and . The coefficient of in is
The coefficient in is , the second summand being zero if . Expanding the two finite sums and matching their endpoints gives for . Equality of all coefficients proves . Applying these identities to the nonzero eigenvector yields
Let , the infinite-order point established in part (c). Every positive multiple is rational and is neither nor 2-torsion: either possibility would force some nonzero multiple of to vanish. Write its coordinates as , so and .
The stated algebraic identity gives positive rational sides
They satisfy , and their area is
by the curve equation. This is the infinitely many rational right triangles from a nontorsion point construction for the congruent number elliptic curve.
The infinitely many points cannot produce only finitely many triangles. For a fixed ratio , the positive number satisfies , so there are at most two choices for , then at most two signs of and two signs of . Thus the map to ordered triangles is finite-to-one. Permuting the two legs introduces only another finite ambiguity. Consequently there are infinitely many distinct rational right triangles of area five. For itself the sides are .
We first determine the torsion. The rational 2-torsion points are . At the good primes three and seven, part (b) gives group orders four and eight. Prime-to-residue-characteristic torsion injects under reduction: an element in the kernel has a formal parameter of positive valuation, and multiplication by an integer prime to the residue characteristic has series with unit leading coefficient, so cannot kill a nonzero such parameter. At seven this excludes rational 3-primary torsion; at three it excludes 7-primary torsion and every odd-primary component other than the already excluded 3-primary component. Thus all torsion is 2-primary and injects at three, bounding its order by four. Consequently
For the rank, use two-isogeny descent with
The two-isogeny formula gives
They extend at the exceptional points, have kernels on their respective curves, and satisfy . These assertions can be checked by substitution; for example the composed x-coordinate is , the duplication x-coordinate. The maps respect addition because they are morphisms fixing : pushforward of divisor classes is additive, takes principal divisors to principal divisors by the norm of a rational function, and under the identification in part 1(a) sends to , and likewise for .
Define the two-torsion square-class homomorphism by , , and . Define on similarly, with . To see the homomorphism property, a nonvertical line cuts either curve in three points whose x-coordinates have product . The chord-and-tangent law therefore makes their square classes multiply to one. When the line passes through , the two remaining x-coordinates have product equal to the coefficient of , exactly explaining the assigned value there. Vertical lines give the inverse-point relation. The same argument includes repeated tangent intersections.
The kernels are and . Here is an explicit check, not just an invocation of the descent correspondence. The x-coordinate of every nonexceptional -image is a square. Conversely, if has , put and . Then , so and the displayed maps it to . For , every nonexceptional -image has ; if , put , . Substitution gives a point of mapping to . The point has square class one and equals ; the point has nonsquare class . Together with the origins these checks handle every exception.
The prime-support bound in two-isogeny descent can be read directly from . At a prime not dividing the integral coefficient , positive valuation of gives , while negative valuation gives ; either way the valuation of is even. Thus the first image has only the candidate classes . All four occur, already at the four torsion points. Hence .
On , nonzero real x-coordinates are positive since has the sign of . Prime support leaves only . The point supplies class five. Class two would give the quartic covering in a two-isogeny descent
Indeed write and clear the square factor in the curve equation. If , the right side is two modulo five, impossible for a square. If , then and ; division by twenty-five gives , again impossible. This is the five-adic obstruction to square class two on the curve with coefficient one hundred. Because the image is a subgroup and contains five, class ten is excluded as well. Therefore has size two.
Now . The quotient is isomorphic to : the kernel of the induced surjection is , which is trivial because equals . Thus . Finite generation follows from the Mordell-Weil theorem, whose height-descent proof is supplied in the essay below. A finitely generated group with the torsion already found has , so . Hence
The point has infinite order, since it is not one of the torsion points. No assertion that this particular point generates the free factor is needed.
At every good prime we have . After removing any even p-adic valuation in the parameter as in part (a), use a smooth reduction with . Let be the Legendre symbol, extended by . Counting the two, one or zero y-values above each x gives
If , then . The terms for and cancel, including zeros, because the cubic is odd. Hence .
For the converse, the four distinct points form the full rational 2-torsion subgroup of the reduced curve. Its group order is therefore divisible by four. If , zero trace would give group order , a contradiction. Consequently
This is the vanishing trace criterion for a congruent number curve. The Hasse theorem for elliptic curves states
For good primes that divide a nonsquarefree displayed parameter, the tilde denotes the smooth reduction of a minimal model, not the singular special fibre of that nonminimal equation.
Bad reduction of an elliptic curve must be tested on a Minimal Weierstrass equation, not inferred merely from primes dividing the displayed elliptic-curve discriminant. For an odd prime , write with . The coordinate change , gives the same form with parameter . If , that parameter is a unit at and its discriminant is a unit, so reduction is good.
If , the new discriminant valuation is six. Discriminants of isomorphic Weierstrass models differ by a twelfth power under a coordinate change, so their valuations differ by a multiple of twelve. An integral model has nonnegative discriminant valuation; consequently a model of valuation six cannot be replaced by one of valuation zero. Reduction is bad. At , oddness of makes the original discriminant valuation six, and the same argument gives bad reduction of an elliptic curve there as well. Thus
These are the bad primes of a congruent number curve with odd parameter. If is squarefree this simplifies to the primes dividing . Squarefreeness is not stated in the PDF: for example, gives a curve isomorphic to by , so it has good reduction at three although the displayed discriminant is divisible by three.
Use in the family from part (b). For order four, take , giving
Its discriminant is , and is a nonzero point equal to its own inverse. Thus and .
For order five, take :
The discriminant is , and gives exact order five by part (b).
For order six, take :
Its discriminant is . Here and ; negation is , so is nonzero 2-torsion. Neither nor is , excluding orders two and three, while . All coefficients and points are rational, and the nonzero discriminants certify genuine elliptic curves.
The nonzero elliptic-curve discriminant forces . At , the derivative with respect to is and that with respect to is zero, so the tangent is . Substitution gives : its third point is . Applying the negation formula gives
The line through and has slope , because their x-coordinates are distinct. Substitution of gives
Its third point is , interpreted with multiplicity if it coincides with a previously used point. Negating it yields
By associativity, exactly when . Equality of their x-coordinates forces , and when their y-coordinates also agree and are zero. Therefore
Since , its order in this case is exactly five. These are the torsion multiples in a two-parameter Weierstrass family formulas.
Choose a Weierstrass equation of an elliptic curve, with origin at infinity. For , draw their chord, or the tangent if they coincide, and call its third intersection , counted with intersection multiplicity. The line through and gives a third point ; define . This is the chord-and-tangent group law. The inverse of an affine point on is , obtained from its vertical line through . These conventions give identity , and cover tangent and flex cases by multiplicity.
Here is a proof of associativity, without assuming that the geometric construction already defines a group. Work first over an algebraic closure and use divisors on an algebraic curve. The Riemann-Roch theorem says . For a smooth genus-one curve the canonical divisor has degree zero, so every degree-one divisor has . Thus every divisor class of degree one has a unique effective representative, necessarily a single point. Existence follows from a nonzero section; uniqueness follows because two distinct effective representatives would give linearly independent sections in the same one-dimensional space. Consequently
is a bijection: add to any degree-zero divisor class, and use its unique degree-one representative.
A line through cuts out a divisor linearly equivalent to , since the line at infinity has triple intersection at the Weierstrass flex . Equivalently, the ratio of the line equation to that of the line at infinity has principal divisor . Thus the three corresponding degree-zero classes sum to zero. Applying the same fact to shows that the point produced by the chord-and-tangent process satisfies
Addition of divisors modulo principal divisors is associative. The two parenthesizations of therefore have identical classes; injectivity of the displayed bijection makes them the same point. Hence the chord-and-tangent law is associative. This is associativity of the chord-and-tangent law via divisor classes. Its construction is defined over the original field, so the same conclusion holds for its rational points.
Write when every -coloring of the -element subsets of has a homogeneous subset of order type . The Erdős-Rado theorem for pairs states, for infinite ,
In particular a countable-color partition of pairs from has an uncountable homogeneous set. The standard Erdős-Rado theorem for finite arities is
We prove it, including the pair case, by constructing an end-homogeneous routing tree.
For a coloring , , route each vertex as follows. Given its previously selected increasing ancestors, choose the least greater than all those ancestors such that
The candidate always qualifies. Select it and stop if it is the minimum; otherwise add the selected to the ancestors and continue, including at limit stages. The ancestors are strictly increasing below , so the process must stop. If a selected ancestor is routed separately, its earlier path is the same: its color constraints agree with those of and the same least choices are forced. Thus the paths define a tree order on the vertices.
A node at depth is determined by the table of its colors on the -subsets of its ancestors. Given the table on , recursively take the least compatible candidate at each depth; at a limit depth use all preceding constraints. This recovers both the path and its final node. Therefore
Along any branch, once an -tuple of ancestors is fixed, the color is independent of all subsequent choices of on that branch. This is exactly end-homogeneity.
For the pair case take and . If all node depths were below , then each level would have size at most , and the union of levels would have size at most . This contradicts the number of vertices. Hence some node has at least ancestors. On that branch assign to each ancestor its constant color to all later ancestors. Regularity of implies that one of the colors occurs times, giving the desired homogeneous set. Its increasing enumeration has a subsequence of order type .
For the higher-arity induction let , so . At depths below the same bound is at most , forcing a branch of length . End-homogeneity defines a coloring of its -tuples by the common color of adjoining a later branch vertex. The previous-arity theorem gives a subset of order type homogeneous for , and every -tuple from it then has the same color under . The base case is the infinite pigeonhole principle at . This proves the full finite-arity statement.
One suitable ordinal partition-bound function is
It is nondecreasing and . It is total: choose an infinite cardinal ; the pair theorem supplies a homogeneous subset of size for every allowed color number, and its order type contains a copy of . Thus is a bound in the displayed minimum.
Let an uncountable cardinal be the supremum of a cofinal increasing sequence of iterates of , with each iterate and its successor still below . For every , monotonicity and some later iterate give . Thus the relevant consequence of being such a supremum is
If the iteration already reaches a fixed point, its constant continuation of course has that fixed point as supremum as well. A strictly increasing countable iteration instead has a countable-cofinality supremum and cannot satisfy the uncountable regular tree-property condition below; one must not assume existence of the extra condition from iteration alone.
Here closure under forces a strong-limit bound. For infinite , color distinct binary strings in by their first differing coordinate. Three strings cannot have all three first-difference coordinates equal, because there are only two bit values at that coordinate. Hence this -coloring has no homogeneous triangle, and in particular no homogeneous subset of order type . Therefore
Since and , it follows that for every .
Now impose the tree property: every tree of height , with nonempty levels of size below , has a cofinal branch. If this definition is extended to singular cardinals, it also forces regularity. For a singular , take disjoint chains of lengths cofinal in , one for each index below . Every level has at most nodes and the height is , but each branch remains in one shorter chain. A common new root may be added if rooted trees are required. Under the more usual convention the tree property is only defined at regular uncountable cardinals, so regularity is part of the convention instead.
For a coloring with , the routing tree has levels of size at most by the strong-limit property. If some node has height at least , there is already an end-homogeneous branch of that length. Otherwise the tree has height exactly : a smaller number of levels of size below could not contain its nodes, by regularity. The tree property then supplies a cofinal branch. Along it, one of the fewer than ancestor colors occurs times, again by regularity. Thus for every , giving
Moreover the closure argument gives strong limit and the tree argument gives regularity. Thus an uncountable -closed cardinal with the tree property is strongly inaccessible.
The final printed assertion requires that qualification. The ordinary tree property alone does not imply strong inaccessibility. At it is König's infinity lemma and is not uncountable. Even when the convention excludes , there are relative-consistency models in which has the tree property, although a successor cardinal is never strongly inaccessible; this result is recalled in the introduction of Friedman, Honzik and Stejskalová. No proof of the bare implication is possible under that standard definition. The preceding paragraphs prove the corrected implication in the actual -closure setting and the requested fixed-point conclusion, without silently replacing tree property by weak compactness.
A measurable cardinal is an uncountable cardinal carrying a nonprincipal -complete ultrafilter : intersections of fewer than members of remain in . Such an ultrafilter contains no set of size less than . Indeed each singleton is absent, and intersecting fewer than singleton complements shows that every small set's complement is in . In particular every tail of is in .
Form the ultrapower of the universe by functions , identifying functions agreeing on a member of , and interpreting membership coordinatewise modulo . The Łoś theorem, applied separately to each formula, makes the map elementary. Countable completeness makes the ultrapower well-founded: an infinite descending chain would give -large sets witnessing each step, whose countable intersection is nonempty; a coordinate in that intersection would give an infinite descending membership chain in the original universe. The relation is extensional and set-like, so the Mostowski collapse theorem gives a transitive class and an elementary ultrapower embedding .
For each , every function is constant modulo . If no fibre were in , intersecting the fewer than fibre complements would give the empty set in . Induction on therefore shows that the collapsed ultrapower ordinal has precisely the elements , so
The identity function represents an ordinal below , and every constant is below it modulo , since a tail is large. Consequently
Thus the canonical collapsed embedding is not the identity; its first moved ordinal is . For a general measure the identity-function class need not collapse to exactly ; that stronger equality holds for a normal measure. The argument above needs only its lower bound.
Conversely, suppose is elementary, is transitive, its critical point is , and its derived measure is a set, as for the usual definable or amenable class embeddings. Define
Because , elementary preservation of complements and intersections makes this an ultrafilter. It is nonprincipal since for . For a sequence of large sets, fixes the index ordinal and takes the intersection to the intersection of their images; belongs to every image and hence to the intersection. Thus is -complete. The set-existence qualification excludes treating an arbitrary external class map as a set parameter without justification.
For context, measurability already implies regularity and the strong-limit property. A cofinal sequence of length below partitions into that many bounded, hence small, pieces; completeness and their absent fibres contradict covering all of . If there were distinct subsets of some , for each coordinate choose the -large side deciding its membership bit. The intersection of these large sets would still be large, but all its indices would label the same subset, so it would have at most one member. This contradiction gives . Thus the first moved ordinal is an uncountable strongly inaccessible cardinal, in addition to being measurable.

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