Finite observations after output compaction
Lax369799.SupportEvaluation · concepts/Lax369799/SupportEvaluation.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
An observation records an injective output map and the evaluation of a fully supported compacted system. Observation profiles have finite index when the algebra has finite sorts. Two systems have the same profile precisely when a common output map exposes equal supported values. The closed quotient recovers the original closed sort.
Concept map
Evidence
This concept declares 6 statements. Each proof establishes one of them relative to its assumptions.
1 closed_carrier proven
2 closed_equivalent_iff proven
3 equivalent_iff proven
4 finite_carrier proven
5 finite_observations proven
6 profile_nonempty proven
Lean source view on GitHub
| 1 | import Lax369799.SupportedAlgebras |
| 2 | import Mathlib.Data.Finite.Sigma |
| 3 | import Mathlib.Data.Fintype.Powerset |
| 4 | |
| 5 | /-! |
| 6 | --- |
| 7 | title: Finite observations after output compaction |
| 8 | type: theorem |
| 9 | --- |
| 10 | An observation records an injective output map and the evaluation of a |
| 11 | fully supported compacted system. Observation profiles have finite index |
| 12 | when the algebra has finite sorts. Two systems have the same profile precisely when a common output map |
| 13 | exposes equal supported values. The closed quotient recovers the original closed sort. |
| 14 | -/ |
| 15 | |
| 16 | namespace Lax369799.SupportEvaluation |
| 17 | open RankedSystems (RankedSet RankwiseFinite) |
| 18 | open SupportedSystems SupportedAlgebras |
| 19 | |
| 20 | structure Observation (B : RankedSet) (n : ℕ) where |
| 21 | arity : Fin (n+1) |
| 22 | ports : Fin arity.val ↪ Fin n |
| 23 | value : B arity.val |
| 24 | |
| 25 | def profile {B : RankedSet} (E : Algebra B) {n : ℕ} (S : RankedSystems.System B n) : |
| 26 | Set (Observation B n) := |
| 27 | {o | ∃ T : System B o.arity.val, |
| 28 | Renaming.renameSystem o.ports T.val = S ∧ E.eval o.arity.val T = o.value} |
| 29 | |
| 30 | def Equivalent {B : RankedSet} (E : Algebra B) {n : ℕ} |
| 31 | (S T : RankedSystems.System B n) : Prop := profile E S = profile E T |
| 32 | |
| 33 | abbrev Carrier {B : RankedSet} (E : Algebra B) : RankedSet := |
| 34 | fun n => Quot (@Equivalent B E n) |
| 35 | |
| 36 | def classMap {B : RankedSet} (E : Algebra B) : RankedSystems.RankedMap (RankedSystems.System B) (Carrier E) := |
| 37 | fun _ => Quot.mk _ |
| 38 | |
| 39 | axiom profile_nonempty {B : RankedSet} (E : Algebra B) {n : ℕ} |
| 40 | (S : RankedSystems.System B n) : (profile E S).Nonempty |
| 41 | |
| 42 | axiom finite_observations {B : RankedSet} (hB : RankwiseFinite B) (n : ℕ) : |
| 43 | Finite (Observation B n) |
| 44 | |
| 45 | axiom finite_carrier {B : RankedSet} (E : Algebra B) (hB : RankwiseFinite B) : |
| 46 | RankwiseFinite (Carrier E) |
| 47 | |
| 48 | axiom equivalent_iff {B : RankedSet} (E : Algebra B) |
| 49 | {n : ℕ} (S T : RankedSystems.System B n) : |
| 50 | Equivalent E S T ↔ ∃ (m : ℕ) (σ : Fin m → Fin n), Function.Injective σ ∧ |
| 51 | ∃ U V : System B m, Renaming.renameSystem σ U.val = S ∧ |
| 52 | Renaming.renameSystem σ V.val = T ∧ E.eval m U = E.eval m V |
| 53 | |
| 54 | axiom closed_equivalent_iff {B : RankedSet} (E : Algebra B) |
| 55 | (S T : RankedSystems.System B 0) : |
| 56 | Equivalent E S T ↔ E.eval 0 (closedEquiv B |>.symm S) = |
| 57 | E.eval 0 (closedEquiv B |>.symm T) |
| 58 | |
| 59 | axiom closed_carrier {B : RankedSet} (E : Algebra B) : |
| 60 | ∃ e : Carrier E 0 ≃ B 0, ∀ S : RankedSystems.System B 0, |
| 61 | e (classMap E 0 S) = E.eval 0 ((closedEquiv B).symm S) |
| 62 | |
| 63 | end Lax369799.SupportEvaluation |
| 64 | |
| 65 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments