While this submission is a draft, it cannot be used by other submissions.

Finite observations after output compaction

Lax369799.SupportEvaluation · concepts/Lax369799/SupportEvaluation.lean · lax-369799

proven

Loading review…

Sign in with ORCID

Community review

Flags

Each flag is tied to a public ORCID identity and explains why this concept may be incorrect.

No flags have been submitted.

    Community review

    Flag this concept

    State precisely what appears incorrect. This explanation will be public under your ORCID name.

    No source line selected.

    Natural 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
    11 concepts; 5 descendants hidden
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

    This concept declares 6 statements. Each proof establishes one of them relative to its assumptions.

    Lean source view on GitHub

    1import Lax369799.SupportedAlgebras
    2import Mathlib.Data.Finite.Sigma
    3import Mathlib.Data.Fintype.Powerset
    4
    5/-!
    6---
    7title: Finite observations after output compaction
    8type: theorem
    9---
    10An observation records an injective output map and the evaluation of a
    11fully supported compacted system. Observation profiles have finite index
    12when the algebra has finite sorts. Two systems have the same profile precisely when a common output map
    13exposes equal supported values. The closed quotient recovers the original closed sort.
    14-/
    15
    16namespace Lax369799.SupportEvaluation
    17open RankedSystems (RankedSet RankwiseFinite)
    18open SupportedSystems SupportedAlgebras
    19
    20structure Observation (B : RankedSet) (n : ℕ) where
    21 arity : Fin (n+1)
    22 ports : Fin arity.val ↪ Fin n
    23 value : B arity.val
    24
    25def 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
    30def Equivalent {B : RankedSet} (E : Algebra B) {n : ℕ}
    31 (S T : RankedSystems.System B n) : Prop := profile E S = profile E T
    32
    33abbrev Carrier {B : RankedSet} (E : Algebra B) : RankedSet :=
    34 fun n => Quot (@Equivalent B E n)
    35
    36def classMap {B : RankedSet} (E : Algebra B) : RankedSystems.RankedMap (RankedSystems.System B) (Carrier E) :=
    37 fun _ => Quot.mk _
    38
    39axiom profile_nonempty {B : RankedSet} (E : Algebra B) {n : ℕ}
    40 (S : RankedSystems.System B n) : (profile E S).Nonempty
    41
    42axiom finite_observations {B : RankedSet} (hB : RankwiseFinite B) (n : ℕ) :
    43 Finite (Observation B n)
    44
    45axiom finite_carrier {B : RankedSet} (E : Algebra B) (hB : RankwiseFinite B) :
    46 RankwiseFinite (Carrier E)
    47
    48axiom 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
    54axiom 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
    59axiom 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
    63end Lax369799.SupportEvaluation
    64
    65
    Show ProofShow ProofShow ProofShow ProofShow ProofShow Proof

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above.

    Loading discussion…