Documentation

HexBerlekampZassenhausMathlib.KernelFactorTactic

Dense-size cap (degree + 1) for the kernel factorizer replay: degree 12 already costs tens of seconds of kernel time per input.

Equations
Instances For

    Reject inputs whose kernel factorizer replay would be over budget.

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

      Precheck that the kernel can reduce decide prop to true in the current environment, so a missing import all closure fails here with a clear message instead of a bare kernel type mismatch at declaration time.

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

        Shared degenerate-input and budget checks for the bang fallbacks.

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

          The irreducibility! fallback for Hex.ZPoly inputs: free-layer conclusion via one kernel factorizer replay.

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

            The irreducibility! fallback for Polynomial inputs: parse with proof, then transport the kernel replay through the translation equality.

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

              The membership-bounded irreducibility proposition ∀ q ∈ factorsE, Hex.ZPoly.Irreducible q as an expression.

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

                The factor_poly! fallback machinery shared by both input types: factorize, self-check, reify, and kernel-precheck the per-factor replay. Returns the scalar and factor-list expressions.

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

                  The factor_poly! fallback for Hex.ZPoly inputs.

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

                    The factor_poly! fallback for Polynomial inputs.

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

                      Elaborate a bang-fallback argument and selection on its type.

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

                        irreducibility! f behaves as irreducibility f, then falls back to the kernel factorizer replay when the certificate computation declines (see the module docstring for the import all closure and cost caveats).

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

                          Elaborator for term-mode irreducibility!.

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

                            The bang goal-mode fallback: close Hex.ZPoly.Irreducible e, Irreducible (toPolynomial f), or Irreducible P for parseable P : Polynomial by the kernel factorizer replay.

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

                              Tactic forms of irreducibility!, mirroring irreducibility: bare form closes an irreducibility goal, irreducibility! f adds this, and irreducibility! h : f names it h, each falling back to the kernel factorizer replay when the certificate computation declines.

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

                                Elaborator for the irreducibility! tactic forms.

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

                                  Shared plain-then-bang elaboration for factor_poly!.

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

                                    factor_poly! f behaves as factor_poly f, then falls back to per-factor kernel factorizer replays when the certificate computation declines (see the module docstring for the import all closure and cost caveats).

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

                                      Elaborator for term-mode factor_poly!.

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

                                        The tactic form of factor_poly!: as the factor_poly tactic (scalar/factors bindings plus factors_mul/factors_irred), with the kernel-replay fallback.

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

                                          Elaborator for the factor_poly! tactic form.

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