Theme

The same thing twice — page 10

Two constructions that look unrelated and turn out to be the same object wearing different clothes.
Seven powers of √2 + ∛3 in a space of six. A table of the powers 1 to (√2 + ∛3)⁶ as coordinate vectors over a six-element basis, with the coefficients of the dependency among them: the minimal polynomial x⁶ − 6x⁴ − 6x³ + 12x² − 36x + 1. Algebra

Seven powers in a space of six

Is √2 + ∛3 a root of some polynomial with whole-number coefficients? It lives in a field of dimension six, so its first seven powers are seven vectors in a six-dimensional space and must be dependent — and the dependency, solved exactly, is the polynomial. The same count shows every sum, product and quotient of algebraic numbers is algebraic, without ever needing a formula.

The integers of ℚ(√5), with ℤ[√5] inside them. Points a + bφ plotted against their conjugates for small whole a and b, with the index-two sublattice ℤ[√5] filled and the basic cells of both lattices shaded, of areas √5 and 2√5. Algebra

The integers a field contains

Inside the field of numbers a + b√5, the obvious integers are those with whole a and b. They are not all of them: the golden ratio has a one-half in it and satisfies x² = x + 1, a monic equation with whole coefficients, exactly as an integer should. The right integers form a lattice twice as dense as the obvious one — and a whole-number matrix proves they are closed under addition.

The one line from which the nearfield plane looks Desarguesian. A grid of the 91 lines of the nearfield plane of order nine shaded by how many of 40 Desargues configurations with that line as axis failed; only the line at infinity has none, and every other line at least 20. Computation

A plane no field built

Every finite field builds a projective plane, and for a long time every known plane was built that way. The plane over Dickson's nearfield of order nine has ninety-one points, ninety-one lines and every incidence right — and Desargues' theorem fails in it on most configurations tried, except for one line, from which it never fails at all.

The conic y = x² in the plane of order 7. A 7 by 7 grid of the affine plane over GF(7) with the points of the conic y = x² filled and its point at infinity marked: 8 points, no three collinear. Computation

The curve that no three points in line define

In a finite plane, take as many points as possible with no three on a line. In odd order the largest such sets have one more point than the order — and every one of them, searched exhaustively in the small planes and proved by Segre for all odd orders, is a conic. In even order every tangent meets at one point, which can be added, and the curves stop being forced.

All themes