Evaluation after compressing parallel tuples
Lax369799.ParallelCompression · concepts/Lax369799/ParallelCompression.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
Taking the meet of each block in a parallel tuple has the same evaluation as renaming all ports in that block to one output. This is the local substitution identity used to compress a duplicated run in Lemma 108.
Concept map
Lean source view on GitHub
| 1 | import Lax369799.PortReindexing |
| 2 | import Lax369799.CloneTransitions |
| 3 | import Lax369799.DeterministicElements |
| 4 | |
| 5 | /-! |
| 6 | --- |
| 7 | title: Evaluation after compressing parallel tuples |
| 8 | type: theorem |
| 9 | --- |
| 10 | Taking the meet of each block in a parallel tuple has the same evaluation |
| 11 | as renaming all ports in that block to one output. This is the local |
| 12 | substitution identity used to compress a duplicated run in Lemma 108. |
| 13 | -/ |
| 14 | namespace Lax369799.ParallelCompression |
| 15 | open RankedSystems (RankedSet) |
| 16 | open FinitePresentations SetSystemAlgebras CloneTransitions PortReindexing |
| 17 | variable {A : RankedSet} {n k : ℕ} (b : Fin (n * k) → A 1) |
| 18 | |
| 19 | axiom evaluation (E : SetAlgebra A) : |
| 20 | E.eval n (ofSetSystem (DeterministicElements.parallel (compress E b))) = |
| 21 | E.eval n (rename (ofSetSystem (DeterministicElements.parallel b)) (fun i => i.divNat)) |
| 22 | |
| 23 | end Lax369799.ParallelCompression |
| 24 |
Used by
none
From Mathlib
none
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments