Normalize the nonvanishing loop to . A continuous argument lift is a continuous function such that . Such a lift exists on an interval; any two differ by a constant integer multiple of . The winding number is
Its value is independent of the lift. This definition applies to continuous loops without assuming a differentiable contour.
The homotopy invariance of winding number states: if is continuous and for every , then is independent of . Neither the loops nor their moving basepoints may pass through zero. One may justify invariance by uniformly subdividing the homotopy into nearby loops whose normalized values have a continuous argument difference of magnitude less than ; that argument difference has equal endpoint values, so their winding numbers agree.
If , then . Expand at :
Substitution into the previous quotient gives
Thus the stationary mean is
Only a finite first service moment was stated. If the second moment is infinite and , the stationary mean is infinite; the formula has that extended-value interpretation. This follows as well by writing the second-order remainder as an integral of and taking , where monotone convergence gives . A finite stationary distribution need not have a finite mean.
The service-period arrival count has probability generating function
with and . Let . In stationarity the recurrence and independence give
initially for . Rearrangement gives . Letting and using shows . Hence
Analytic continuation gives the identity inside the unit disc; boundary values follow by convergence of the probability series, with removable limiting values wherever the displayed quotient is indeterminate, particularly at .
Put
The transition probabilities are
The first and second rows coincide because either an arrival to an empty queue or the single existing customer initiates the next service.
Let be the number of arrivals during the next customer's service. If , that service begins immediately and one of the waiting customers is served; if , the next arrival initiates the service, and it is not counted among arrivals during its own service. Thus
Conditional on a fresh service time , is Poisson with mean . Independence of service times and the independent-increment/strong Markov property of the Poisson arrival process make these mixed counts identically distributed and independent of the previous departure history. Hence the conditional law of depends only on , proving the Markov property of the departure-embedded queue.
Now almost everywhere. The functions converge almost everywhere to and are dominated by the integrable . The dominated convergence theorem gives . Using and the assumed convergence of the nonnegative integrals yields
This is the nonnegative form of Scheffé's lemma: almost-everywhere convergence together with convergence of total mass implies convergence in the L1 norm.
Write , , and . Almost-everywhere convergence gives , so Fatou's lemma gives and . The given norm condition is . Consequently
and the symmetric argument bounds . Combining upper and lower limits proves
No common integrable dominating function for has been assumed.
Fatou's lemma states that for nonnegative measurable ,
Indeed is measurable, increases to , and satisfies for every . The monotone convergence theorem gives , proving the claim, including infinite values.
The dominated convergence theorem states that if measurable almost everywhere and almost everywhere for one integrable nonnegative , then is integrable and ; in fact . Integrability follows from . For real functions, Fatou applied to gives , and applied to gives the reverse inequality against the upper limit. Thus the integrals converge. To obtain the stronger conclusion, Fatou applied to gives , forcing the latter limit to be zero. Complex functions may be treated through their real and imaginary parts or the same absolute-difference argument.
Since , the ring of integers is . A unit has norm . Norm minus one is impossible: it would give , whereas the squares modulo seven are . The element has norm one and exceeds one.
Suppose a positive unit in the chosen real embedding satisfies . Its conjugate is , so
This expression is strictly increasing in , and at it equals three. Thus the integer is one or two. But then is eight or twenty-nine, neither a square. Therefore there is no positive unit strictly between one and .
For any positive unit , choose an integer such that . The remaining unit must be one, so . Multiplication by minus one handles negative units. Hence
which proves that is fundamental, using no continued fractions.
The Dirichlet unit theorem states that for a number field with real embeddings and conjugate pairs of nonreal embeddings,
where is its finite cyclic group of roots of unity. Equivalently there exist multiplicatively independent fundamental units such that every unit is a unique product of a root of unity and integer powers of those units.
Embed the ring of integers into by its two real embeddings. Its image is a full Euclidean lattice of some covolume . Fix and consider the symmetric rectangle , . Its area is , so the Minkowski convex body theorem gives a nonzero algebraic integer in it. Its algebraic norm is a nonzero integer with .
As , infinitely many distinct must occur: a finite collection of nonzero elements has a positive minimum of , whereas here that coordinate tends to zero. The principal ideals have norm . There are only finitely many ideals of bounded norm: they are subgroups of bounded index in a rank-two free abelian group, and integer Hermite normal forms give finitely many possibilities at each such index. Thus infinitely many of these elements generate one ideal. Ratios of two generators of the same ideal are units, because inclusion in both directions supplies inverse algebraic integers. Among infinitely many distinct generators choose two whose ratio is not . This gives a non-trivial unit without assuming Dirichlet's theorem.
For any positive integer , put . Each of is composite, since is divisible by and larger than . Let be the largest prime number at most , and let be the smallest prime number at least . Such exists by part (i), and no prime lies strictly between and . Therefore these are consecutive prime numbers with
Since is arbitrary, gaps between consecutive prime numbers are unbounded.
Suppose the prime numbers were the finite list . The integer has a prime factor, by repeatedly factoring any composite factor until a prime is reached. But division by any leaves remainder one, so that prime factor is absent from the list. This contradiction proves there are infinitely many prime numbers. The argument does not require itself to be prime.
The invariant positive-definite bilinear form makes every orthogonal in an orthonormal real basis. Every element of has the form with , so this group is homeomorphic to and connected. The continuous function takes values in and equals one at the identity. It is therefore identically one. Hence .
The pairing is real and symmetric: , and cyclicity of the trace exchanges . For the coordinates in part (i), , so
Thus it is a positive-definite real bilinear form, hence nondegenerate. Finally
proving invariance under conjugation.
A traceless skew-Hermitian matrix has the unique form
This real-linear parametrization is bijective, proving as real vector spaces. It is not a complex vector space: multiplication by generally turns a skew-Hermitian matrix into a Hermitian one.
Over , take
Its roots are . For , its inverse is , so both square roots belong to . Since has degree four, is irreducible and this field is its splitting field. Independently changing the signs of the two square roots gives its Galois group , which is abelian and satisfies the hypothesis.
Factorization over gives the orbits of the Galois group on the three resolvent roots. If splits completely, the quotient is trivial and . If is a linear factor times an irreducible quadratic, the quotient is and .
If is irreducible, the quotient acts transitively on three roots, so it is or . The product of their pairwise differences is a square root of the nonzero discriminant and changes by the sign of the permutation. Thus is a square in exactly when the quotient contains only even permutations. The criterion is
The assumed containment of is essential to reconstruct from the quotient by this table.
The three resolvent cubic roots correspond to the partitions , , . Permuting the four roots of the quartic permutes these three quantities and defines a homomorphism . They are distinct: because the quartic has zero cubic coefficient, their differences include
since characteristic zero and irreducibility imply separability. Thus the kernel of the action is exactly . The splitting field of the resolvent is the subfield generated by its roots; restriction from the quartic splitting field is surjective onto its Galois group, since automorphisms of a normal separable intermediate extension extend to the splitting field. Hence
In the four cases these groups are respectively the trivial group, , and . Computing the symmetric functions also gives with the source's root convention.
The Klein four-group is normal in , and through the action on the three partitions into pairs. A subgroup containing is the full preimage of its image in this quotient. Up to conjugacy the subgroups of have orders . Their preimages give the complete list
with respective orders , where denotes the dihedral group of order eight. The order-eight preimage is a Sylow two-subgroup of , generated for example by a four-cycle and a reflection reversing it.

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