The Setting
Let be a group and a finite set of labels, and give each label an array of elements of , with and running over . Each label also carries a punctured affine line in , for a prime and a dimension . When can such a group fail to be residually finite? Its tool is the left regular representation of a finite quotient of , which turns each array into a matrix over or ; the library bounds the ranks of these matrices and of their sums over the labels whose lines pass through a point, except at a set of exceptional points of .
Rectangles and Block Matrices
An array of elements of a group has surviving rectangles when each of its rectangular words is nontrivial: for all and , (1)✦
Let be a finite group and a semiring. The left regular permutation matrix of an element of is the permutation matrix over , with rows and columns indexed by , of left multiplication by on .✦ The map is a homomorphism from to the square matrices over indexed by .
The regular block matrix of an array of elements of is the square matrix over , with rows and columns indexed by the pairs with , whose block in position is : (2)✦ For arrays , one for each label , the block matrix of label is .
Cartesian Blocks
A Cartesian block with parameter is a finite set of labels together with positive integers and a bijection from onto .✦
A family of arrays in a group, one for each label, obeys the block relations on a Cartesian block when there are elements of the group, for , and , for , such that for every label of and all (3)✦
Punctured Lines and Certificates
Let be a finite field. The affine line through a point of in a direction is the image of ✦, and the punctured line is the set of its points other than .✦ Give each label a mark and a direction in , with line . The incidence set of a point of is the set of labels with .✦
The grid Lagrange polynomial of a point of , for a subset of , is the function on given, for , by (4)✦
Over an arbitrary field , take a finite set of points and an assignment of a set of labels to each point. A line certificate for this incidence is a family of weight vectors , one for each point of , such that for all labels , , (5)
For a weight vector and a matrix over , the weighted matrix is the Kronecker product of the rank-one matrix with : its block in position is .✦ For matrices over of one size, one for each label , the block diagonal matrix has as its diagonal block in position and zero blocks elsewhere.✦
The Claim
Theorem 1. Let be a finite group and an array of elements of . Over every semiring, (6)✦ If has surviving rectangles, then over every commutative ring (7)✦ over the real numbers (8)✦ and over , for every prime , (9)✦
For arrays in , one for each label, with block matrices over a field : if the arrays obey the block relations on a Cartesian block , then (10)✦ and if a set of labels is the disjoint union of two Cartesian blocks, on each of which the arrays obey the block relations, then (11)✦
Over a finite field , every polynomial of degree less than satisfies (12)✦ Take a subset of with , and give each label of a finite set a mark and a direction , distinct labels having distinct marks. Then the grid Lagrange weights form a line certificate for the incidence on : for all labels , , , (13)✦
Suppose is a line certificate over a field for an incidence on a finite set , and , for , are matrices over of one size. Then (14)✦ and (15)✦
When moreover for a prime , is a set of exceptional points in , and are arrays in a finite group with surviving rectangles whose block matrices satisfy at every point , the number of labels is bounded by (16)✦
If is a residually finite group and are arrays in with surviving rectangles, indexed by a finite set of labels, then there are a finite group and a homomorphism such that, for every label and all and , (17)✦
Let be any group and a prime, with , the marks and the directions as above over , so that , and let be a set of exceptional points of . Suppose the arrays in have surviving rectangles and, at every point , the incidence set is the disjoint union of two Cartesian blocks on each of which the arrays obey the block relations. If (18)✦ then is not residually finite.
What Is Checked
The claims are stated over the left regular permutation matrices of a finite group and the regular block matrices built from them, arrays with surviving rectangles, Cartesian blocks and their block relations, the punctured lines with the incidence sets , the grid Lagrange polynomials , and the weighted and block diagonal matrices.