Documentation
Matroid
.
OnUniv
Search
return to top
source
Imports
Init
Matroid.Sum
Mathlib.Combinatorics.Matroid.Circuit
Imported by
Matroid
.
OnUniv
Matroid
.
onUniv_iff
Matroid
.
instOnUnivRestrictUniv
Matroid
.
instOnUnivDual
Matroid
.
ground_eq_univ
Matroid
.
OnUniv
.
subset_ground
Matroid
.
OnUniv
.
ground_diff_eq
Matroid
.
corestrict_univ_eq_disjointSum
Matroid
.
corestrict_univ_indep_iff
Matroid
.
corestrict_univ_isBase_iff
Matroid
.
corestrict_univ_isBasis_iff
Matroid
.
IsBasis'
.
corestrict_univ_isBasis
Matroid
.
IsBasis
.
corestrict_univ_isBasis
Matroid
.
IsBasis'
.
corestrict_univ_union_isBasis_union
Matroid
.
corestrict_univ_restrict_ground
Matroid
.
restrict_univ_restrict_ground
source
class
Matroid
.
OnUniv
{
α
:
Type
u_1}
(
M
:
Matroid
α
)
:
Prop
ground_eq :
M
.
E
=
Set.univ
Instances
source
theorem
Matroid
.
onUniv_iff
{
α
:
Type
u_1}
(
M
:
Matroid
α
)
:
M
.
OnUniv
↔
M
.
E
=
Set.univ
source
instance
Matroid
.
instOnUnivRestrictUniv
{
α
:
Type
u_1}
{
M
:
Matroid
α
}
:
(
M
.
restrict
Set.univ
)
.
OnUniv
source
instance
Matroid
.
instOnUnivDual
{
α
:
Type
u_1}
{
M
:
Matroid
α
}
[
h
:
M
.
OnUniv
]
:
M
✶
.
OnUniv
source
@[simp]
theorem
Matroid
.
ground_eq_univ
{
α
:
Type
u_1}
(
M
:
Matroid
α
)
[
M
.
OnUniv
]
:
M
.
E
=
Set.univ
source
@[simp]
theorem
Matroid
.
OnUniv
.
subset_ground
{
α
:
Type
u_1}
(
M
:
Matroid
α
)
[
M
.
OnUniv
]
(
X
:
Set
α
)
:
X
⊆
M
.
E
source
theorem
Matroid
.
OnUniv
.
ground_diff_eq
{
α
:
Type
u_1}
(
M
:
Matroid
α
)
[
M
.
OnUniv
]
(
X
:
Set
α
)
:
M
.
E
\
X
=
X
ᶜ
source
theorem
Matroid
.
corestrict_univ_eq_disjointSum
{
α
:
Type
u_1}
(
M
:
Matroid
α
)
:
(
M
✶
.
restrict
Set.univ
)
✶
=
M
.
disjointSum
(
freeOn
M
.
E
ᶜ
)
⋯
source
@[simp]
theorem
Matroid
.
corestrict_univ_indep_iff
{
α
:
Type
u_1}
{
M
:
Matroid
α
}
{
I
:
Set
α
}
:
(
M
✶
.
restrict
Set.univ
)
✶
.
Indep
I
↔
M
.
Indep
(
I
∩
M
.
E
)
source
theorem
Matroid
.
corestrict_univ_isBase_iff
{
α
:
Type
u_1}
{
M
:
Matroid
α
}
{
B
:
Set
α
}
:
(
M
✶
.
restrict
Set.univ
)
✶
.
IsBase
B
↔
M
.
IsBase
(
B
∩
M
.
E
)
∧
M
.
E
ᶜ
⊆
B
source
theorem
Matroid
.
corestrict_univ_isBasis_iff
{
α
:
Type
u_1}
{
M
:
Matroid
α
}
{
I
X
:
Set
α
}
:
(
M
✶
.
restrict
Set.univ
)
✶
.
IsBasis
I
X
↔
M
.
IsBasis
(
I
∩
M
.
E
) (
X
∩
M
.
E
)
∧
I
⊆
X
∧
X
\
M
.
E
⊆
I
source
theorem
Matroid
.
IsBasis'
.
corestrict_univ_isBasis
{
α
:
Type
u_1}
{
M
:
Matroid
α
}
{
I
X
:
Set
α
}
(
hIX
:
M
.
IsBasis'
I
X
)
:
(
M
✶
.
restrict
Set.univ
)
✶
.
IsBasis
(
I
∪
X
\
M
.
E
)
X
source
theorem
Matroid
.
IsBasis
.
corestrict_univ_isBasis
{
α
:
Type
u_1}
{
M
:
Matroid
α
}
{
I
X
:
Set
α
}
(
hIX
:
M
.
IsBasis
I
X
)
:
(
M
✶
.
restrict
Set.univ
)
✶
.
IsBasis
I
X
source
theorem
Matroid
.
IsBasis'
.
corestrict_univ_union_isBasis_union
{
α
:
Type
u_1}
{
M
:
Matroid
α
}
{
I
X
:
Set
α
}
(
hIX
:
M
.
IsBasis'
I
X
)
:
(
M
✶
.
restrict
Set.univ
)
✶
.
IsBasis
(
I
∪
M
.
E
ᶜ
) (
X
∪
M
.
E
ᶜ
)
source
@[simp]
theorem
Matroid
.
corestrict_univ_restrict_ground
{
α
:
Type
u_1}
{
M
:
Matroid
α
}
:
(
M
✶
.
restrict
Set.univ
)
✶
.
restrict
M
.
E
=
M
source
@[simp]
theorem
Matroid
.
restrict_univ_restrict_ground
{
α
:
Type
u_1}
{
M
:
Matroid
α
}
:
(
M
.
restrict
Set.univ
)
.
restrict
M
.
E
=
M