Lax17.CrossbarOrPseudoGrid
Crossbar-or-pseudo-grid dichotomy
concepts/Lax17/CrossbarOrPseudoGrid.lean · lax-17
No public endorsements yet.
Loading review…
Sign in with ORCIDConcept map
Evidence
Each proof establishes this claim relative to its assumptions.
Theorem
Theorem 4.1: two full disjoint linkage families yield either a crossbar or a pseudo-grid.
Lean source view on GitHub
| 1 | import Lax17.Crossbar |
| 2 | import Lax17.Degree |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Crossbar-or-pseudo-grid dichotomy |
| 7 | type: theorem |
| 8 | --- |
| 9 | Theorem 4.1: two full disjoint linkage families yield either a crossbar or a |
| 10 | pseudo-grid. |
| 11 | -/ |
| 12 | |
| 13 | namespace Lax17.CrossbarOrPseudoGrid |
| 14 | |
| 15 | universe u |
| 16 | |
| 17 | /-- The self-contained crossbar-or-pseudo-grid form of Theorem 4.1. -/ |
| 18 | axiom crossbarOrPseudoGrid : |
| 19 | ∀ {V : Type u} [Fintype V] [DecidableEq V] |
| 20 | (G : SimpleGraph V) {A B X : Finset V} {g κ D : ℕ}, |
| 21 | 2 ≤ g → |
| 22 | Lax17.Crossbar.IsPowerOfTwo g → |
| 23 | A.card = κ → B.card = κ → X.card = κ → |
| 24 | Disjoint A B → Disjoint A X → Disjoint B X → |
| 25 | (∀ x ∈ X, Lax17.Degree.Exactly G x 1) → |
| 26 | Lax17.Paths.VertexLinkage G A B κ → |
| 27 | Lax17.Paths.VertexLinkage G A X κ → |
| 28 | 1 ≤ D → D ≤ κ / (2 * g ^ 2) → |
| 29 | Nonempty |
| 30 | (Lax17.Crossbar.System G A B X (g ^ 2)) ∨ |
| 31 | Nonempty |
| 32 | (Lax17.Crossbar.PseudoGrid |
| 33 | G A B X g D κ) |
| 34 | |
| 35 | end Lax17.CrossbarOrPseudoGrid |
| 36 |
Community review
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above; your ORCID profile must share a public name.
0 comments