The Word Table Encodes the Same Graph
Lax920634.WordEncodingCorrectness · concepts/Lax920634/WordEncodingCorrectness.lean · lax-920634
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Lemma
The word table contains exactly one header and one endpoint per vertex. Its header is the graph order, every endpoint is a valid vertex label, and decoding produces exactly the specified subcubic graph.
Concept map
Evidence
Each proof establishes this claim relative to its assumptions.
Lean source view on GitHub
| 1 | import Lax920634.WordEncoding |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: The Word Table Encodes the Same Graph |
| 6 | type: lemma |
| 7 | --- |
| 8 | The word table contains exactly one header and one endpoint per vertex. |
| 9 | Its header is the graph order, every endpoint is a valid vertex label, |
| 10 | and decoding produces exactly the specified subcubic graph. |
| 11 | -/ |
| 12 | |
| 13 | namespace Lax920634.WordEncodingCorrectness |
| 14 | |
| 15 | open ZigZagConstruction WordEncoding |
| 16 | |
| 17 | /-- The linear-size word encoding is complete, bounded, and faithful to the original graph. -/ |
| 18 | axiom table_correct (k : ℕ) : |
| 19 | (table k).head? = some (order k) ∧ |
| 20 | (table k).length = order k + 1 ∧ |
| 21 | (∀ j < order k, |
| 22 | ((table k).tail[j]?).getD 0 < order k) ∧ |
| 23 | decode (order k) (table k) = graph k |
| 24 | |
| 25 | end Lax920634.WordEncodingCorrectness |
| 26 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments