Documentation

Mathlib.Tactic.Echelon.Rat

The rational model for the Bareiss elimination #

The rational model of a ring: entries evaluate to rational numerals via norm_num, denominators are cleared by row scaling, and the elimination runs on integer values. It is the fallback model the tactic uses when no ring-specific model matches the ring.

Data-only evaluation of a matrix entry to its rational value via norm_num. Fraction values are accepted only in characteristic zero.

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

    Scale each row by the lcm of its denominators to clear them. Returns the integer matrix together with the row scales, which are later folded back into L.

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

      The restoration for scaleRowsIntegral: fold the row scales into the transform, scaling column j by the factor of the row that ends up in position j.

      Equations
      • One or more equations did not get rendered due to their size.
      Instances For
        def Mathlib.Tactic.Echelon.mkIntNumeral {u : Lean.Level} (α : Q(Type u)) (i : ) :
        Lean.MetaM Q(«$α»)

        Build the numeral of an integer in α: mkNumeral on the absolute value, negated if i is negative.

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

          The rational model of a ring: entries evaluate to rational numerals, denominators are cleared by row scaling, and the elimination runs on integer values. It applies to every ring, as the fallback model.

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