Fix . Since is open, choose an open ball . For any in this ball the segment remains in it. For each coordinate , the chain rule givesThe ordinary mean value theorem therefore gives for every coordinate, hence . Thus is a locally constant function.
For each , its preimage is a union of such open balls, so is open in . Its complement in is the union of the other fibers and is also open. If is nonempty and connected, the nonempty fiber through any chosen point is both open and closed in , and must be all of . ThereforeThe empty-domain case is vacuous. Notice that continuity of was never needed.
Conjugate by a projective transformation sending to and to . A matrix representing the conjugated transformation must have zero diagonal, since its first column represents and its second represents . Therefore it has the formIts square is , a nonzero scalar matrix, which induces the identity on the projective line. Conjugating back provesFor the requested explicit involution, takeMore generally works whenever .
Take . The unit modulo has order , becauseLet a generator of act on by . The action is well defined since its order divides . The semidirect producthas order . Its construction as a semidirect product ensures that retains order . Since , the groups generated by and do not commute, so is nonabelian.
Apply the Abelian group criterion for a product of two prime squares with the smaller and larger primes in their correct order. For , all such groups are Abelian exactly when . Of the primes , only qualifies. For , the criterion is , equivalently . Therefore the exact answer isEquivalently, among the stipulated primes , exclude and the residue classes modulo .
For completeness, the necessity in that criterion supplies actual counterexamples at every excluded prime. If and , the multiplicative group of a finite field is cyclic, so choose of order . Let a generator of act on the additive group of by multiplication by . This defines a nontrivial group action, hence a nonabelian semidirect product of order . Use for , and for with . Thus no excluded prime can be restored to the answer.
The Abelian group criterion for a product of two prime squares applies because and . Here its Sylow theorems proof is especially short:The candidates for are , of which only has the required remainder. The candidates for are , again leaving only . Thus both Sylow subgroups are normal subgroups. Their group commutators lie in , and , so . Both factors are abelian groups of prime-square order by (a).
The Fundamental theorem of finitely generated abelian groups gives preciselyThese four groups are pairwise nonisomorphic: their characteristic Sylow subgroups differ in whether they contain an element of order or . The first is also the cyclic group .
Write with . The Sylow theorems give and . Since , necessarily . Its unique Sylow subgroup is a normal subgroup and has prime order , soA Sylow subgroup has trivial intersection with , and , so . ThusThe semidirect product action is a group homomorphism . If the action is trivial, by the Chinese remainder theorem; if it is nontrivial, . In particular has both a cyclic normal subgroup and a cyclic quotient, making it a metacyclic group and hence a solvable group.
Let . The allowed center of a group theorem gives . By Lagrange's theorem its order is or . In the first case has order and is a cyclic group. A cyclic quotient by the center forces to be Abelian: if , write arbitrary elements as with , and commute them directly. Hence in every caseFor two examples at prime-cube order, take the dihedral group of a square, , and the quaternion group . Both have order . They are nonabelian because and , respectively. They are distinct examples even up to group isomorphism: the dihedral group has five elements of order two and the quaternion group has only one. The request asks for two examples; it does not require the prime to be arbitrary.
Complete the square to obtain the equivalent quadratic congruenceHere : the Euclidean algorithm has successive nonzero remainders . If this modular congruence had a solution, the Jacobi symbol would be , since a square coprime to an odd modulus has Legendre symbol at every prime factor. Calculate instead, using Jacobi reciprocity and reduction of numerators,Therefore there is no solution. This obstruction does not require a separate primality test for ; the Jacobi symbol suffices.
Write , , counting repetitions. Since are coprime, every pair consists of distinct odd prime numbers. Quadratic reciprocity for the Legendre symbol givesMultiplying over all and using multiplicativity of the Jacobi symbol yields the sign exponentby the odd-product parity identity proved in (b)(i). Thus the Jacobi reciprocity law isIf either integer is , its factorization is empty and both sides equal .
There are unlisted articles, also show them or only show them.