TEST BANK: GALOIS
THEORY (PROTOCOL
v12.0)
PART 0: THE TABLE OF CONTENTS
● PART I: THE PREVIEW
○ The Intro
○ The "Critical Axioms" Cheat Sheet
● PART II: THE ELITE TEST BANK
○ Tier 1 (Questions 1–10) - Foundational Syntax & Application: Classical Algebra,
Polynomials, and Field Extensions
○ Tier 2 (Questions 11–20) - Complex Application & Simulation: The Galois
Correspondence, Solvability, and Abstract Fields
○ Tier 3 (Questions 21–30) - Grandmaster Synthesis: Transcendence, Differential
Galois Theory, and Advanced Modern Frameworks
PART I: THE PREVIEW
Mastering this test bank translates directly to elite mathematical performance by forging an
intuitive, structural grasp of field symmetries, polynomial invariants, and the deep
correspondences between algebraic extensions and group theory. You will transcend
mechanical calculation, developing the academic intuition required to solve complex theoretical
problems utilizing the rigorous frameworks established in classical and modern Galois Theory.
The "Critical Axioms" Cheat Sheet
● The Fundamental Theorem of Galois Theory: There exists a strict, inclusion-reversing
bijection between the intermediate fields of a finite Galois extension L/K and the
subgroups of its Galois group \text{Gal}(L/K).
Algebraic Structure (Fields) Group Theoretic Equivalent
Intermediate Field E (K \subseteq E \subseteq Subgroup H (H \le \text{Gal}(L/K))
L)
Degree [L:E] Order \vert{}H\vert{}
Degree [E:K] Index [\text{Gal}(L/K):H]
E/K is a Normal Extension H is a Normal Subgroup of \text{Gal}(L/K)
● The Tower Law: For field extensions L/E and E/K, the degrees are strictly multiplicative:
[L:K] = [L:E][E:K].
, ● Galois Equivalence: A finite field extension L/K is a Galois extension if and only if it is
both normal (it acts as a complete splitting field for some polynomial over K) and
separable (the minimal polynomial of every element in L possesses distinct roots).
● Solubility by Radicals: A polynomial equation is solvable by radicals if and only if its
Galois group is a solvable group (possessing a composition series with abelian factors).
The generic polynomial of degree n \ge 5 utilizes the symmetric group S_n, which is
definitively not solvable.
● Differential Analogue: In Picard-Vessiot theory, a linear differential equation is solvable
by quadratures if and only if its differential Galois group (a linear algebraic matrix group) is
a connected, solvable group.
PART II: THE ELITE TEST BANK
Q1: A researcher is modeling classical algebraic structures over the field of complex numbers
\mathbb{C}. They isolate a subset S within \mathbb{C} that is closed under addition, subtraction,
and multiplication, and contains the multiplicative identity 1. Based on the classical algebraic
definitions in Stewart's framework, which classification of this subset is the MOST ACCURATE?
A) The subset S constitutes a subfield of \mathbb{C} because it contains the multiplicative
identity and is closed under the primary binary operations. B) The subset S constitutes a subring
of \mathbb{C} because it satisfies the axioms for a commutative ring with unity, but lacks
guaranteed multiplicative inverses. C) The subset S acts as a principal ideal domain, as all
subrings of the complex plane inherently inherit Euclidean division properties. D) The subset S
is a transcendental extension of the rational numbers \mathbb{Q}, provided it contains elements
like \pi or e.
● Answer: B (The subset S constitutes a subring of \mathbb{C} because it satisfies the
axioms for a commutative ring with unity, but lacks guaranteed multiplicative inverses.)
● Distractor Analysis:
○ A is incorrect: A subfield strictly requires the subset to be closed under the division
of non-zero elements (existence of multiplicative inverses). The scenario provided
omits this critical requirement, making the subfield classification mathematically
invalid.
○ C is incorrect: While the subset is a subring, not all subrings of \mathbb{C} are
principal ideal domains. For instance, the subring \mathbb{Z}[\sqrt{-5}] is a subring
of \mathbb{C} but famously fails unique factorization, meaning it cannot be a
principal ideal domain.
○ D is incorrect: The subset S could simply be the ring of integers \mathbb{Z}, which
is a subring of \mathbb{C} but is neither a field nor an extension of \mathbb{Q}, let
alone a transcendental one.
The Mentor's Analysis: When classifying algebraic substructures, the immediate priority is
verifying the existence of multiplicative inverses. By utilizing the strict definition of a subring
versus a subfield, you bypass the common trap of assuming closure under basic arithmetic
implies field properties. Professional/Academic Intuition: A subring requires closure under
addition, subtraction, and multiplication. A subfield demands the additional, rigorous
condition of containing the multiplicative inverse for every non-zero element.
Q2: During a computational analysis of an encryption algorithm, an analyst encounters the
polynomial f(x) = x^7 - 14x^4 + 21x^2 - 35x + 14 over the rational numbers \mathbb{Q}. The
analyst needs to determine its factorization properties. Based on the factorization of
, polynomials, which conclusion is FIRST and unequivocally true? A) The polynomial is reducible
over \mathbb{Q} because its degree is odd, guaranteeing the existence of at least one real root.
B) The polynomial is reducible over \mathbb{Q} because the coefficients share a common
factor, thereby violating Gauss's Lemma. C) The polynomial is unequivocally irreducible over
\mathbb{Q} by applying Eisenstein's Criterion utilizing the prime p=7. D) The polynomial is
irreducible over \mathbb{Q} because evaluating it utilizing the Rational Root Theorem yields no
integer or fractional roots.
● Answer: C (The polynomial is unequivocally irreducible over \mathbb{Q} by applying
Eisenstein's Criterion utilizing the prime p=7.)
● Distractor Analysis:
○ A is incorrect: An odd-degree polynomial over \mathbb{Q} inherently has a real root
due to the Intermediate Value Theorem; however, a real root is not necessarily a
rational root. Irreducibility over \mathbb{Q} depends strictly on rational factorization,
not real intersections.
○ B is incorrect: Gauss's Lemma relates factorization in \mathbb{Z}[x] to factorization
in \mathbb{Q}[x]. The polynomial is monic (the leading coefficient is 1), meaning the
coefficients do not share a global common factor, rendering this distractor
fundamentally flawed.
○ D is incorrect: The Rational Root Theorem only identifies linear factors (degree 1).
A degree 7 polynomial could theoretically factor into a cubic and a quartic without
possessing any rational roots, making the theorem insufficient for proving complete
irreducibility.
The Mentor's Analysis: When facing a polynomial with integer coefficients over \mathbb{Q},
the immediate priority is checking for Eisenstein's Criterion. By utilizing the prime p=7 (which
divides all coefficients except the leading 1, and 7^2 = 49 does not divide the constant term 14),
you bypass the common trap of manually testing for roots. Professional/Academic Intuition: A
lack of linear factors only proves irreducibility for polynomials of degree 2 or 3. For
higher degrees, structural criteria like Eisenstein's must be applied to rule out non-linear
factorizations.
Q3: Let K be a field and L = K(\alpha) be a simple algebraic extension. Let m_\alpha(x)
represent the minimal polynomial of \alpha over K. If the degree of m_\alpha(x) is n, which
structural representation of the field L is the MOST ACCURATE? A) L operates as a vector
space over K of dimension n, possessing the precise basis \{1, \alpha, \alpha^2, \dots,
\alpha^n\}. B) L is algebraically isomorphic to the quotient ring K[x]/\langle m_\alpha(x) \rangle.
C) L functions as the unique splitting field of m_\alpha(x) over K. D) L contains all n distinct roots
of m_\alpha(x), ensuring it acts as a normal extension.
● Answer: B (L is algebraically isomorphic to the quotient ring K[x]/\langle m_\alpha(x)
\rangle.)
● Distractor Analysis:
○ A is incorrect: A vector space of dimension n requires a basis of exactly n elements.
The proposed set \{1, \alpha, \alpha^2, \dots, \alpha^n\} contains n+1 elements and
is linearly dependent. The correct canonical basis is \{1, \alpha, \alpha^2, \dots,
\alpha^{n-1}\}.
○ C is incorrect: The simple extension L = K(\alpha) contains at least one root of
m_\alpha(x), but it is not guaranteed to contain all roots unless the extension is
proven to be normal. For example, adjoining the real cube root of 2 to \mathbb{Q}
does not create a splitting field.
○ D is incorrect: This represents a classic novice misconception. A simple algebraic