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

Well-defined cut functionals

Lax342547.CutFunctionals · concepts/Lax342547/CutFunctionals.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

    Theorem

    A tester vanishing on the common kernel gives a well-defined sum over all representative values. For an odd number of tags, summing any tester over all tags except a fixed one is also well-defined. These are precisely the two descent arguments for at,a,bta_t,a,b_t in (2.7).

    Concept map
    3 concepts
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

    Each proof establishes this claim relative to its assumptions.

    Lean source view on GitHub

    1import Lax342547.CutProfiles
    2import Mathlib.Algebra.Ring.Parity
    3
    4/-!
    5---
    6title: Well-defined cut functionals
    7type: theorem
    8---
    9A tester vanishing on the common kernel gives a well-defined sum over
    10all representative values. For an odd number of tags, summing any
    11tester over all tags except a fixed one is also well-defined. These
    12are precisely the two descent arguments for at,a,bta_t,a,b_t in (2.7).
    13-/
    14
    15namespace Lax342547.CutFunctionals
    16
    17open Lax342547.MomentSpace Lax342547.CutProfiles
    18
    19axiom representative_sums_eq {Tag V : Type} [Fintype Tag] [DecidableEq Tag]
    20 [Nonempty Tag] [AddCommGroup V] [Module Binary V]
    21 (W : Tag → Submodule Binary V) (ηO ηS : V →ₗ[Binary] Binary)
    22 (hO : ∀ c ∈ ⨅ t, W t, ηO c = 0) (hodd : Odd (Fintype.card Tag))
    23 (w v : Tag → V) (hw : ∀ t, w t ∈ W t) (hv : ∀ t, v t ∈ W t)
    24 (heq : cutMap w = cutMap v) :
    25 (∑ t, ηO (w t)) = (∑ t, ηO (v t)) ∧
    26 ∀ t, (∑ l ∈ Finset.univ.erase t, ηS (w l)) =
    27 ∑ l ∈ Finset.univ.erase t, ηS (v l)
    28
    29end Lax342547.CutFunctionals
    30
    Show Proof
    Builds on
    Used by

    none

    From Mathlib

    Discussion

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

    Loading discussion…