For a finite Galois extension of number fields, choose a nonzero residue field generator at and lift it to an integral element whose residues at the other primes above are zero, using the Chinese remainder theorem. The orbit polynomial has coefficients in the base ring of integers. Modulo , its nonzero roots are precisely the orbit of under the decomposition group. Its coefficients belong to , so finite-field Frobenius automorphism permutes these roots. Consequently some decomposition-group element acts as Frobenius on the generator, and therefore on the entire residue field. Frobenius generates the finite-field Galois group, proving surjectivity.
Two generators for an ideal in a Dedekind domain Created 2026-10-05 Updated 2026-10-25
Every ideal of a Dedekind domain is generated by at most two elements. Given a nonzero ideal and any prescribed nonzero , the Chinese remainder theorem supplies with at every prime ideal dividing . The prime-ideal valuation in a Dedekind domain then gives .
Two-sample exact period recovery Created 2026-10-07 Updated 2026-11-05
Suppose a function has least period and distinct values on distinct period cosets. Two independent Fourier samples have the form with uniform . The displayed candidate is , so exact recovery occurs when no prime divisor of divides both residues. The Chinese remainder theorem gives probability , using the Euler product. Unlike a single-sample coprimality probability, this bound is uniformly greater than one half. A candidate-period test makes successful recovery heralded when such a test is available.
Wheel factorization 2026-10-20
Choose a modulus that is a product of small primes. Every prime not dividing must be coprime to , so a search can restrict candidates to the corresponding residue classes modulo . For several linear polynomials, discard each residue class in which any required value is divisible by a selected prime. The surviving residue classes can be combined using the Chinese remainder theorem.