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

Factoring out unused output variables

Lax369799.SupportCompaction · concepts/Lax369799/SupportCompaction.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

    Every deterministic presentation is an injective renaming of a system whose output variables all occur. Renaming a fully supported system has full support precisely when the variable map is surjective.

    Concept map
    10 concepts
    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.SupportedSystems
    2
    3/-!
    4---
    5title: Factoring out unused output variables
    6type: theorem
    7---
    8Every deterministic presentation is an injective renaming of a system
    9whose output variables all occur. Renaming a fully supported system has
    10full support precisely when the variable map is surjective.
    11-/
    12
    13namespace Lax369799.SupportCompaction
    14open RankedSystems Renaming Resolutions
    15
    16axiom compact_exists {A : RankedSet} {n : ℕ} (S : RankedSystems.System A n) :
    17 ∃ (m : ℕ) (σ : Fin m → Fin n) (T : SupportedSystems.System A m),
    18 Function.Injective σ ∧ renameSystem σ T.val = S
    19
    20axiom rename_supported_iff {A : RankedSet} {m n : ℕ} (σ : Fin m → Fin n)
    21 (T : SupportedSystems.System A m) :
    22 SupportedSystems.FullySupported (renameSystem σ T.val) ↔ Function.Surjective σ
    23
    24axiom rename_set_injective {A : RankedSet} {m n : ℕ} (σ : Fin m → Fin n)
    25 (hσ : Function.Injective σ) : Function.Injective (@Resolutions.rename A m n σ)
    26
    27axiom rename_system_injective {A : RankedSet} {m n : ℕ} (σ : Fin m → Fin n)
    28 (hσ : Function.Injective σ) : Function.Injective (@renameSystem A m n σ)
    29
    30axiom support_image {A : RankedSet} {m n : ℕ} (σ : Fin m → Fin n)
    31 (T : SupportedSystems.System A m) (j : Fin n) :
    32 (∃ v d, (renameSystem σ T.val).val.graph.edge v d (.inr j)) ↔ j ∈ Set.range σ
    33
    34axiom compact_unique {A : RankedSet} {m k n : ℕ}
    35 (σ : Fin m → Fin n) (τ : Fin k → Fin n)
    36 (hσ : Function.Injective σ) (hτ : Function.Injective τ)
    37 (S : SupportedSystems.System A m) (T : SupportedSystems.System A k)
    38 (h : renameSystem σ S.val = renameSystem τ T.val) :
    39 ∃ e : Fin m ≃ Fin k, (∀ i, τ (e i) = σ i) ∧ renameSystem e S.val = T.val
    40
    41end Lax369799.SupportCompaction
    42
    Show ProofShow ProofShow ProofShow ProofShow ProofShow Proof
    Builds on
    Used by

    none

    From Mathlib

    none

    Discussion

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

    Loading discussion…