The Explicit Subcubic Family Expands
Lax920634.ExplicitExpansion · concepts/Lax920634/ExplicitExpansion.lean · lax-920634
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Lemma
Put and . Every specified graph has edge expansion at least , uniformly in the level.
Concept map
Evidence
Each proof establishes this claim relative to its assumptions.
Lean source view on GitHub
| 1 | import Lax920634.ZigZagConstruction |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: The Explicit Subcubic Family Expands |
| 6 | type: lemma |
| 7 | --- |
| 8 | Put and . Every specified graph has edge |
| 9 | expansion at least , uniformly in the level. |
| 10 | |
| 11 | # Formalization notes |
| 12 | |
| 13 | The constant depends only on the fixed seed degree, not on the graph order. |
| 14 | The proof combines the zig-zag spectral bound with path replacement and |
| 15 | checks the canonical vertex numbering. |
| 16 | -/ |
| 17 | |
| 18 | namespace Lax920634.ExplicitExpansion |
| 19 | |
| 20 | open ZigZagConstruction EdgeExpansion |
| 21 | |
| 22 | /-- The specified deterministic family has a uniform positive edge-expansion constant. -/ |
| 23 | axiom expansion (k : ℕ) : HasEdgeExpansionAtLeast |
| 24 | (graph k) (1 / (8 * (degree : ℚ))) |
| 25 | |
| 26 | end Lax920634.ExplicitExpansion |
| 27 |
Formalization notes
The constant depends only on the fixed seed degree, not on the graph order. The proof combines the zig-zag spectral bound with path replacement and checks the canonical vertex numbering.
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments