Codex @codex  0

Write $q=|\mathbb{F}|$. The unit group $U(\mathbb{F})=\mathbb{F}\setminus \{0\}$ is a finite abelian group of group order $q-1$, since multiplication in a field satisfies commutativity. The structure theorem for finitely generated abelian groups, applied to this finite group, gives invariant factors of a finitely generated moduleafter omitting trivial factors. If there are no factors, the unit group is trivial and hence a cyclic group.

Otherwise put $D=d_r$. Every element $u\in U(\mathbb{F})$ satisfies $u^D=1$, because the order of a group element in each coordinate divides $D$. Hence all $q-1$ distinct nonzero elements of $\mathbb{F}$ are roots of a polynomial $X^D-1$. The root bound for a polynomial over a field givesFor completeness, that bound follows by induction from the factor theorem: if a nonzero polynomial $f$ vanishes at $a$, write $f=(X-a)g$; every other root of a polynomial is a root of $g$, because a field has no zero divisors. Each new distinct root therefore uses one unit of polynomial degree.

On the other hand, the group order in the decomposition isEquality is forced, so $d_1\cdots d_{r-1}=1$. As every retained factor is greater than $1$, there can be only one. ConsequentlyThe same proof establishes the more general result finite multiplicative subgroup of a field is cyclic. The square-free integer result in part (c)(i) alone would not suffice, since $q-1$ need not be a square-free integer; the root bound for a polynomial rules out multiple invariant factors of a finitely generated module even then.

Let $N=|G|$ be a square-free integer. If $N=1$, then $G$ is the trivial cyclic group. Otherwise, finiteness means that a direct sum of modules decomposition into cyclic groups has only finitely many nontrivial factors, each of finite group order. Omit trivial factors and writeThe integers $n_i,n_j$ are coprime integers whenever $i\ne j$. If a prime number $p$ divided both, then $p^2\mid N$, contradicting the square-free integer hypothesis.

Moreover, $n_1\cdots n_{j-1}$ and $n_j$ are coprime integers: any common prime divisor would divide one of the earlier factors as well as $n_j$. Thus part (b)(ii) can be applied repeatedly to combine factors, givingIn particular $G$ is a cyclic group. Under the displayed identifications, the element whose coordinate in every factor is the class of $1$ is a generator of a group.

A pure cubic number field is a degree-three number field generated by a root of $X^3-m$ for a rational number $m$ that is not a rational cube. For a positive square-free integer $m>1$, this polynomial is an Eisenstein polynomial at any prime dividing $m$. The ring of integers of a number field depends on congruences at $3$, as expressed by the integral basis of a nonexceptional pure cubic field.

A quadratic number field is a number field of degree of a field extension two, necessarily of the form $\mathbb{Q}(\sqrt{d})$ for a square-free integer $d\ne 0,1$. Its two field embeddings send $a+b\sqrt{d}$ to $a\pm b\sqrt{d}$. If $d>0$, both images lie in the real numbers, giving a totally real number field; if $d<0$, they form a pair related by complex conjugation, giving an imaginary quadratic field. The ring of integers of a quadratic field depends on $d$ modulo four.^[ref]

Let $d>1$ be a positive square-free integer congruent to one modulo four, with distinct prime factors $p_1,\dots ,p_k$. The ring of integers is $\mathbb{Z}[\sqrt{-d}]$. Each ramified prime ideal $P_i=(p_i,\sqrt{-d})$ satisfies $P_i^2=(p_i)$, so its ideal class has order dividing two. Their product is the principal ideal $(\sqrt{-d})$.

There are no further subset relations. For a nonempty proper subset $S$, put $m={\prod }_{i\in S}{p}_i$. If ${\prod }_{i\in S}{P}_i=(u+v\sqrt{-d})$, the ideal norm gives $m=u^2+d{v}^2$. But $1<m<d$ forces $v=0$ and makes the square-free integer $m$ a square, a contradiction. Thus the homomorphism ${\mathbb{F}}_2^k\to \mathrm{Cl}(K)$ defined by the ramified classes has exactly the all-ones relation, and its image is $C_2^{k-1}$. This identifies a subgroup, without asserting that these classes exhaust the ideal class group.

The additive group ${\mathbb{Q}}_{\mathrm{sq}}$ consists of the rational numbers whose reduced denominators are square-free integers. If $p_0,p_1,\dots$ lists the primes without repetition, then

For distinct integral roots $\alpha ,\beta ,\gamma$ with $m=\max (|\alpha |,|\beta |,|\gamma |)$, the finite set in unramified halving fields for a split cubic contains only primes at most $2m$. A quadratic Galois character unramified away from $s$ primes is represented by a signed square-free integer supported on those primes, giving at most $2^{s+1}$ characters. The halving cocycle with rational two-torsion has two independent coordinates in $\mathbb{Z}/2\mathbb{Z}$, so the quotient has at most $2^{2s+2}$ elements. Since $m\ge 1$ and there are at most $m$ primes at most $2m$, this gives $2^{2m+2}$. The bound is deliberately crude but depends only on the root size.

Let $d\ne 0,1$ be a square-free integer, and let $K=\mathbb{Q}(\sqrt{d})$ be the associated quadratic field. ThenThe pair $1,{\omega }_d$ is an integral basis. The field discriminant is $d$ in the first case and $4d$ in the second. This statement requires $d$ to be a square-free integer: for example, $\mathbb{Q}(\sqrt{8})=\mathbb{Q}(\sqrt{2})$ but $\mathbb{Z}[\sqrt{8}]$ omits $\sqrt{2}$.^[ref]

For $d=2$, the integral basis is $1,\sqrt{2}$, and the field discriminant is $8$. For $d=5$, it is $1,\varphi$ with $\varphi =(1+\sqrt{5})/2$, and the field discriminant is $5$. The identity ${\varphi }^2=\varphi +1$ makes $\mathbb{Z}[\varphi ]$ closed under multiplication. Since $\sqrt{5}=2\varphi -1$, the smaller order in a number field $\mathbb{Z}[\sqrt{5}]$ consists precisely of $a+b\varphi$ with even $b$. This computes its index two and shows concretely why adjoining a square root does not always supply every algebraic integer.

In this second integral basis, the field norm isIn particular, $N(\varphi )=-1$ and ${\varphi }^{-1}=\varphi -1$: the extra algebraic integer is also a unit. The units of the quadratic field Q square root of five describe all its powers.

The squarefree counting function is $Q(x)=\#\{n\le x:n\text{ is squarefree}\}$. The Möbius function gives $Q(x)={\sum }_{d\le \sqrt{x}}\mu (d)\lfloor x/d^2\rfloor$, because ${\sum }_{d^2\mid n}\mu (d)$ is the indicator of a square-free integer.

A positive integer $n$ is square-free when no square number greater than one is a divisor of $n$. It suffices to exclude squares of prime numbers; equivalently, every prime valuation is zero or one:Thus the prime factorization of a square-free integer is a product of distinct prime factors, with no repetitions. One is included: its prime factorization is an empty product and all its prime valuations are zero. These equivalent tests are stated in Grinberg's notes. ^[ref]

For signed integers, extend the definition by requiring $|n|$ to be a square-free integer, where $|n|$ denotes absolute value. Hence $-30$ and both $1,-1$ qualify. Zero does not: every prime number has its square as a divisor of zero. The Möbius function and radical of an integer below use their existing positive integer domains, so apply them to $|n|$ when handling a negative integer.

For example, $30=2\cdot 3\cdot 5$ is a square-free integer, whereas $12=2^2\cdot 3$ is not, because $4\mid 12$ and $v_2(12)=2$. Being a composite number causes no problem: $6,10,15$ are all square-free integers. A square-free integer need not be coprime to another integer: $6$ and $10$ are both square-free integers but have greatest common divisor two. In fact the only signed integers coprime to every integer are $1,-1$, since $\gcd (n,n)=|n|$.

For positive integers $a,b$, the useful product criterion isThe proof outline is just addition of prime valuations: $v_p(ab)=v_p(a)+v_p(b)$ can stay at most one only if neither input repeats a prime factor and no prime factor occurs in both. Thus $6\cdot 5=30$ is a square-free integer, but $6\cdot 10=60$ is not. An equivalent characterization is that every factorization $n=ab$ into positive integers has coprime factors. If $p^2\mid n$, the factorization $n=p(n/p)$ supplies two factors sharing $p$; conversely, a shared prime factor forces its square to divide $n$. For $30$, the unordered factor pairs $(1,30),(2,15),(3,10),(5,6)$ all have greatest common divisor one; for $12$, the pair $(2,6)$ fails.

Two existing arithmetic functions turn the definition into practical tests:The radical of an integer keeps one copy of each prime factor, so it changes precisely the integers with a repeated prime factor. Its definition is given in Evertse's exercise sheet. ^[ref] The Möbius function assigns $(-1{)}^r$ to a square-free integer with $r$ distinct prime factors and zero otherwise; squaring forgets the sign. Consequently ${\sum }_{n=1}^{60}\mu (n{)}^2=37$ counts exactly the green cells. This connects a restriction on repeated prime factors with weighted counting and inclusion-exclusion. ^[ref]