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

Selected label coefficients agree across the cut profile

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

    The three-edge cut relation separates by label. A coefficient supported on one tag star consequently has one scalar on the entire star. Applying the selected-block theorem to actual pure obstructions yields a single scalar multiple of each selected point atom.

    Concept map
    61 concepts
    100%
    Exact-image bounds for independent affinecolumnsOrdered atom products in the actualgradient formPoint atoms and finite flavor distributionsBarred response spaces and the actualobstruction rank budgetThe exact space of binary base momentsRank control for the frozen baseline onprimal inputsFormal ordered product bits realizesymmetric correctionsConcrete cut-space testers and the orderedmixer formConcrete coordinates, quadratic testers, andthe self-Gram formNumerical recipes prescribe the concretegradients on witness atomsThe affine minus-column law at a fixed plusframeCut profiles and the constant kernelExact image pins in nominal coefficientspacesFinite linear images and their uniform-lawdensity boundsAmbient symmetries and frame marginalsFresh key directions are independent modulotable spacesBaseline bilinear extensions retaining allfrozen rows and columnsThe symmetric binary gradient formGram-conditioned columns and theirrank-failure probabilityTwo-sided Gram normalization forindividually injective framesThe binary hole relationPaying the reference-image conditioning anddimension costsUniform injective frames and channeltranspose failureFresh point-ray spans are disjoint from thenominal table spacesLow-rank Boolean moments have boundedlabel supportTriangle relations separate into individuallabel blocksBoolean point moments with restricted basecoordinatesPrimal blocks of the nominal spaces andtheir bounded table partEndpoint projections of paired pure-responseannihilatorsActual paired-witness key spaces satisfy thebaseline hypothesesBinary prescriptions at all endpoints of apaired scalar recipeFull paired witness lists and scalar recipeequationsSparse pin exclusions with arbitrary basecoefficientsRetractions with bounded rank on theprimal inputsExact images mixing independent injectiveframesJoint minus images after exposing severalplus framesPrimal projections and preservation ofeffective spacesPure obstructions on the actual pair of cutprofilesExtracting fresh label coefficients throughpin quotientsRank of a tensor killed in two quotientspacesActual frame observations realize thenominal channel contractionsRaw matrix frames and their tensorrealizationThe finite uniform raw-vertex lawCoupled scalar recipes give consistent atomgradientsJoint reference image caps across both signsand all drawsThe full reference cap for exact pin eventsRank loss under restriction of a bilinear formSelected tensor blocks of actual pureobstructionsA selected affine ray determines its momentblockSelected label coefficients agree across thecut profileInterpolation of finitely many binary selectorlabelsNumerical cross tables, injection flags, andunary admissibilityA uniform label budget for all sparse pinvectorsConsistent symmetric binary prescriptions ontwo witness listsTable contractions on effective profiles andtheir full extensionsTable coordinates and private channelcomplementsMajority intersections in the cyclic taggeometryPure bilinear responses detect quotienttensorsQuotient extractors isolate individual tensorlabel blocksWell-defined channel contractions onprojected tensor spacesWitness atoms and their numerical testerrecords
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on ADescendants are omitted for concepts with more than 10 descendants.
    Evidence

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

    Lean source view on GitHub

    1import Lax342547.SelectedBlocks
    2import Lax342547.LabelRelations
    3
    4/-!
    5---
    6title: Selected label coefficients agree across the cut profile
    7type: theorem
    8---
    9The three-edge cut relation separates by label. A coefficient supported
    10on one tag star consequently has one scalar on the entire star. Applying
    11the selected-block theorem to actual pure obstructions yields a single
    12scalar multiple of each selected point atom.
    13-/
    14
    15namespace Lax342547.SelectedScalars
    16
    17open Lax342547.MomentSpace Lax342547.TagGeometry Lax342547.ConcreteGeometry
    18open Lax342547.ConcreteCut Lax342547.CutProfiles Lax342547.PairedWitnesses
    19open Lax342547.ExactPins Lax342547.PinLabelExclusions Lax342547.BaseMoments
    20open Lax342547.LabelRelations Lax342547.TensorBlocks
    21
    22axiom profile_triangle {k n b degree R : ℕ} (x : Profile k n b degree)
    23 (L : Component (Tag k) → Finset (Fin b → Binary))
    24 (Z : Component (Tag k) → (Fin b → Binary) → Matrix (Option (Base k n)) (Option (Base k n)) Binary)
    25 (hL : ∀ e, (L e).card ≤ R) (hdegree : 3 * R ≤ degree + 1)
    26 (hM : ∀ e, x.val e = ∑ s ∈ L e, block selectorEval s (Z e s))
    27 (a b c : Tag k) (hab : a ≠ b) (hbc : b ≠ c) (hac : a ≠ c) :
    28 ∀ s, supported (L (edge a b hab)) (Z (edge a b hab)) s +
    29 supported (L (edge b c hbc)) (Z (edge b c hbc)) s +
    30 supported (L (edge a c hac)) (Z (edge a c hac)) s = 0
    31
    32axiom star_scalar {Tag : Type} [DecidableEq Tag] [Nontrivial Tag]
    33 (l : Tag) (c : Component Tag → Binary)
    34 (htriangle : ∀ a b d (hab : a ≠ b) (hbd : b ≠ d) (had : a ≠ d),
    35 c (edge a b hab) + c (edge b d hbd) + c (edge a d had) = 0)
    36 (hout : ∀ e, l ∉ e.val → c e = 0) :
    37 ∃ v : Binary, ∀ e, c e = if l ∈ e.val then v else 0
    38
    39axiom selected_scalar {k n b degree R : ℕ} (hk : 0 < k) (x : Profile k n b degree)
    40 (L : Component (Tag k) → Finset (Fin b → Binary))
    41 (Z : Component (Tag k) → (Fin b → Binary) → Matrix (Option (Base k n)) (Option (Base k n)) Binary)
    42 (hL : ∀ e, (L e).card ≤ R) (hdegree : 3 * R ≤ degree + 1)
    43 (hM : ∀ e, x.val e = ∑ s ∈ L e, block selectorEval s (Z e s))
    44 (s : Fin b → Binary) (l : Tag k) (z : Base k n → Binary)
    45 (hshape : ∀ e, supported (L e) (Z e) s = if l ∈ e.val then
    46 (supported (L e) (Z e) s) none none • baseMoment z else 0) :
    47 ∃ v : Binary, ∀ e, supported (L e) (Z e) s = if l ∈ e.val then v • baseMoment z else 0
    48
    49axiom obstruction_scalar {k n b degree r R : ℕ} {hr : 2 * r ≤ n} {H N : Type}
    50 (hk : 0 < k) (W : Lists k n b degree r hr)
    51 (P : Pin (Component (Tag k) × Bool) (Fin 2 × (Coordinate k n b degree ⊕ H)) N)
    52 (A : Fin 2 → Finset (Fin b → Binary)) (hA : Covers P A R)
    53 (U V : Component (Tag k) → Fin 2 → Submodule Binary (H → Binary))
    54 (x : Fin 2 → Profile k n b degree) (h : Lax342547.PureObstructions.Annihilates W P U V x)
    55 (i : Fin 2) (L : Component (Tag k) → Finset (Fin b → Binary))
    56 (Z : Component (Tag k) → (Fin b → Binary) → Matrix (Option (Base k n)) (Option (Base k n)) Binary)
    57 (hL : ∀ e, (L e).card ≤ R) (hdegree : 3 * R ≤ degree + 1)
    58 (hM : ∀ e, (x i).val e = ∑ s ∈ L e, block selectorEval s (Z e s))
    59 (hZ : ∀ e s, s ∈ L e → IsBaseMoment (Z e s))
    60 (u : Σ z, Fin (W.length i z)) (hfresh : (W.left i u.1 u.2).label ∉ A i) :
    61 ∃ v : Binary, ∀ e, supported (L e) (Z e) (W.left i u.1 u.2).label =
    62 if (W.left i u.1 u.2).tag ∈ e.val then v • baseMoment (W.left i u.1 u.2).base else 0
    63
    64axiom selected_decomposition {k n b degree r K : ℕ} {hr : 2 * r ≤ n} {H N : Type}
    65 [Fintype H] (hk : 0 < k) (W : Lists k n b degree r hr)
    66 (P : Pin (Component (Tag k) × Bool) (Fin 2 × (Coordinate k n b degree ⊕ H)) N)
    67 (hK : P.rank ≤ K) (A : Fin 2 → Finset (Fin b → Binary))
    68 (hA : Covers P A (2 * K + 28))
    69 (hfresh : ∀ i z t, (W.left i z t).label ∉ A i)
    70 (U V : Component (Tag k) → Fin 2 → Submodule Binary (H → Binary))
    71 (x : Fin 2 → Profile k n b degree) (h : Lax342547.PureObstructions.Annihilates W P U V x)
    72 (hdegree : 6 * (2 * K + 28) + 4 ≤ degree) (i : Fin 2) :
    73 ∃ L : Component (Tag k) → Finset (Fin b → Binary),
    74 ∃ Z : Component (Tag k) → (Fin b → Binary) → Matrix (Option (Base k n)) (Option (Base k n)) Binary,
    75 ∃ c : (Σ z, Fin (W.length i z)) → Binary,
    76 (∀ e, (L e).card ≤ 2 * K + 28 ∧ (∀ s ∈ L e, IsBaseMoment (Z e s)) ∧
    77 (∑ s ∈ L e, (Z e s).rank) ≤ 2 * K + 28 ∧
    78 ∀ a d, (x i).val e a d = ∑ s ∈ L e,
    79 selectorEval s a.1 * selectorEval s d.1 * Z e s a.2 d.2) ∧
    80 ∀ u e, supported (L e) (Z e) (W.left i u.1 u.2).label =
    81 if (W.left i u.1 u.2).tag ∈ e.val then c u • baseMoment (W.left i u.1 u.2).base else 0
    82
    83end Lax342547.SelectedScalars
    84
    Show 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…