Constructibility Ideas in Abstract Algebra

Imagine trying to draw perfect geometric shapes with only a straightedge and an unmarked compass ✏️📐. You can start with a line segment of length $1$, and from that, build many other lengths using only circles and lines. But not every length is possible. One famous question is whether you can construct a cube with twice the volume of a given cube, which turns out to be impossible. Another is whether a regular $17$-gon can be drawn using only compass and straightedge, which is possible. These questions connect geometry to algebra in a deep way.

By the end of this lesson, students, you should be able to:

explain the main terms used in constructibility ideas,
use field extensions to reason about what lengths and angles can be constructed,
connect geometric constructions to algebraic structure,
summarize why constructibility belongs in the study of field extensions,
use examples to justify whether a number or angle is constructible.

The key idea is that every compass-and-straightedge construction produces numbers from earlier ones using only a small set of algebraic operations. That makes constructibility a powerful bridge between geometry and abstract algebra 🌉.

What It Means to Be Constructible

A real number is called constructible if it can be represented as the length of a line segment obtained from a starting unit segment using only a straightedge and compass. More generally, a point in the plane is constructible if its coordinates are constructible numbers.

In practice, the allowed operations come from geometry:

drawing a line through two known points,
drawing a circle with known center and radius,
finding intersections of lines and circles.

These geometric steps translate into algebraic operations. If you already know some constructible lengths, then the new lengths you can get are built using:

addition and subtraction,
multiplication and division by nonzero numbers,
square roots.

That last item is especially important. A square root appears when solving for the distance from a point to a line or finding the intersection of a line and circle. For example, the length $\sqrt{2}$ is constructible because it can be obtained from a right triangle with legs of length $1$ and $1$.

This creates a chain of fields. Start with $\mathbb{Q}$, the field of rational numbers, and enlarge it by adjoining constructible numbers. The algebraic structure of those enlargements is the key to understanding constructibility.

Field Extensions and Why They Matter

A field extension is a bigger field containing a smaller field. If $K$ is a field and $L$ is a larger field containing $K$, then $L$ is a field extension of $K$, written $L/K$.

For constructibility, the starting field is usually $\mathbb{Q}$. Since compass-and-straightedge constructions begin with a unit length, every length we build can be expressed relative to that unit. A constructible number does not appear all at once. It is created step by step through a sequence of field extensions.

The most important fact is this:

A real number is constructible only if it lies in a field extension of $\mathbb{Q}$ whose degree is a power of $2$.

That means the extension degree can be $2$, $4$, $8$, $16$, and so on, but not $3$, $6$, or $10$ unless those are part of a larger tower whose total degree is a power of $2$.

Why powers of $2$? Because each new geometric step can introduce at most one square root. Algebraically, adjoining a square root doubles the field degree at most. If a number is built through several such steps, the total degree is a product of $2$'s, so it must be a power of $2$.

For example, if $\alpha$ is constructible, then there is a tower of fields

\mathbb{Q} = K_$0 \subset$ K_$1 \subset$ K_$2 \subset$ $\cdots$ $\subset$ K_n

where each step satisfies $[K_{i+1} : K_i] = 2$, and $\alpha \in K_n$.

This tower viewpoint is one of the clearest ways to connect geometry to abstract algebra.

How to Prove a Number Is Constructible

To show that a number is constructible, you usually need to describe a geometric construction or show that it can be obtained from previously constructible numbers using field operations and square roots.

A few useful facts are:

$0$, $1$, and $-1$ are constructible.
If $a$ and $b$ are constructible, then $a+b$, $a-b$, $ab$, and $a/b$ for $b \neq 0$ are constructible.
If $a \ge 0$ is constructible, then $\sqrt{a}$ is constructible.

These rules let you build many numbers. For instance, from $1$ you can construct $2 = 1+1$, then $\frac{1}{2}$, then $\sqrt{2}$, then $\sqrt{1+\sqrt{2}}$, and so on.

A classic example is the number $\sqrt{3}$.

Since $3$ is constructible, and square roots of nonnegative constructible numbers are constructible, $\sqrt{3}$ is constructible.

Another example is $\cos 60^\circ = \frac{1}{2}$, which is obviously constructible. But constructibility becomes much more interesting for angles that lead to less obvious values, such as $\cos 20^\circ$ or $\cos 36^\circ$.

How to Prove a Number Is Not Constructible

Proving impossibility is where field extensions become especially powerful 🔍.

If a real number $\alpha$ is constructible, then its minimal polynomial over $\mathbb{Q}$ must have degree equal to a power of $2$, or at least divide a power of $2$. More precisely, the field $\mathbb{Q}(\alpha)$ must have degree $2^n$ over $\mathbb{Q}$ for some $n$.

So if you can show that $\alpha$ has minimal polynomial of degree $3$ or another number not compatible with a power of $2$ tower, then $\alpha$ is not constructible.

A famous example is $\sqrt[3]{2}$.

It satisfies the polynomial $x^3 - 2 = 0$, which is irreducible over $\mathbb{Q}$ by the Rational Root Theorem. Therefore, the degree of $\mathbb{Q}(\sqrt[3]{2})$ over $\mathbb{Q}$ is $3$. Since $3$ is not a power of $2$, $\sqrt[3]{2}$ is not constructible.

This same reasoning helps explain why the ancient problem of doubling the cube is impossible. Doubling the volume of a cube with side length $1$ would require constructing a cube with side length $\sqrt[3]{2}$, and that number is not constructible.

Angle Constructibility and Regular Polygons

Constructibility also applies to angles. An angle is constructible if its measure can be obtained using straightedge and compass from a given starting angle.

This matters because regular $n$-gons are constructible exactly when the angle

$\frac{2\pi}{n}$

is constructible, or equivalently when certain trigonometric values related to it are constructible.

One of the most famous results in this area is the Gauss-Wantzel theorem. It says that a regular $n$-gon is constructible if and only if

n = 2^k p_1 p_$2 \cdots$ p_m,

where the $p_i$ are distinct Fermat primes.

A Fermat prime has the form

$F_m = 2^{2^m} + 1.$

Known Fermat primes are $3$, $5$, $17$, $257$, and $65537$.

That is why a regular $17$-gon is constructible. It fits the theorem. But a regular $7$-gon is not constructible, because $7$ is not a product of distinct Fermat primes times a power of $2$.

This result is one of the best examples of how field extensions solve a geometric problem. The algebra tells us exactly when the geometric construction is possible.

A Deeper Look at the Algebra Behind the Geometry

Constructibility ideas fit naturally into the broader study of field extensions because every construction step behaves like solving a polynomial of degree at most $2$.

Suppose you already know two constructible points with coordinates in a field $K$. Intersections of lines and circles may require solving equations such as:

a linear equation,
a quadratic equation,
or a system that reduces to a quadratic.

Since quadratic equations involve square roots, each step extends the field by degree $1$ or $2$. That is why constructible numbers sit inside a tower of quadratic extensions.

This is also related to algebraic closure ideas. Not every algebraic number is constructible. For example, algebraic numbers of degree $3$ may exist, but unless their degree structure fits a power of $2$ tower, they are outside the constructible world.

So constructibility is not just about drawing shapes. It is about understanding which algebraic numbers can be generated by repeated quadratic extensions.

Real-World Style Example

Suppose students is designing a square garden with side length $1$ meter and wants to add a diagonal path from one corner to the opposite corner 🌿. The path length is the diagonal of the square.

By the Pythagorean theorem, the diagonal length is

$\sqrt{1^2 + 1^2} = \sqrt{2}.$

Because $\sqrt{2}$ is constructible, the diagonal path can be laid out exactly using compass and straightedge.

Now suppose the design calls for a cube whose volume is doubled. The new side length would have to be $\sqrt[3]{2}$. Since $\sqrt[3]{2}$ is not constructible, the exact construction cannot be done with only ruler and compass. This shows how constructibility distinguishes between what is possible in practical geometry and what is impossible under strict rules.

Conclusion

Constructibility ideas show how geometry, field theory, and polynomial algebra work together. A constructible number is one that can be obtained using only straightedge and compass, and algebra reveals that such numbers must come from a tower of field extensions whose degrees are powers of $2$.

This explains both positive results, like the constructibility of $\sqrt{2}$ and the regular $17$-gon, and negative results, like the impossibility of constructing $\sqrt[3]{2}$ or a regular $7$-gon. In abstract algebra, constructibility is a powerful example of how a geometric question becomes a statement about field extensions and polynomial degrees.

Study Notes

Constructible numbers are lengths obtainable from a unit segment using only straightedge and compass.
Allowed algebraic operations on constructible numbers include addition, subtraction, multiplication, division, and square roots.
A constructible number must lie in a tower of field extensions of $\mathbb{Q}$ with degrees that are powers of $2$.
If a number has minimal polynomial degree not compatible with a power of $2$ tower, it is not constructible.
$\sqrt{2}$ is constructible, but $\sqrt[3]{2}$ is not constructible.
The doubling-the-cube problem is impossible because it requires constructing $\sqrt[3]{2}$.
A regular $n$-gon is constructible exactly when $n$ has the form $2^k p_1 p_2 \cdots p_m$ with distinct Fermat primes $p_i$.
The regular $17$-gon is constructible because $17$ is a Fermat prime.
Constructibility ideas are a major application of field extensions in abstract algebra.