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

Unary normal form of deterministic elements

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

    In a set-algebra, every deterministic element of positive rank is a parallel family of unary values, one at each variable. This is the characterization in the earlier draft. The set-algebra hypothesis includes continuity; it is not implicit in an arbitrary substitution algebra. DirectionProjections proves the revised canonical decomposition for extremal elements without that continuity hypothesis.

    Concept map
    9 concepts
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on ADescendants are omitted for concepts with more than 10 descendants.
    Evidence

    Each proof establishes this claim relative to its assumptions.

    Lean source view on GitHub

    1import Lax369799.AutomatonProperty
    2import Lax369799.UnarySystems
    3
    4/-!
    5---
    6title: Unary normal form of deterministic elements
    7type: theorem
    8---
    9In a set-algebra, every deterministic element of positive rank is a
    10parallel family of unary values, one at each variable. This is the
    11characterization in the earlier draft. The set-algebra hypothesis includes
    12continuity; it is not implicit in an arbitrary substitution algebra.
    13DirectionProjections proves the revised canonical decomposition for
    14extremal elements without that continuity hypothesis.
    15-/
    16namespace Lax369799.DeterministicElements
    17open RankedSystems SetAlgebras AutomatonProperty
    18
    19/-- Retain a chosen variable and rename it to the sole output variable. -/
    20def projection {A : RankedSet} {n : ℕ} (S : SetSystem A n) (i : Fin n) : SetSystem A 1 where
    21 size := S.size
    22 graph := {
    23 label := S.graph.label
    24 initial := S.graph.initial
    25 root := S.graph.root
    26 edge := fun v d t => S.graph.edge v d (Sum.map id (fun _ => i) t)
    27 direction_valid := fun v d _t h => S.graph.direction_valid v d _ h }
    28 reachable := S.reachable
    29
    30/-- The disjoint unary letters b_i, with each sole edge going to x_i. -/
    31def parallel {A : RankedSet} {n : ℕ} (b : Fin n → A 1) : SetSystem A n where
    32 size := n
    33 graph := {
    34 label := fun v => ⟨1, b v⟩
    35 initial := Set.univ
    36 root := ∅
    37 edge := fun v d t => d = 0 ∧ t = .inr v
    38 direction_valid := by rintro v d t ⟨rfl, _⟩; exact Nat.zero_lt_one }
    39 reachable := fun v => ⟨v, Or.inl trivial, .refl⟩
    40
    41axiom unary_normal_form {A : RankedSet} (E : SetAlgebra A) {n : ℕ} (hn : 0 < n)
    42 (a : A n) : Deterministic E a ↔ ∃ b : Fin n → A 1, E.eval n (parallel b) = a
    43
    44end Lax369799.DeterministicElements
    45
    Show Proof

    Discussion

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

    Loading discussion…