The quadratic form factors as a sum of two squares:
The change of variables
has determinant , so its matrix is a unimodular matrix and it maps bijectively to itself. The original equation is therefore equivalent to
The sum of two squares theorem also decides this systematically: , and every prime factor congruent to modulo occurs to an even power, vacuously here. Thus is a sum of two integer squares. Explicitly,
Inverting the change of variables gives, for example, . Consequently
This is the unimodular reduction of a discriminant-minus-four form to two squares.
Applying the Euclidean algorithm,
Hence . Since does not divide , the linear Diophantine equation solvability criterion gives
The linear Diophantine equation solvability criterion says that has an integer solution exactly when divides . The Euclidean algorithm gives
Thus , which divides . Therefore
Put . The roots of are , so its splitting field is
The polynomial is irreducible over by the Eisenstein criterion at , and does not contain . The tower law for field extensions therefore gives .
Define automorphisms
They satisfy and . The eight maps and are distinct, so they exhaust the Galois group. Hence
the dihedral group of order eight.
The Galois correspondence gives all intermediate fields. The full list, with a single generator for each field, is
For example, has stabilizer , and has stabilizer ; the other entries follow similarly. Also has trivial stabilizer, so its orbit has eight elements and the primitive element theorem conclusion holds explicitly.
Finally, the normal subextension criterion says that normal intermediate fields correspond exactly to normal subgroups. In these are , , the two index-two Klein four-groups, , and , which gives exactly the “yes” rows above. This is the subfields of the splitting field of x to the fourth minus seven lattice.
A finite extension is normal when every irreducible polynomial in having one root in splits completely over .
Suppose first that is normal. Choose with , and let be the minimal polynomial of over . Every splits in by normality, and is generated by their roots because it is already generated by the particular roots . Thus is the splitting field of .
Conversely, suppose that is the splitting field of . Every -embedding permutes the roots of , so . By the embedding characterization of normality, is normal. This proves the finite normal extension as a splitting field criterion.
Fix and sample from the Erdős-Rényi model with . Let count copies of the complete bipartite graph . By the expected subgraph count in the Erdős-Rényi model,
Put and let count independent set of size . If the chromatic number satisfies , some colour class has at least vertices, so . Moreover,
because the positive part of the exponent is whereas has order . The first moment method therefore gives .
Using Markov inequality for and the union bound,
for all sufficiently large . Hence at least one such contains no and has .
The compactness theorem says that a set of first-order sentences has a model if and only if every finite subset of has a model. One direction is immediate: a model of models every subset. Conversely, suppose every finite subset is satisfiable. If had no model, then . The Godel completeness theorem would give a formal proof . Every proof is finite, so it would use only a finite subset , making inconsistent and hence unsatisfiable. This contradiction proves compactness.
The Upward Lowenheim-Skolem theorem says that a first-order theory with an infinite model has models of arbitrarily large cardinality. Fix a cardinal and expand the language by constants for . Add the sentences
to . Any finite subset mentions only finitely many new constants, which can be interpreted as distinct elements of the given infinite model. Compactness therefore gives a model of the expanded theory in which the are all distinct. Its reduct is a model of of cardinality at least . Together with the downward theorem, this gives a model of exactly whenever .
The Downward Lowenheim-Skolem theorem says that if is an infinite -structure and
then has an elementary substructure of cardinality . To see why, first choose elements. For every existential formula, add a Skolem function selecting a witness whenever one exists, and repeatedly close the chosen set under all language operations and these witness functions. There are at most functions of finite arity, so the closure still has size . Every existential statement true in with parameters from the closure has a witness in the closure; the Tarski--Vaught test therefore says that the resulting substructure is elementary.
For ,
The branch expanding from has
until it approaches . With ,
Solving this linear equation gives the critical closed radiation--cosmological-constant solution
For ,
For ,
so
exponentially from below.
Put . Apart from the positive factor ,
For , its discriminant is positive and its two roots are
Both are positive. Moreover and , so
A universe expanding from follows the allowed region and reaches with . There,
so crosses from positive to negative: expansion reverses into contraction.
As on the contracting branch,
Hence , so zero scale factor is reached in finite time. The universe therefore undergoes the supercritical closed radiation--cosmological-constant recollapse to a Big Crunch.
Separate continuity gives
using the scalings for radiation in cosmology and cosmological constant energy. At , where , the Friedmann equation becomes
so
At general ,
which rearranges to
Part (a), applied to and , gives
Subtracting the displayed formula for yields
These relations define the closed radiation--cosmological-constant turning polynomial.
Write and . Differentiating the Friedmann equation gives
The cosmological perfect-fluid continuity equation says , so, first where and then everywhere by continuity,
Using from the original equation gives
Since for the Hubble parameter, this is the Friedmann acceleration equation.
Write with . Then
Take to be a small positively oriented circle around . For , start at , travel to , and avoid the pole at zero by a fixed upper or lower detour. The endpoint factor vanishes at , and the exponential controls .
The finite contour extracts the residue at zero:
Only powers occur, and the coefficient of is nonzero. Thus this solution is a polynomial of degree and, up to normalization, is the Laguerre polynomial :
This also follows from the recurrence in part (i), because and every later coefficient vanishes.
Write with . The amplitude is now the rational function
Choose to be a small positively oriented circle around the pole , and choose from along the negative real axis to . At zero the endpoint factor behaves as and vanishes; at negative infinity the exponential decays.
By the residue theorem, the finite-contour solution is
Every derivative term contains times a power of of degree at most , and the highest-degree term is nonzero. Hence
up to a constant, where is a polynomial of degree . This is the negative-integer case of the Integer-parameter Laguerre contour residues.

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