Documentation

HexPolyFp.SquareFree.YunReduce

def Hex.FpPoly.squareFreeAuxRev {p : Nat} [ZMod64.Bounds p] (f : FpPoly p) (multiplicity : Nat) :

Tail-recursive square-free decomposition over F_p[x], accumulating factors in reverse output order. A derivative-zero branch descends through the formal p-th root and scales multiplicities by p.

Equations
  • One or more equations did not get rendered due to their size.
  • f.squareFreeAuxRev multiplicity 0 x✝ = x✝
Instances For
    def Hex.FpPoly.squareFreeAux {p : Nat} [ZMod64.Bounds p] (f : FpPoly p) (multiplicity fuel : Nat) :

    Recursive square-free decomposition over F_p[x]. A derivative-zero branch descends through the formal p-th root and scales multiplicities by p.

    Equations
    Instances For