Triangulate the sphere by the boundary complex of the cross-polytope with simplicial vertices : a face contains at most one simplicial vertex from each antipodal pair. Take its barycentric subdivision. Its simplicial vertices are the nonempty faces of the original complex, and its simplices are strictly nested chains .
Form a quotient complex whose simplicial vertices are pairs , and whose simplices are the images of these chains. No chain contains both and . Moreover a chain of face-orbits lifts uniquely up to simultaneous negation: after choosing a largest face, every smaller face has at most one representative contained in it, because an original face contains no antipodal simplicial vertices. Thus the quotient is an honest simplicial complex, without two different simplices with the same simplicial vertex set. Its realization is homeomorphic to the sphere modulo its antipodal action. This provides a triangulation of Real projective space . The subdivision avoids the duplicate-simplex problem of naively identifying simplicial vertices in the unsubdivided cross-polytope boundary.
Write . On define the orthogonal linear map
It satisfies and . Hence and . Restricting to the unit sphere gives
This continuous unit tangent field is available exactly because the ambient dimension is even.
Here with and field discriminant . The imaginary-quadratic Minkowski bound for ideal classes is , so each ideal class has an integral representative of ideal norm at most four. Representatives therefore use prime ideals above two and three. Put
The prime two ramifies, with , and three splits into . No element has field norm two, because ; thus is nontrivial of order two. Norm-four ideals represent and add no generator, so the class group is generated by .
The element has field norm 18. It belongs to and , but not , since reduction there gives . Its ideal therefore factors as
The exponents follow from the ideal norm 18, or from the root defining . Hence , so has order four and already generates all possible classes. Therefore
As a separate check, the reduced forms of discriminant of a binary quadratic form are , giving exactly four classes.
For a square-free integer or , the ring of integers of the quadratic field is . Square-freeness is the usual convention underlying the first request: congruence alone would not suffice, for example gives the same field as .
Now take the stipulated square-free and put , . For any integral , relative traces to the three quadratic subfields show . Those subfields all have integral bases and their square root, including . Write with integer coefficients.
Its relative field norm to is
Thus is even, and the constant numerator is divisible by four. Since , these conditions force both even: one odd makes the numerator odd, and both odd contradicts even. They then force to have the same integer parity. Every algebraic integer consequently belongs to the lattice generated by
Conversely the last generator satisfies and the monic integer equation
All four generators are integral and linearly independent over , so this lattice is exactly , proving this integral basis of an odd biquadratic field containing square root of two without an unproved index assumption.
In , interchange of the two factors commutes with SU2. On the highest-weight vector it acts by . Each irreducible summand in the Clebsch-Gordan decomposition has multiplicity one, so this sign is its scalar action on the entire summand. The symmetric square is the eigenspace and the exterior square the eigenspace. Therefore
For instance, and . The dimensions agree respectively with and .
The Clebsch-Gordan decomposition for SU2 states
Realize the tensor product as polynomials of bidegree in and . The determinant is invariant under the simultaneous SU2 action. For each , the vector
has torus weight and is killed by . Applying produces nonzero vectors of distinct weights, with . The relations and give , so their span is an irreducible copy of .
These irreducible submodules have distinct highest weights and form a direct sum: a sum of earlier ones cannot contain an irreducible module inequivalent to all its summands. Equivalently use complete reducibility, obtained by averaging an inner product over the compact group. Assuming , their total dimension is
which equals the dimension of the tensor product. Hence they exhaust it, proving the theorem.
Give the action , where is a row vector. Substitution preserves homogeneous degree, and composition agrees with matrix multiplication, so this is a complex representation of SU(2) group. The diagonal torus acts on with weight ; these weights are distinct.
A nonzero invariant subspace is invariant under the torus, so finite-dimensional Fourier projection onto its weight spaces supplies a nonzero monomial. Differentiating the group action and complexifying supplies the operators and . Their repeated application moves between every successive monomial, with nonzero coefficients until an endpoint is reached:
The invariant subspace therefore contains the whole monomial basis. Thus
For this is the one-dimensional trivial representation. Torus weight projections are legitimate because an invariant complex subspace is closed in finite dimension.
The cyclotomic polynomial is irreducible: replacing by gives an Eisenstein polynomial at seven. Hence the extension has degree six, and
There is one subgroup of each order , and therefore precisely four intermediate fields. The trivial subgroup fixes ; the whole group fixes . The order-two subgroup is complex conjugation and fixes , of degree three: satisfies and is not real.
The order-three subgroup fixes . Its other conjugate is . Expanding products and using gives and . Thus , and this fixed field is , of degree two. These generators have the required degrees and are fixed by the indicated subgroups, so the Galois correspondence proves they are the full fixed fields.
A cyclotomic field over is a field generated by an th root of unity of exact order . It contains all roots of , and is its splitting field. In characteristic zero this polynomial is separable, so the extension is Galois.
Every automorphism sends to with , and is determined by that image. Composition multiplies the exponents modulo , yielding an injective homomorphism into an abelian group. Thus the Galois group is abelian. Using irreducibility of the cyclotomic polynomial, every unit exponent occurs and
If “cyclotomic” is used more broadly for a subfield of such a field, it is still Galois and abelian, because every subgroup of an abelian Galois group is normal.
The Fundamental theorem of Galois theory applies to a finite Galois extension with group . It gives inclusion-reversing inverse bijections
The fixed field consists of elements fixed by every member of . Moreover and . An intermediate extension is Galois iff is normal, in which case restriction gives . All intermediate are themselves Galois. Finiteness and normality/separability of are essential for this stated form.
If a regular graph has connected components, the indicator vector of each component is a -eigenvector. They are linearly independent, and the Laplacian argument shows that every such eigenvector is constant on each component. Therefore its multiplicity is exactly , in particular greater than one.
For a -regular undirected graph, its graph Laplacian is , and for any complex vector ,
If , the left side is zero, hence on every edge. In a connected graph all coordinates coincide. Thus the eigenspace is exactly the constant vectors, of dimension one. Since the adjacency matrix of a graph is symmetric and diagonalizable,
If every vertex has degree , then each row of the adjacency matrix of a graph sums to . The nonzero constant vector therefore satisfies
so is an eigenvalue. This uses the usual finite, nonempty graph convention.
Let be the adjacency matrix of a graph and with . Choose a vertex maximizing . Then
Dividing gives
This argument works even with a complex eigenvector; for a finite undirected graph the matrix is real symmetric and all eigenvalues are real.
Under fit.2, observations in each period are independent Poisson random variables with a common mean, so each sample variance should fluctuate around its sample mean. The plot instead has variances roughly 130–300 for means roughly 80–120, well above the line variance equals mean. This is overdispersion.
Day-to-day traffic variation can produce a Poisson mixture: a random daily intensity increases the marginal variance and can correlate observations from the same day. A useful replacement is a negative binomial regression, with variance , or a Poisson generalized linear mixed model with a day random intercept. A day-factor effect can also be included if inference is restricted to the observed days. A Quasi-Poisson regression estimates a dispersion multiplier for uncertainty, but does not itself explain the shared-day dependence and has no ordinary likelihood-based AIC. The means can retain the period-factor or selected jump structure.
Use fit.3 if backward selection is intended to combine adjacent periods. Each cumulative indicator is a separate model term; deleting its coefficient enforces equality of the two adjacent period means separated by that boundary. This offers an interpretable reduced stepwise profile. Fit.2 treats the entire factor as one term, so ordinary term-wise backward selection retains all five contrasts or removes period altogether. Removing selected baseline contrasts by hand would instead privilege period one, rather than grouping neighbouring periods. If the scientific objective were simply whether any period effect exists, retaining or deleting the whole factor in fit.2 would be the appropriate different procedure.
The two design matrices span the same six-dimensional space of arbitrary log means for the six periods. Fit.2 uses the first period as a baseline, whereas fit.3 uses cumulative indicator steps. If is the log mean for period , fit.3 has intercept and jump coefficients . Thus both fits give identical fitted means and identical maximized likelihood functions. Therefore
Different coefficient tests arise because they test different contrasts, not because one full fit explains the observations better.
The Poisson deviance tests overall fit against the saturated Poisson regression, not whether the single slope is zero. Under fit.1, its large-count approximation is . The observed value is 261.72, far above the one-percent upper critical value (about 85.95); its upper-tail probability is about . Thus reject fit.1 at the one-percent level. The slope's reported -value 0.421 only compares this inadequate log-linear trend with an intercept-only model; it is not a goodness-of-fit test.
The appropriate homotopy invariance of winding number is: if is continuous and for each , then all loops have the same winding number. The basepoint may move; every intermediate curve must close and avoid zero.
Compactness gives . Uniform continuity gives such that implies for every . Part (d) then makes the winding numbers equal for nearby . Subdivide into steps smaller than and chain these equalities. Therefore
This proves the theorem directly for continuous loops, without requiring an integral formula or smooth homotopy.
The continuous closed curve satisfies . It lies in the right half-plane, which admits a single continuous complex argument in . Since closes, this argument has equal endpoint values, giving . Additivity under multiplication then yields
The strict inequality ensures that the quotient stays in a region avoiding zero and admitting a single argument branch.

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