Carryless multiplication 2026-10-20
Carryless multiplication treats binary digits as coefficients of a polynomial over the field with two elements. Products are formed by polynomial multiplication, with exclusive or combining equal-degree terms instead of carrying to the next binary position.
No. Let be the field with two elements, put , and take the closed immersion
induced by the ring homomorphism with .
For every field , a ring homomorphism must send to zero: , and a field has no nonzero nilpotent elements. Consequently factors uniquely through . Passing from ring homomorphisms to morphisms of schemes between affine schemes gives a bijection
This concerns all morphisms of schemes, without requiring them to be over : if does not have characteristic two, both sets are empty; otherwise each contains exactly one element.
Nevertheless, is not an isomorphism of schemes. Its map on global sections is , whose kernel of a ring homomorphism contains the nonzero element , so is not a ring isomorphism. The target is the nonreduced scheme defined by the dual numbers, whereas the source is a reduced scheme. This illustrates why field-valued points do not detect nilpotents.