How can every affine scheme fit inside Z2 = 0?
Throughout, an affine scheme means a finitely presented affine scheme over a field . An affine-linear section is a scheme-theoretic intersection with a closed subscheme cut out by affine-linear equations. Write for the affine space of matrices.
The construction will replace the equations of by affine-linear conditions on a matrix satisfying . A fixed identity block forces maximal square-zero rank, placing the matrices in one smooth nilpotent orbit over a field, while the affine-linear section cuts out itself.
The algebraic construction works over an arbitrary commutative ring ; after constructing the section, we specialize to for the orbit and symplectic interpretation. For ,
Affine-linear maps put into the off-diagonal entries and read either diagonal entry after squaring. Thus one matrix square computes multiplication over every characteristic.
Both diagonal entries are .
Size two is necessary for a characteristic-independent construction. In characteristic two, every scalar expression built from affine maps and unary squaring is a sum of Frobenius powers and has no mixed monomial .
Write
and choose a straight-line circuit for the , using constants, addition, subtraction and multiplication. A straight-line circuit introduces each new wire once and only uses earlier wires.
For example, the cusp may be written
Reserve one diagonal block of a matrix for every scalar wire. For every multiplication gate , reserve a private block
Set every unused entry of to zero and introduce a second matrix . We will intersect the resulting affine-linear conditions with the graph .
By the identity, a diagonal entry of the private block of is ; identify that entry affinely with . Constants, copying, addition, subtraction and the final zero-output conditions are affine-linear. Together these conditions cut out an affine-linear closed subscheme .
Size. If the circuit has scalar wires and multiplication gates, this construction uses .
If
then
The isomorphism is scheme-theoretic. After eliminating , the coordinate ring is the polynomial ring in the circuit wires modulo the gate and output equations. Every internal gate equation is monic in a fresh wire. Eliminating the wires in circuit order leaves exactly , including its nilpotents, embedded components and multiplicities.
Now send the graph of squaring into one square-zero equation by the affine-linear map
Put . Direct block multiplication gives
The two diagonal blocks are , while the lower-left block belongs to the ideal generated by the entries of . Therefore the pullback of the ideal generated by the entries of is exactly the graph ideal generated by the entries of :
scheme-theoretically. Already this is an affine-linear section of the square-zero matrix scheme.
Let
The fixed top-right block forces rank at least . A square-zero endomorphism of a -dimensional vector space satisfies , hence has rank at most . Thus every field-valued point of with has maximal possible square-zero rank .
Let
The orbit has exactly the matrices with and . Indeed, for such a matrix,
and the induced map is an isomorphism. Conversely, a subspace together with an isomorphism determines such a matrix. Hence is the open isomorphism locus in the vector bundle
so it is smooth and irreducible, with
The cell needed below is the orbit of under a simple abelian unipotent subgroup. For , set
Then, over every -algebra,
As varies, runs through an abelian unipotent subgroup isomorphic to . The conjugation identity identifies its orbit with
It is closed in : inside it is the graph cut out by
Combining the block-square and conjugation identities gives equalities of subschemes
These identities hold functorially on every -algebra, hence as equalities of subschemes.
For the matrix is
The blue line is both kernel and image. It is the graph .
The same description holds for every :
Thus identifies with the standard affine big cell of .
The identity block forces maximal square-zero rank, placing the cell in . As varies, runs through an abelian unipotent subgroup whose orbit is . The trace pairing gives its natural symplectic form; is isotropic and half-dimensional, hence Lagrangian.
Why is the orbit symplectic and the cell Lagrangian?
The stabilizer of is
which is smooth. Hence the orbit map is separable and
The trace pairing on is perfect over every field. Define
For , , so is alternating.
If , then
so the formula is independent of the chosen representative . By conjugation-invariance of trace, at this bilinear form is invariant under , so it descends to a regular -invariant two-form on . If it pairs to zero with every tangent vector, then
so and the tangent vector vanishes. Thus is nondegenerate. Evaluating on the fundamental vector fields generated by gives
The Jacobi identity gives , so is algebraic symplectic.
The Lie algebra of the subgroup
is
which is abelian. Hence vanishes on the tangent spaces of . Since ,
so is Lagrangian.
For the affine-linear section constructed from the circuit, put
The intersection is scheme-theoretic.
The only nonlinear primitive is multiplication. Each product gate is carried by a squaring block, while all other circuit wiring is affine-linear. Thus any exact affine-linear presentation of the graph can replace this block in the same construction.
For a finite diagram, adjoin labelled circuit coordinates for every composite. Each morphism is then induced by a coordinate projection, and compositions agree already on the ambient spaces. (See the paper, Cor. 4.5.)
Dual numbers. A representation of is determined by the square-zero matrix assigned to , so
The two-dimensional dual-number algebra therefore already has universal representation schemes under affine-linear sectioning; dimension one cannot, because its representation schemes are points.
Complexity. The paper also proves that, over , deciding whether a rational affine subspace meets is -complete, even when and the identity block is fixed. (Thm. 6.1)
Found this interesting and useful?
This article isolates the minimal construction. The companion rank-one paper shows that the same mechanism is lossless far beyond this square-zero orbit. At every prescribed rank , and in any finite exact presentation language capable of presenting z = xy, the resulting presentation category is equivalent to ; its Pro-completion recovers , and the set-indexed realization preserves all small affine limits. The construction extends to derived and stacky geometry; over finite fields, it also realizes Set and Stone spaces, material membership, and complete Segal models of small ∞-categories. It also gives optimal size and orbit bounds and real, finite-field, and integral complexity results.
Regular-semisimple orbit. is one split regular-semisimple adjoint orbit with pairwise distinct eigenvalues fixed in advance, over an infinite field with 2 invertible.
Material membership. Over a finite field , RkV consists of isomorphism classes of well-founded, extensional, root-accessible rooted relation codes in the rank-one Set model. Membership is rooted restriction: for an immediate predecessor of the root. Every set is represented by such a code, the codes have trivial automorphism groups, and the isomorphism with preserves every first-order formula in membership.
∞-categories. For a finite field , every -small ∞-category has a complete-Segal rank-one realization. Here is the filtered-colimit closure of the finite split rank-one objects and is canonically equivalent to Set, with morphisms exactly the functions. Applying this equivalence levelwise gives the displayed equivalence; the universal cocartesian family becomes a rank-one family retaining its fibers, mapping spaces, composition, and higher coherences.