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

Bounded allowed derivatives preserving the actual linearized response

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

    Sections of the observed baseline pairings compress derivative outputs inside their original perpendicular value spaces. The two actual derivative families retain their barred domain quotients, preserve the whole response, and have rank at most 3K+28 in an actual recipe solution. The residual matrix rank, pure correction and final channel factorization remain separate.

    Concept map
    75 concepts
    100%
    Exact-image bounds for independent affinecolumnsOrdered atom products in the actualgradient formPoint atoms and finite flavor distributionsSparse unselected primal vectors in barredspaces lie in the pinsBarred response spaces and the actualobstruction rank budgetThe exact space of binary base momentsRank control for the frozen baseline onprimal inputsFormal ordered product bits realizesymmetric correctionsBounded allowed derivatives preserving theactual linearized responseAllowed channel changes and the actual tableinjection testsConcrete 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 kernelThe full linearized response on pairs ofactual cut profilesFull response obstructions are effectiveprofiles plus selected atomsExact 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 columnsBaseline contractions on the selected atomsThe 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 basecoordinatesThe 3K+28 baseline bound in the actualnominal coordinatesPrimal 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 basecoefficientsSparse residual contractions belong to theactual primal pinsRetractions 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 quotientspacesBounded baselines for both actual crossorientationsActual frame observations realize thenominal channel contractionsRaw matrix frames and their tensorrealizationThe finite uniform raw-vertex lawGradient residuals vanish on effective profilesand selected atomsCoupled scalar recipes give consistent atomgradientsJoint reference image caps across both signsand all drawsThe full reference cap for exact pin eventsRemoving selected atoms leaves onlyunselected component labelsUnrestricted linearized solutions for actualscalar recipesRank loss under restriction of a bilinear formSelected tensor blocks of actual pureobstructionsA selected affine ray determines its momentblockSubtracting selected atoms preserves pureannihilationSelected label coefficients agree across thecut profileInterpolation of finitely many binary selectorlabelsNumerical cross tables, injection flags, andunary admissibilityUnselected sparse vectors cannot concealfresh key coefficientsA 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 7 statements. Each proof establishes one of them relative to its assumptions.

    Lean source view on GitHub

    1import Lax342547.ResponseSolvability
    2import Mathlib.LinearAlgebra.Dimension.LinearMap
    3
    4/-!
    5---
    6title: Bounded allowed derivatives preserving the actual linearized response
    7type: theorem
    8---
    9Sections of the observed baseline pairings compress derivative outputs
    10inside their original perpendicular value spaces. The two actual derivative
    11families retain their barred domain quotients, preserve the whole response,
    12and have rank at most 3K+28 in an actual recipe solution. The residual matrix
    13rank, pure correction and final channel factorization remain separate.
    14-/
    15
    16namespace Lax342547.BoundedDerivatives
    17
    18open Lax342547.MomentSpace
    19open Lax342547.ChannelChanges
    20open Lax342547.PairedAnnihilators Lax342547.TableSpaces Lax342547.TableContractions
    21open Lax342547.DerivativeResponses Lax342547.NominalPrimal Lax342547.TensorAnnihilators
    22open Lax342547.BarredSpaces
    23open Lax342547.TagGeometry Lax342547.ConcreteGeometry Lax342547.ConcreteCut
    24open Lax342547.CutProfiles Lax342547.ExactPins Lax342547.PairedWitnesses Lax342547.RawBaselines
    25open Lax342547.PairedRecipes Lax342547.PinLabelExclusions
    26
    27axiom observed_projection {V X : Type} [AddCommGroup V] [Module Binary V]
    28 [AddCommGroup X] [Module Binary X] [FiniteDimensional Binary V]
    29 (L : V →ₗ[Binary] X) :
    30 ∃ p : V →ₗ[Binary] V, L.comp p = L ∧
    31 Module.finrank Binary (LinearMap.range p) ≤ Module.finrank Binary (LinearMap.range L)
    32
    33axiom allowed_projection {H X : Type} [Fintype H]
    34 [AddCommGroup X] [Module Binary X] [FiniteDimensional Binary X]
    35 (S : Submodule Binary (H → Binary)) (G : X →ₗ[Binary] (H → Binary)) :
    36 ∃ p : perpendicular S →ₗ[Binary] perpendicular S,
    37 (∀ c x, dotProduct (p c).val (G x) = dotProduct c.val (G x)) ∧
    38 Module.finrank Binary (LinearMap.range p) ≤ Module.finrank Binary (LinearMap.range G)
    39
    40axiom bounded_derivative {D H X : Type} [AddCommGroup D] [Module Binary D]
    41 [Fintype H] [AddCommGroup X] [Module Binary X] [FiniteDimensional Binary X]
    42 (S : Submodule Binary (H → Binary)) (G : X →ₗ[Binary] (H → Binary))
    43 (δ : D →ₗ[Binary] perpendicular S) :
    44 ∃ δ' : D →ₗ[Binary] perpendicular S,
    45 (∀ v x, dotProduct (δ' v).val (G x) = dotProduct (δ v).val (G x)) ∧
    46 Module.finrank Binary (LinearMap.range δ') ≤ Module.finrank Binary (LinearMap.range G)
    47
    48axiom bounded_derivative_covectors {D H X : Type} [AddCommGroup D] [Module Binary D]
    49 [Fintype H] [DecidableEq H] [AddCommGroup X] [Module Binary X] [FiniteDimensional Binary X]
    50 (S : Submodule Binary (H → Binary)) (C : X →ₗ[Binary] Module.Dual Binary (H → Binary))
    51 (δ : D →ₗ[Binary] perpendicular S) :
    52 ∃ δ' : D →ₗ[Binary] perpendicular S,
    53 (∀ v x, dotProduct (δ' v).val (Lax342547.TensorAnnihilators.dualCoordinates (C x)) =
    54 dotProduct (δ v).val (Lax342547.TensorAnnihilators.dualCoordinates (C x))) ∧
    55 Module.finrank Binary (LinearMap.range δ') ≤ Module.finrank Binary (LinearMap.range C)
    56
    57axiom bounded_component {Comp B H : Type} [Fintype B] [Fintype H]
    58 (F : CrossForms Comp B H) (e : Comp) (z : Fin 2)
    59 (D E : Submodule Binary (Nominal B H)) (S T : Submodule Binary (H → Binary))
    60 (R : ℕ)
    61 (hplus : Module.finrank Binary (LinearMap.range ((F.forward e).compl₁₂
    62 (primal (B := B) (H := H)).subtype (channelEmbedding z))) ≤ R)
    63 (hminus : Module.finrank Binary (LinearMap.range ((F.reverse e).flip.compl₁₂
    64 (primal (B := B) (H := H)).subtype (channelEmbedding z))) ≤ R)
    65 (δ : (Nominal B H ⧸ D) →ₗ[Binary] perpendicular S)
    66 (ε : (Nominal B H ⧸ E) →ₗ[Binary] perpendicular T) :
    67 ∃ δ' ε', componentResponse F e z D E S T δ' ε' = componentResponse F e z D E S T δ ε ∧
    68 Module.finrank Binary (LinearMap.range δ') ≤ R ∧
    69 Module.finrank Binary (LinearMap.range ε') ≤ R
    70
    71axiom bounded_response {k n b degree r K : ℕ} {hr : 2 * r ≤ n} {H N : Type} [Fintype H]
    72 (W : Lists k n b degree r hr)
    73 (P Q : Pin (Component (Tag k) × Bool) (Fin 2 × (Coordinate k n b degree ⊕ H)) N)
    74 (U V : Component (Tag k) → Fin 2 → Submodule Binary (H → Binary))
    75 (F : CrossForms (Component (Tag k)) (Coordinate k n b degree) H) (hF : Bounded F K) (z : Fin 2)
    76 (δ : PlusParameters W P Q U z) (ε : MinusParameters W P Q V z) :
    77 ∃ δ' ε', response W P Q U V F z δ' ε' = response W P Q U V F z δ ε ∧
    78 ∀ e, Module.finrank Binary (LinearMap.range (δ' e)) ≤ 3 * K + 28 ∧
    79 Module.finrank Binary (LinearMap.range (ε' e)) ≤ 3 * K + 28
    80
    81axiom bounded_recipe_solution {H N : Type} [Fintype H] [Fintype N] {k n b degree r K : ℕ} {hr : 2 * r ≤ n} {E : Moment k n b degree}
    82 (hk : 0 < k) (W : Lists k n b degree r hr)
    83 (D : Testers (k := k) (b := b) (degree := degree) hr) {copies : ℕ}
    84 (L R : Fin copies → Component (Tag k) → Component (Tag k) → Moment k n b degree)
    85 (oA oB : Unit (H := H) (N := N) (E := E))
    86 (P Q : Pin (Component (Tag k) × Bool) (Fin 2 × (Coordinate k n b degree ⊕ H)) N)
    87 (hK : P.rank ≤ K) (A B : Fin 2 → Finset (Fin b → Binary)) (hA : Covers P A (2 * K + 28))
    88 (hfresh : ∀ i z t, (W.left i z t).label ∉ A i)
    89 (U V : Component (Tag k) → Fin 2 → Submodule Binary (H → Binary))
    90 (hU : ∀ e j, IsCompl (protectedChannel P j (e, true)) (U e j))
    91 (hV : ∀ e j, IsCompl (protectedChannel P j (e, false)) (V e j))
    92 (T : Lax342547.SmallTables.Table P Q) (hT : Lax342547.SmallTables.Injecting T)
    93 (F : CrossForms (Component (Tag k)) (Coordinate k n b degree) H) (hF : Extends F T) (hbounded : Bounded F K)
    94 (hrecipe : ScalarRecipe W D L R oA oB T A B)
    95 (hfrozen : Frozen F W P Q oA oB) (hkeys : MatchedKeys W oA oB)
    96 (hgradients : ∀ i, Lax342547.ConcreteRecipes.RecipeGradients D L R (endpointAtoms W i) (oppositeP W oB i))
    97 (hdegree : 6 * (2 * K + 28) + 4 ≤ degree) (z : Fin 2) :
    98 ∃ (β : Lax342547.PureObstructions.Parameters W P U V)
    99 (δ : PlusParameters W P Q U z) (ε : MinusParameters W P Q V z), fullResponse W P Q U V F z β δ ε =
    100 ∑ i, (Lax342547.RecipeResiduals.residual W D L R F i z).comp (LinearMap.proj i) ∧
    101 ∀ e, Module.finrank Binary (LinearMap.range (δ e)) ≤ 3 * K + 28 ∧
    102 Module.finrank Binary (LinearMap.range (ε e)) ≤ 3 * K + 28
    103
    104end Lax342547.BoundedDerivatives
    105
    Show ProofShow ProofShow 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…