Lax Lean Archive

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

Actual query keys independent modulo old pins

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

proven

Loading review…

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

    The incident selected rays in the actual four witness lists are independent modulo the combined nominal pins. The proof uses the existing indexed fresh-label exclusion, with fourteen distinct rays per endpoint.

    Concept map
    88 concepts; 9 descendants hidden
    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 budgetCompression preserving allowed pointmoments and the actual cut domainThe 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 testsRank-controlled factorization throughallowed orthogonal channelsA bounded-rank pure correction for theactual scalar recipeConcrete 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 plusframeCompression that fixes pin/key vectors andpreserves target matricesCut 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 cutprofilesActual query keys independent modulo oldpinsReference keys and matched keys for actualpaired listsThe actual paired-list key slot budgetCompression on the actual barred nominalquotientsExtracting fresh label coefficients throughpin quotientsRank of a tensor killed in two quotientspacesRank-controlled pure forms on the actualbarred quotientsBounded 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 drawsConstrained key reference spaces havepositive densityThe full reference cap for exact pin eventsRemoving selected atoms leaves onlyunselected component labelsThe bounded pure remainder of an actualscalar recipeMatrix representations and the boundedresidual rank ingredientsUnrestricted 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 pinvectorsLow-rank tester routing along tag starsConsistent 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 A
    Evidence

    Each proof establishes this claim relative to its assumptions.

    Lean source view on GitHub

    1import Lax342547.QueryReference
    2import Lax342547.PairedKeys
    3import Lax342547.KeySpans
    4import Lax342547.TableSpaces
    5
    6/-!
    7---
    8title: Actual query keys independent modulo old pins
    9type: lemma
    10---
    11The incident selected rays in the actual four witness lists are independent modulo the combined nominal pins. The proof uses the existing indexed fresh-label exclusion, with fourteen distinct rays per endpoint.
    12-/
    13
    14namespace Lax342547.QueryIndependence
    15
    16open Lax342547.MomentSpace Lax342547.TagGeometry Lax342547.CutProfiles
    17open Lax342547.PairedWitnesses Lax342547.QueryReference Lax342547.QuerySlots
    18open Lax342547.PairedKeys Lax342547.KeySpans Lax342547.TableSpaces Lax342547.ExactPins
    19open Lax342547.ConcreteGeometry
    20
    21noncomputable def keyMap {k n b degree r : ℕ} {hr : 2 * r ≤ n} {H : Type}
    22 (W : Lists k n b degree r hr) (e : Component (Tag k)) :
    23 (ComponentPosition W e → Binary) →ₗ[Binary] ((Fin 2 × (Coordinate k n b degree ⊕ H)) → Binary) := by
    24 classical
    25 exact
    26 { toFun := fun c => ∑ p, c p • ray (H := H) (degree := degree) (labels W) (bases W) p.val
    27 map_add' := by intro c d; simp [add_smul, Finset.sum_add_distrib]
    28 map_smul' := by intro s c; simp [Finset.smul_sum, smul_smul] }
    29
    30axiom actual_key_independence {k n b degree r : ℕ} {hr : 2 * r ≤ n} {H N : Type}
    31 (W : Lists k n b degree r hr)
    32 (P : Pin (Component (Tag k) × Bool) (Fin 2 × (Coordinate k n b degree ⊕ H)) N)
    33 (A : Fin 2 → Finset (Fin b → Binary)) (hA : Excludes P A)
    34 (hfresh : ∀ i z t, (W.left i z t).label ∉ A i) (a : Component (Tag k) × Bool) :
    35 Function.Injective ((P.space a).mkQ.comp (keyMap (H := H) W a.1))
    36
    37end Lax342547.QueryIndependence
    38
    Show Proof
    Builds on
    Used by
    From Mathlib

    none

    Discussion

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

    Loading discussion…