Maths Olympiad Prep

Library / /128 of 520

Algebra Difficulty 5.7 AIME, harder Prove it

21. Let α\alpha be an algebraic number. Define the set of polynomials
P(α)={f(x):f(x)Q[x],f(α)=0}.P(\alpha)=\{f(x): f(x) \in \mathbb{Q}[x], f(\alpha)=0\}.
(i) Prove: For non-zero polynomials in P(α)P(\alpha), the following three properties of h(x)h(x) are equivalent: (a) h(x)h(x) is the polynomial of lowest degree in P(α)P(\alpha); (b) f(x)P(α)f(x) \in P(\alpha) if and only if h(x)h(x) divides f(x)f(x) in Q[x]\mathbb{Q}[x]; (c) h(x)h(x) is an irreducible polynomial in Q[x]\mathbb{Q}[x] that belongs to P(α)P(\alpha).
(ii) Prove: There exists a unique polynomial g(x)=g(x;α)g(x)=g(x ; \alpha) in P(α)P(\alpha) with leading coefficient 1 that has the properties (a), (b), and (c) from (i). We call g(x)g(x) the minimal polynomial of the algebraic number α\alpha, and the degree of g(x)g(x) is called the degree of the algebraic number α\alpha.
(iii) Prove: α\alpha is a linear algebraic number if and only if αQ\alpha \in \mathbb{Q}; α\alpha is a linear algebraic integer if and only if αZ\alpha \in \mathbb{Z}.
(iv) Prove: α\alpha is an algebraic integer if and only if its minimal polynomial g(x;α)Z[x]g(x ; \alpha) \in \mathbb{Z}[x].
(v) An algebraic number α\alpha is called a unit if both α\alpha and α1\alpha^{-1} are algebraic integers. Prove: α\alpha is a unit if and only if its minimal polynomial g(x;α)Z[x]g(x ; \alpha) \in \mathbb{Z}[x], and its constant term is ±1\pm 1.

Solution

None

Translate the text above into English, please retain the original text's line breaks and format, and output the translation result directly.

Note: The provided instruction is a meta-instruction and not part of the text to be translated. Since the text to be translated is "None", the translation is also "None". Here is the formatted output as requested:

None

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.