For a finite unramified extension of non-Archimedean local fields, the field norm on residue units is surjective: on a cyclic group of order it is exponentiation by and has image of order . For a common uniformizer and , expansion of the conjugate product givesThe field trace of a finite finite field extension is onto: its polynomial is nonzero of degree below , so defines a nonzero linear map to the base field. Lift a residue norm and correct successively with elements of . The infinite product converges by completeness, and its norm is the prescribed unit. This argument also works in positive characteristic and when divides .
Tangent-line finite-field Kakeya construction Created 2026-10-14 Updated 2026-11-05
Work in the affine plane over a finite field of odd characteristic. The union of the affine lines , for , contains a line of every finite slope. Completing the square givesFor a fixed , the union therefore contains exactly the values of for which is a square, including zero. Adding the vertical affine line completes all directions. The resulting finite-field Kakeya set has cardinalityIts density tends to one half as grows through odd prime powers. Geometrically the finite-slope lines are the tangents to the parabola , because the tangent at has the displayed equation.
Unipotent conjugacy in SL2 over a finite field Created 2026-10-07 Updated 2026-11-05
For a finite field of odd characteristic and nonzero , let . An arbitrary determinant-one matrix satisfies only if and . The determinant condition then gives . Conversely . Thus nonzero upper unipotent matrices fall into two conjugacy classes under this square-class criterion. For example, and are conjugate over because , but not over . The criterion compares these particular upper unipotent representatives; it does not classify all determinant-one matrices.
Unit modulo n Created 2026-09-29 Updated 2026-10-14
For a positive integer modulus , a residue class is a unit when it has a modular multiplicative inverse: some integer satisfies . Modulo twelve, the units are exactlyIn particular, five is its own modular inverse, since . Multiplying all twelve residue classes by five gives a permutation; multiplying the outputs by five recovers the inputs. By contrast, multiplying by six gives only zero and six, with six inputs for each output. It cannot be reversed.
Multiplication by five permutes all twelve residue classes, whereas multiplication by six merges distinct inputs
. Details. In general, the exact criterion isFor the forward direction, implies every common divisor of divides one. Conversely, if their greatest common divisor is one, Bézout's identity supplies , so is a modular inverse. The extended Euclidean algorithm computes these coefficients. The units form the unit group under multiplication. [ref]
https://ocw.mit.edu/courses/18-200-principles-of-discrete-applied-mathematics-spring-2024/mit18_200_s24_lec15.pdf. Ankur Moitra, MIT 18.200, Lecture 15 (2024), pp. 3–4: inverses, coprimality and the unit group
Multiplicative cancellation while keeping the same integer modulus is valid for a unit modulo n: from , multiply by a modular inverse of to get . A nonunit cannot be cancelled as a general rule. For example, , yet . Thus division by six cannot undo this multiplication; solving a linear congruence instead keeps track of all possible classes.
This distinction marks the boundary between commutative rings and fields. Modulo a prime number , every nonzero residue class is a unit, so is a finite field. Modulo twelve it is a commutative ring with zero divisors, and is not a field. For , the sole class satisfies and is a unit; this one-element zero ring is not a field. [ref]
https://ocw.mit.edu/courses/18-200-principles-of-discrete-applied-mathematics-spring-2024/mit18_200_s24_lec15.pdf. Moitra, MIT 18.200, Lecture 15, pp. 8–9: the prime-modulus field criterion
Unitriangular group 2026-10-25
The unitriangular group consists of upper triangular matrices over a field with every diagonal entry equal to one. Every such matrix is for a strictly upper triangular matrix . Products have the same form, and gives the inverseThus these matrices form a subgroup of the general linear group. The case is noncommutative but every element has cube equal to the identity matrix: because and in the finite field .
Unitriangular matrix power formula Created 2026-10-06 Updated 2026-10-14
For a three-dimensional strictly upper triangular matrix , the binomial theorem stops after . Over a finite field of odd prime characteristic , both coefficients and vanish, so every nonidentity matrix in has order . In characteristic two, a matrix with nonzero instead has order four.
