Suppose first that a simple continued fraction is eventually periodic. Its periodic tail is fixed by the Möbius transformation represented by the continued-fraction matrix of one full period:
Thus
The infinite tail is not rational, since a rational simple continued fraction terminates. Hence is a quadratic irrational, and the finite initial block expresses the original number as another rational Möbius transform of . Therefore every eventually periodic simple continued fraction represents a quadratic irrational.
For the purely periodic fraction ,
so . Positivity selects
Apply the continued-fraction algorithm to :
The complete quotient then repeats, giving
The convergents through one term before the final are
The last of these satisfies the Pell equation
so a positive solution is
Because has characteristic , the prime field lies in , and
for every . These are all roots. Moreover , so is a separable polynomial.
Let be the minimal polynomial of an algebraic element of over . Translation by sends an irreducible factor of to the irreducible factor . The additive group of therefore acts on the irreducible factors, and every orbit has size or . An orbit of size would already contribute to the degree- polynomial , forcing . Then , all roots lie in , and , contrary to the hypothesis.
Thus for every . If , comparison of the coefficient of in for gives times the nonzero leading coefficient, a contradiction. Hence , and since is a monic divisor of the monic degree- polynomial , we have . Thus is irreducible over .
All roots already belong to , so the splitting field is
As the splitting field of a separable polynomial, is a Galois extension. For each , irreducibility gives a distinct -automorphism
These exhaust the automorphisms. This is an Artin–Schreier extension, and
The diagonal Ramsey number is the least positive integer such that every red-blue edge colouring of the complete graph contains a monochromatic copy of .
For the existence and bound, write for the least forcing either a red or a blue . Given a vertex of , the pigeonhole principle says that at least incident edges are red or at least are blue. In the first case those red neighbours contain a red , which joins to to make a red , or a blue ; the second case is symmetric. Hence
Starting from and using Pascal's identity gives the binomial upper bound for a Ramsey number
Therefore
which proves both existence and the required estimate.
To determine , color a cycle graph red and its complement graph, also a , yellow. This colors without a monochromatic triangle, so . At any vertex of a red-yellow , at least three of the five incident edges have one color. If an edge among their three other endpoints has that color, it completes a monochromatic triangle with the chosen vertex; if none does, those three endpoints themselves form a triangle of the other color. Thus , and
The same local argument proves uniqueness on . No vertex can have three incident edges of one color: their other endpoints would either contain an edge of that color or form a triangle of the other color. Every vertex therefore has vertex degree at most two in each color, and because the two degrees sum to four, each is exactly two. Each color class is consequently a regular graph of degree two on five vertices, hence a single . Up to relabelling, the coloring is exactly the cycle-and-complement coloring above.
Finally, the monochromatic-triangle counting formula gives, for a coloring of with red degrees ,
The bound is attained by coloring all edges of red and the two complementary copies of yellow: there are no red triangles and exactly two yellow triangles. The least requested number is therefore
The epsilon-recursion theorem says that for every definable operation assigning a set to each set and each function with domain , there is a unique class function such that
for every set .
For uniqueness, suppose and both satisfy the recursion. If they agree on every , then their restrictions to agree and hence
The epsilon induction principle therefore gives .
For existence, call a function coherent on a transitive set when
The same epsilon-induction argument shows that any two coherent functions agree on the intersection of their transitive domains. Assuming coherent functions have been constructed below every member of , their compatible union defines all values below ; adjoining the value prescribed by extends the construction to . Epsilon induction establishes this construction for every . The compatible local functions therefore unite to the required class function .
A relation on is well-founded when every nonempty subset of has an element with no -predecessor in that subset. It is extensional when
The Mostowski collapse theorem states that every well-founded extensional relation is isomorphic to membership on a unique transitive set . Define recursively
Well-founded recursion makes well defined. Epsilon-style induction along , together with extensionality, shows that is injective. By definition,
so is an isomorphism from onto , where . If , then for some , so ; hence is transitive. If another collapse has transitive range, induction gives , proving uniqueness.
Finally, suppose is finite. Its collapse is a finite transitive set, so every member of is hereditarily finite. Therefore every well-founded extensional relation on collapses to a transitive subset of .
Conversely, let be infinite. Choose the initial infinite ordinal equinumerous with . The successor ordinal has the same cardinality as . Pulling its membership relation back along a bijection gives a well-founded extensional relation on whose collapse is . But is not hereditarily finite, so . Consequently,
Define the canonical momenta
When the velocity Hessian is nonsingular, these equations can be inverted for , and the Hamiltonian is the Legendre transform
Its differential is
because the terms cancel. The Euler-Lagrange equation identifies , so coefficient comparison gives Hamilton's equations
For the symmetric top, the momenta are
Thus
The Legendre transform gives
Both and are cyclic coordinates, so and are conserved. The Hamiltonian has no explicit time dependence and is also conserved. Since is independent of ,
under the Poisson bracket. Hence three independent first integrals in involution are
The term makes locally autocatalytic, while increasing suppresses this production. Thus is the activator and is the inhibitor.
At a positive spatially homogeneous equilibrium,
Hence and , giving
The reaction Jacobian matrix there is
Because , the trace-determinant stability criterion shows that the spatially uniform reaction kinetics are stable exactly when
For a perturbation proportional to , put . Its growth rates are the eigenvalues of
The trace is in the reaction-stable regime, while the determinant is
A Turing instability occurs exactly when this upward-opening quadratic is negative for some . By the two-species diffusion-driven instability criterion, this requires
Together these reduce to
Thus the unstable region in the -plane lies below the straight line and to the left of .
Inside this region, the unstable squared-wavenumber band is
At the bifurcation boundary the two roots coincide, so
Substituting yields
The set is compact, and its complement is connected: two disjoint closed disks do not enclose any bounded complementary component. Since is holomorphic on the open neighbourhood of , the polynomial Runge theorem gives, for each , a polynomial such that
Hence
Define a function on the disconnected open set by
It is holomorphic on . Applying the first part produces polynomials with
For an obstruction, take
These are disjoint nonempty bounded closed sets. If polynomials converged uniformly to zero on , the maximum modulus principle on a bounded domain would give
They therefore cannot also satisfy . Thus this pair has the requested non-approximation property.

There are unlisted articles, also show them or only show them.