Compression of variable maps by finite observations
Lax369799.VariableCompression · concepts/Lax369799/VariableCompression.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
Group variables by their target and a finite observation. Choosing one representative of each group preserves both observations and bounds each new target fibre by the number of possible observations.
Concept map
Lean source view on GitHub
| 1 | import Lax369799.Resolutions |
| 2 | import Mathlib.Data.Fintype.EquivFin |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Compression of variable maps by finite observations |
| 7 | type: theorem |
| 8 | --- |
| 9 | Group variables by their target and a finite observation. Choosing one |
| 10 | representative of each group preserves both observations and bounds each |
| 11 | new target fibre by the number of possible observations. |
| 12 | -/ |
| 13 | namespace Lax369799.VariableCompression |
| 14 | |
| 15 | axiom compress {V : Type} [Finite V] {m n : ℕ} (σ : Fin m → Fin n) (observe : Fin m → V) : |
| 16 | ∃ (m' : ℕ) (τ : Fin m → Fin m') (sectionMap : Fin m' → Fin m), |
| 17 | (∀ j, τ (sectionMap j) = j) ∧ |
| 18 | (∀ i, σ (sectionMap (τ i)) = σ i) ∧ |
| 19 | (∀ i, observe (sectionMap (τ i)) = observe i) ∧ |
| 20 | (∀ j, Nat.card {i // σ (sectionMap i) = j} ≤ Nat.card V) |
| 21 | |
| 22 | end Lax369799.VariableCompression |
| 23 |
Builds on
From Mathlib
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments