Semisimple linear operator Created 2026-10-14 Updated 2026-10-25
A linear operator is semisimple if it becomes diagonalizable over an algebraic closure; equivalently, its minimal polynomial has no repeated root over that closure. If an invertible operator has finite order prime to the characteristic of a field, its minimal polynomial divides . The derivative is coprime to this polynomial, so is semisimple. Its invariant irreducible summands over a finite field become multiplication by scalars in suitable finite field extensions.
Separability criterion using a pth power 2026-10-25
For an algebraic element over a field of characteristic , suppose first that is a separable algebraic element. Its minimal polynomial over divides its original separable polynomial and also . It is therefore separable with only one distinct root, so has degree one and . Conversely, if the irreducible minimal polynomial is inseparable, its formal derivative vanishes and for some of degree . Thus , proving the converse.
Separable algebraic element Created 2026-09-24 Updated 2026-10-14
An algebraic element over is separable when its minimal polynomial over has no repeated root in a splitting field. For an irreducible polynomial , this is equivalent to , because then .
The identity gives . If is diagonalizable, its minimal polynomial has simple roots. Hence all nonzero Jordan blocks of have size one and its zero blocks have size at most two. Squaring kills these nilpotent blocks, making both squared products diagonalizable. Their eigenvalue multisets agree by Characteristic polynomials of AB and BA, so the squared products are similar matrices.
Simple field extension 2026-10-31
A simple field extension is a field extension generated by one element: is the smallest subfield of an ambient field containing and . Its elements are rational expressions in with coefficients in and nonzero denominators. If is algebraic, its minimal polynomial identifies , so . The classes of give a basis when .
In particular, but implies . Conversely, in characteristic different from two, any degree-two extension is of this form: for , express in the basis , then has and generates the same extension. The restriction on the characteristic makes division by two possible.
For a linear operator on a finite-dimensional vector space over a field , all polynomial kernels stabilize at their first power exactly when its minimal polynomial has no repeated irreducible polynomial factor in . This formulation does not require those factors to be linear.
To prove it, the Bézout's identity for polynomials gives : a greatest common divisor is a combination of and , while is its multiple. If is square-free, , proving the displayed equality. Conversely, if an irreducible factor occurs to exponent , its primary decomposition theorem summand has minimal polynomial . On this summand is nonzero, while . Thus the kernels of those two powers differ. An eigenbasis follows from this criterion precisely when the distinct factors of are also linear over ; a real rotation through a right angle has square-free but no real eigenvalues.
For an algebraic integer generating a number field, the polynomial discriminant of its minimal polynomial equals the discriminant of elements of a number field for its power basis. A squarefree reduction modulo has nonzero resultant with its derivative, so . The discriminant-index formula for an integral lattice, , proves the assertion.
// Target: arithmetic.bigb
Trace-generated maximal-period linear-feedback sequence Created 2026-09-24 Updated 2026-09-24
Let , let generate , and let be nonzero linear with nondegenerate bilinear form . If the minimal polynomial of is , then satisfiesso it is produced by an LFSR of length at most . Its period is exactly : any period would imply for every , hence by nondegeneracy.