Inserting a twin preserves crossings
Lax235315.TwinInsertion · concepts/Lax235315/TwinInsertion.lean · lax-235315
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Lemma
Duplicating a membership entry immediately next to itself leaves the crossing count unchanged. Applying this to every set proves Lemma 2.1 of Dreier–Kuske: an adjacent duplicate of a twin does not change any crossing count.
Concept map
Lean source view on GitHub
| 1 | import Lax235315.SequenceCrossings |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Inserting a twin preserves crossings |
| 6 | type: lemma |
| 7 | --- |
| 8 | Duplicating a membership entry immediately next to itself leaves the crossing |
| 9 | count unchanged. Applying this to every set proves Lemma 2.1 of |
| 10 | Dreier--Kuske: an adjacent duplicate of a twin does not change any crossing count. |
| 11 | |
| 12 | # Formalization notes |
| 13 | |
| 14 | The arbitrary prefix and suffix allow insertion at every position, including |
| 15 | the ends. This is a claim about membership sequences, independent of whether |
| 16 | the duplicated entries represent distinct vertices. |
| 17 | -/ |
| 18 | |
| 19 | namespace Lax235315.TwinInsertion |
| 20 | open Lax235315.SequenceCrossings |
| 21 | |
| 22 | /-- Adjacent repetition of a bit preserves the number of changes. -/ |
| 23 | axiom crossings_duplicate (pre post : List Bool) (b : Bool) : |
| 24 | crossings (pre ++ b :: b :: post) = |
| 25 | crossings (pre ++ b :: post) |
| 26 | |
| 27 | end Lax235315.TwinInsertion |
| 28 |
Formalization notes
The arbitrary prefix and suffix allow insertion at every position, including the ends. This is a claim about membership sequences, independent of whether the duplicated entries represent distinct vertices.
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments