Documentation

Seymour.Matroid.Properties.Regularity

Regularity #

Here we study regular matroids.

Primary definition of regularity (LI & TU over ℚ) #

def Matroid.IsRegular {α : Type} (M : Matroid α) :

Matroid is regular iff it can be constructed from a rational TU matrix.

Equations
Instances For

    Secondary definition of regularity (LI over Z2 while TU over ℚ) #

    def Matrix.IsTuSigningOf {X Y : Type} (A : Matrix X Y ) (U : Matrix X Y Z2) :

    Rational matrix A is a TU signing of U (matrix of the same size but different type) iff A is TU and its entries are the same as entries in U on respective positions up to signs. Do not ask U.IsTotallyUnimodular ... see Matrix.overZ2_isTotallyUnimodular for example!

    Equations
    Instances For
      def Matrix.HasTuSigning {X Y : Type} (U : Matrix X Y Z2) :

      Matrix U has a TU signing iff there is a rational TU matrix whose entries are the same as those in U up to signs.

      Equations
      Instances For

        Auxiliary stuff #

        @[simp]
        theorem Matroid.isRegular_mapEquiv_iff {α β : Type} (M : Matroid α) (e : α β) :

        Regularity of matroids is preserved under remapping.

        Main results of this file #

        theorem Matroid.IsRegular.isBinary {α : Type} [DecidableEq α] {M : Matroid α} (hM : M.IsRegular) :
        ∃ (X : Set α) (Y : Set α) (A : Matrix (↑X) (↑Y) Z2), A.toMatroid = M

        Every regular matroid is binary.

        Binary matroid constructed from a standard representation is regular iff the binary matrix has a TU signing.