Regularity #
Here we study regular matroids.
Primary definition of regularity (LI & TU over ℚ) #
Secondary definition of regularity (LI over Z2 while TU over ℚ) #
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
- A.IsTuSigningOf U = (A.IsTotallyUnimodular ∧ A.IsSigningOf U)
Instances For
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
- U.HasTuSigning = ∃ (A : Matrix X Y ℚ), A.IsTuSigningOf U
Instances For
Auxiliary stuff #
theorem
Matrix.IsTotallyUnimodular.isTuSigningOf_support
{X Y : Type}
{A : Matrix X Y ℚ}
(hA : A.IsTotallyUnimodular)
:
A.IsTuSigningOf A.support
Main results of this file #
theorem
StandardRepr.toMatroid_isRegular_iff_hasTuSigning
{α : Type}
[DecidableEq α]
(S : StandardRepr α Z2)
[Finite ↑S.X]
:
Binary matroid constructed from a standard representation is regular iff the binary matrix has a TU signing.