Lax Lean Archive

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

Inverse-polynomial tiny-cover compatibility

Lax342547.TinyCompatibility · concepts/Lax342547/TinyCompatibility.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 actual binary pairing kernel of rank at most dN has compatible pair mass at least 1/(4(1+d*N)^4) under any finite probability law with zero diagonal.

    Concept map
    116 concepts; 1 descendant 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 responseActual-mass averaging over retainedrecord-cell pairsSimultaneous assembly of opposite endpointsand reciprocal unit rolesAllowed channel changes and the actual tableinjection testsRank-controlled factorization throughallowed orthogonal channelsPruning small unary record cellsA 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 plusframeExact conditioning costs and recovery offinite probability massesCompression that fixes pin/key vectors andpreserves target matricesEntropy progress for residual pair lawsIndependence of distinct sample positionsCut profiles and the constant kernelThe full linearized response on pairs ofactual cut profilesDisjoint pair exception tailsFull response obstructions are effectiveprofiles plus selected atomsEntropy along feasible mixture lines,including new supportFull feasible support and finite informationprojectionExact image pins in nominal coefficientspacesFinite linear images and their uniform-lawdensity boundsFinite independent sampling and vertexexception tailsActual gradient agreement and matched keysproduce all four cross holesAmbient symmetries and frame marginalsFresh key directions are independent modulotable spacesThe simultaneous gradient corrections retainevery frozen pin and key entryBaseline bilinear extensions retaining allfrozen rows and columnsWhole-space gradient realization preservingthe actual frozen entriesBaseline contractions on the selected atomsAll four whole-space gradient equations fromassembled channel changesThe symmetric binary gradient formDeterministic whole-space gradientrealization from the genuine recipehypothesesGram-conditioned columns and theirrank-failure probabilityTwo-sided Gram normalization forindividually injective framesEntrywise product rank and incompatibletuplesThe binary hole relationPaying the reference-image conditioning anddimension costsUniform injective frames and channeltranspose failureAccepted key subprobabilities and uniformoverlapFresh 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 partPure corrections realized by actual nonlinearchannel productsWeighted compatibility from inevitablesample pairsSquared restriction cost for independent uniteventsEndpoint 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 pinsFinite primal-channel records with the paperbit count and four-hole implicationRetractions 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 cutprofilesWalsh bounds for independent image lawsand separated phasesCompression on the actual barred nominalquotientsExtracting fresh label coefficients throughpin quotientsRank of a tensor killed in two quotientspacesFull rank coefficient factorizationsRank-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 lawOriginal retained-cell laws from finite PMFsNonlinear channel realization of the actualwhole-space recipe residualGradient 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 eventsFinite relative entropy and support costsRemoving 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 formImage caps inside original retained cellsSelected 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 taggeometryExplicit low-rank matrices for thewhole-space gradient targetThe fifteen-rank witness tester targetPure bilinear responses detect quotienttensorsQuotient extractors isolate individual tensorlabel blocksWell-defined channel contractions onprojected tensor spacesInverse-polynomial tiny-cover compatibilityAdmissible pair lawsOrthogonality and finite Walsh correlationboundsWitness atoms and their numerical testerrecords
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

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

    1 tiny_compatible_mass proven

    2 tiny_compatible_mass_rank_bound proven

    Lean source view on GitHub

    1import Lax342547.HadamardRank
    2import Lax342547.PairPositions
    3
    4/-!
    5---
    6title: Inverse-polynomial tiny-cover compatibility
    7type: lemma
    8---
    9The actual binary pairing kernel of rank at most d*N has compatible pair mass at least 1/(4*(1+d*N)^4) under any finite probability law with zero diagonal.
    10-/
    11
    12namespace Lax342547.TinyCompatibility
    13
    14open Lax342547.MomentSpace Lax342547.RelativeEntropy Lax342547.CellAveraging
    15
    16axiom tiny_compatible_mass {Ω : Type} [Fintype Ω] [DecidableEq Ω]
    17 (μ : Ω → ℝ) (F : Matrix Ω Ω Binary) (hμ : Probability μ) (hdiag : ∀ a, F a a = 0) :
    18 1/(((1+F.rank)^2+1 : ℕ) : ℝ)^2 ≤ pairEventMass μ μ (fun a b => F a b = 0 ∧ F b a = 0)
    19
    20axiom tiny_compatible_mass_rank_bound {Ω : Type} [Fintype Ω] [DecidableEq Ω]
    21 (μ : Ω → ℝ) (F : Matrix Ω Ω Binary) (d N : ℕ)
    22 (hμ : Probability μ) (hdiag : ∀ a, F a a = 0) (hrank : F.rank ≤ d*N) :
    23 1/(4*(1+(d : ℝ)*N)^4) ≤ pairEventMass μ μ (fun a b => F a b = 0 ∧ F b a = 0)
    24
    25end Lax342547.TinyCompatibility
    26
    Show ProofShow 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…