Splitting by a transversal gives a partition homogeneous modulo the pair relation
Lax185574.HomogeneousSplitting · concepts/Lax185574/HomogeneousSplitting.lean · lax-185574
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Lemma
Fix a graph G and a partition 𝒫 of V(G), let T be a transversal of 𝒫, and R ≔ R(G, 𝒫). Then 𝒬 ≔ 𝒫 ∧ T is homogeneous modulo R, that is, for all X, Y ∈ 𝒬 either
XY ∖ R ⊆ E(G) or XY ∖ R ⊆ E(Ḡ).
Concept map
Evidence
Each proof establishes this claim relative to its assumptions.
In the paper
- page 34 of this submission's paper
Lean source view on GitHub
| 1 | import Lax185574.PairRelation |
| 2 | import Lax185574.TypeSplitting |
| 3 | import Lax185574.MergeSequences |
| 4 | |
| 5 | /-! |
| 6 | --- |
| 7 | title: Splitting by a transversal gives a partition homogeneous modulo the pair relation |
| 8 | type: lemma |
| 9 | --- |
| 10 | Fix a graph G and a partition 𝒫 of V(G), let T be a transversal of 𝒫, |
| 11 | and R ≔ R(G, 𝒫). Then 𝒬 ≔ 𝒫 ∧ T is *homogeneous modulo R*, that is, |
| 12 | for all X, Y ∈ 𝒬 either |
| 13 | |
| 14 | XY ∖ R ⊆ E(G) or XY ∖ R ⊆ E(Ḡ). |
| 15 | |
| 16 | # Formalization notes |
| 17 | |
| 18 | Homogeneity modulo R is `MergeSequences.HomogeneousModulo`, the fourth |
| 19 | condition of a merge sequence. The graph may be infinite. |
| 20 | -/ |
| 21 | |
| 22 | namespace Lax185574.HomogeneousSplitting |
| 23 | |
| 24 | open Lax185574.Partitions Lax185574.PairRelation Lax185574.TypeSplitting |
| 25 | open Lax185574.MergeSequences |
| 26 | |
| 27 | universe z |
| 28 | |
| 29 | /-- **Homogeneity modulo the pair relation.** For a transversal `T` of |
| 30 | `𝒫`, the partition `𝒫 ∧ T` is homogeneous modulo `R(G, 𝒫)`. -/ |
| 31 | axiom homogeneousModulo_split {V : Type z} (G : SimpleGraph V) (P : Setoid V) (T : Set V) |
| 32 | (hT : IsTransversal P T) : |
| 33 | HomogeneousModulo G (split G P T) (pairRelation G P) |
| 34 | |
| 35 | end Lax185574.HomogeneousSplitting |
| 36 |
Formalization notes
Homogeneity modulo R is , the fourth condition of a merge sequence. The graph may be infinite.
Used by
none
From Mathlib
none
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments