Documentation

LeanPool.BooleanMultiplication.N4.LowProductBridge

ANF low-product bridge #

This module turns the exterior prefix-rigidity lemma into a statement about actual Boolean ANFs. All coordinate certificates below range only over an input coordinate and one of the three rational places; no circuit states are enumerated.

theorem UnrestrictedBooleanMul.N4.affineANF_add (a b : F₂) (ell m : LinearForm) :
affineANF (a + b) (ell + m) = affineANF a ell + affineANF b m
theorem UnrestrictedBooleanMul.N4.exists_affineANF_of_mem {p : ANF 8} (hp : p ∈ affine 8) :
∃ (a : F₂) (ell : LinearForm), p = affineANF a ell

The exterior product of two linear forms as a bilinear map.

Equations
  • One or more equations did not get rendered due to their size.
Instances For

    The quadratic coordinate array of a squarefree monomial.

    Equations
    Instances For

      Boolean contraction of a linear form with a two-form, as a bilinear map.

      Equations
      • One or more equations did not get rendered due to their size.
      Instances For

        Quadratic part of an input variable times a rational-place product.

        Equations
        • One or more equations did not get rendered due to their size.
        Instances For

          Actual ANF prefix closure: a product of two affine-plus-rational wires that lands back in Aff + T has no new target direction.