Affine line in a vector space Created 2026-10-06 Updated 2026-10-07
In a vector space over a field , an affine line is a translate of a one-dimensional vector subspace. Its direction is that vector subspace, so multiplying by a nonzero scalar preserves the direction. Over a finite field of size it contains exactly distinct points. This usage concerns affine subsets of vector spaces, rather than the affine line as an affine scheme.
C2 field 2026-10-07
A field is a Ci field with the bound . Function fields of curves over finite fields are examples. The extra-variable construction in surjectivity of reduced norms over C2 fields makes this polynomial-solvability property useful for division algebras.
Ci field 2026-10-07
A field is if every homogeneous polynomial of degree in more than variables has a nonzero zero. Algebraically closed fields are , finite fields are , and the Lang-Nagata theorem for Ci fields controls function-field extensions.
The vector space of formal polynomials over a field in variables with total degree of a polynomial at most has the monomial basis for nonnegative exponents with . Introducing a slack exponent and using stars and bars counts basis elements. These are formal polynomials; over a finite field, distinct formal polynomials need not define distinct polynomial functions unless suitable degree restrictions hold.
Fano plane 2026-10-06
The Fano plane is the projective plane over the finite field . It has seven points and seven lines, each line contains three points, and two distinct lines meet in one point. A line-point incidence matrix therefore satisfies , making it invertible over the real numbers and useful for the transplantation theorem.
Field with nine elements 2026-10-06
The finite field can be represented as , since the quadratic has no root modulo three. Its elements are for , with . Multiplication reduces to modulo three.
For a nonconstant polynomial over any field, use triangular substitutions , , where exceeds every exponent in its support. Base- weights distinguish all original monomials, so the transformed polynomial has a unique highest power with coefficient in . Rescale to make it monic. The monic polynomial quotient is finite free over , yielding a finite flat projection. The nonlinear substitution works over finite fields as well as infinite ones; a generic linear-direction argument alone would not do so.
Upper-unitriangular three-by-three matrices over the prime finite field form the finite analogue of the real Heisenberg group. In coordinates their multiplication is . The order is , and . For odd , every nonidentity element has order , but the group is nonabelian. For the exponent statement changes, so odd characteristic is essential for the nonisomorphic Gassmann equivalent regular subgroups construction.
Elliptic curves isogenous over a finite field have the same number of rational points: the isogeny intertwines Frobenius, and multiplicativity of degree gives equal degrees for . Their groups need not be isomorphic. Over , and are two-isogenous and have groups and , respectively.
Over a finite field of odd cardinality , a diagonal nondegenerate ternary quadratic form has a zero with : the sets and both have elements and must intersect. This gives a nonzero nonsingular zero. Over a local integer ring with these coefficients units, the Hensel lemma lifts it to an isotropic vector in the fraction field.
For any field and vector subspace , some has at least nonzero coordinates. Choose with largest support of a vector . Restriction from to is injective: a nonzero vector in its kernel of a linear map vanishes on , so adding it to would enlarge . Thus . The argument works over finite fields, where assuming a generic vector avoids finitely many hyperplanes would be invalid.
Modular Heisenberg group 2026-10-06
The modular Heisenberg group consists of upper-unitriangular matrices over the finite field . In coordinates , multiplication is , and its order is . Its center of a group is ; the quotient group by the centre is , represented by the coordinates. The elementary generators , , satisfy , , and central. For , , so the whole group does not have exponent two.
Over the reals or a finite field with more than two elements, the normalizer of all invertible diagonal matrices in consists of monomial matrices and has quotient over that diagonal subgroup. Over its size is for . For the diagonal subgroup is trivial, so its normalizer is all of , of order six.
For prime , every order- element of is conjugate to the displayed nonidentity unipotent matrix. Its cyclic subgroup has vector group orbits of sizes one or ; counting all vectors implies at least fixed vectors. Choose a nonzero fixed vector as first basis vector. The matrix becomes triangular with first diagonal entry one; its other diagonal entry satisfies and hence in the prime finite field. The off-diagonal entry is nonzero and can be rescaled to one. All matrices involved have invertible changes of basis.