Restriction of scatter types
Lax185574.ScatterTypeRestriction · concepts/Lax185574/ScatterTypeRestriction.lean · lax-185574
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Lemma
For every partial graph G and q ≥ 1, the function stp_{k+1,q−1} is the restriction of stp_{k,q} to domain(stp_{k+1,q−1}).
Concept map
In the paper
- page 45 of this submission's paper
Lean source view on GitHub
| 1 | import Lax185574.ScatterTypes |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Restriction of scatter types |
| 6 | type: lemma |
| 7 | --- |
| 8 | For every partial graph G and q ≥ 1, the function stp_{k+1,q−1} is the |
| 9 | restriction of stp_{k,q} to domain(stp_{k+1,q−1}). |
| 10 | |
| 11 | # Formalization notes |
| 12 | |
| 13 | q ≥ 1 is written as q + 1. The statement says that domain(stp_{k+1,q}) |
| 14 | is contained in domain(stp_{k,q+1}) and that the two functions agree on |
| 15 | it. |
| 16 | -/ |
| 17 | |
| 18 | namespace Lax185574.ScatterTypeRestriction |
| 19 | |
| 20 | open Lax185574.PartialGraphs Lax185574.ScatterTypes |
| 21 | |
| 22 | /-- **Restriction of scatter types.** -/ |
| 23 | axiom stp_restrict {n : ℕ} (G : PartialGraph (Fin n)) (k q : ℕ) : |
| 24 | domain G (k + 1) q ⊆ domain G k (q + 1) ∧ |
| 25 | ∀ p ∈ domain G (k + 1) q, value G (k + 1) q p = value G k (q + 1) p |
| 26 | |
| 27 | end Lax185574.ScatterTypeRestriction |
| 28 |
Formalization notes
q ≥ 1 is written as q + 1. The statement says that domain(stp_{k+1,q}) is contained in domain(stp_{k,q+1}) and that the two functions agree on it.
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments