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

Majority intersections in the cyclic tag geometry

Lax342547.TagGeometry · concepts/Lax342547/TagGeometry.lean · lax-342547

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

    Lemma

    For g=2k+1g=2k+1, the tag ll allows the block Od,tO_{d,t} exactly when l∈{d+1,…,d+k}l\in\{d+1,\ldots,d+k\}. The other three blocks are unrestricted. The intersection over more than kk tags is the all-OO-zero moment space, as asserted in the first part of Lemma 2.3.

    Concept map
    3 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 Lax342547.CutProfiles
    2import Mathlib.Data.ZMod.Basic
    3
    4/-!
    5---
    6title: Majority intersections in the cyclic tag geometry
    7type: lemma
    8---
    9For g=2k+1g=2k+1, the tag ll allows the block Od,tO_{d,t} exactly when
    10l∈{d+1,…,d+k}l\in\{d+1,\ldots,d+k\}. The other three blocks are unrestricted.
    11The intersection over more than kk tags is the all-OO-zero moment
    12space, as asserted in the first part of Lemma 2.3.
    13-/
    14
    15namespace Lax342547.TagGeometry
    16
    17open Lax342547.MomentSpace
    18
    19abbrev Tag (k : ℕ) := ZMod (2 * k + 1)
    20
    21def interval (k : ℕ) (d : Tag k) : Finset (Tag k) :=
    22 Finset.univ.image (fun i : Fin k => d + (i.val + 1 : ℕ))
    23
    24abbrev Base (k n : ℕ) := ((Tag k × Tag k) × Fin n) ⊕ (Fin 3 × Fin n)
    25
    26def allowedBase (k n : ℕ) (l : Tag k) : Set (Base k n)
    27 | Sum.inl ((d, _), _) => l ∈ interval k d
    28 | Sum.inr _ => True
    29
    30def commonBase (k n : ℕ) : Set (Base k n)
    31 | Sum.inl _ => False
    32 | Sum.inr _ => True
    33
    34axiom majority_intersection {Label Coord : Type} (k n : ℕ)
    35 (p : Label → Coord → Binary) (S : Finset (Tag k)) (hS : k < S.card) :
    36 (⨅ l : {l // l ∈ S}, momentSpace p (allowedBase k n l.val)) =
    37 momentSpace p (commonBase k n)
    38
    39end Lax342547.TagGeometry
    40
    Show Proof

    Discussion

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

    Loading discussion…