Lax Lean Archive

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

Channel bounds with adaptive protected coefficient spaces

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

    Uniform counting of every bounded-dimensional protected space controls the actual channel event even when that space depends on the random matrix.

    Concept map
    73 concepts; 9 descendants hidden
    100%
    Actual projected span deficitChannel bounds with adaptive protectedcoefficient spacesSampling after exposed coordinatesAdaptive sampling on disjoint coordinatesetsUnion over adaptive component coversExact-image bounds for independent affinecolumnsExact uniform bilinear character meanWalsh operator bounds with explicit bilinearrankRank of a lifted tensor sumIndependent binary channel charactersActual raw frame channel phase tailsJoint channel law and itsindependent-column densityActual channel moments and phase tailsCombined column and row mode exposureRows of diagonal tensor mapsMoment estimates for actual componenttensor phasesComponentwise mode spaces and diagonaltensorsExact conditioning costs and recovery offinite probability massesEntropy progress for residual pair lawsIndependence of distinct sample positionsJoin-stable classes of mode coversCount tensors killed by exposureActual exposure cover projectionRank of a diagonal familyDyadic span deficit estimatesA small dyadic tail scaleActual dyadic deficit recurrenceEntropy along feasible mixture lines,including new supportFull feasible support and finite informationprojectionProjection removes the exposed termsCount tested index occurrencesFinite linear images and their uniform-lawdensity boundsFinite even moment expansionFinite independent sampling and vertexexception tailsAmbient symmetries and frame marginalsGram-conditioned columns and theirrank-failure probabilityTwo-sided Gram normalization forindividually injective framesGreedy mode space exposureSmall actual greedy exposure tailsNo-cover rank growth on arbitrary finiteindicesUniform injective frames and channeltranspose failureActual deficits indexed by a distinct listFinite list tail statisticsDimension deficits after an arbitrary modemapExposed mode dimension budgetBoolean point moments with restricted basecoordinatesFinite moment probability and rank splitA low rank sum supplies an actual adaptivecoverNo-cover phase momentsRank growth without an adaptive modecoverSquared restriction cost for independent uniteventsFinite exposure partitionsProjected nonzero terms in the actualremaining sumDimensions of projected mode spacesExact probabilities for independent protectedchannel imagesWalsh bounds for independent image lawsand separated phasesRank of a tensor killed in two quotientspacesRank loss under two restrictionsRaw matrix frames and their tensorrealizationThe finite uniform raw-vertex lawOriginal retained-cell laws from finite PMFsFinite relative entropy and support costsRank loss under restriction of a bilinear formImage caps inside original retained cellsOne exposure controls both modesCounting all bounded-dimensional protectedspacesMonotonicity of span deficitsMode space span deficitsNonzero tensor count from span deficitsRank of an actual linear map sumCharacters of all independent tensor channelsAdmissible pair lawsOrthogonality and finite Walsh correlationbounds
    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.ProtectedChannels
    2import Lax342547.SmallSubspaceCount
    3import Lax342547.ChannelColumns
    4import Lax342547.InjectiveFrames
    5
    6/-!
    7---
    8title: Channel bounds with adaptive protected coefficient spaces
    9type: lemma
    10---
    11Uniform counting of every bounded-dimensional protected space controls the actual channel event even when that space depends on the random matrix.
    12-/
    13
    14namespace Lax342547.AdaptiveProtection
    15
    16open Lax342547.MomentSpace Lax342547.RetainedImages Lax342547.RealCellLaws
    17open scoped BigOperators
    18
    19axiom adaptive_protected_probability {I H N : Type}
    20 [Fintype I] [Fintype H] [Fintype N] [DecidableEq I] [DecidableEq H] [DecidableEq N]
    21 (D : Matrix N I Binary) (hD : Function.Injective D.mulVec)
    22 (S : Matrix N H Binary → Submodule Binary (H → Binary)) (K : ℕ)
    23 (hS : ∀ Y,Module.finrank Binary (S Y) ≤ K) :
    24 cellMass (weights (PMF.uniformOfFintype (Matrix N H Binary)))
    25 (fun Y => ∀ i,(fun h => (Y.transpose*D) h i) ∈ S Y) ≤
    26 (2 : ℝ)^(Fintype.card H*K+K*Fintype.card I)/(2 : ℝ)^(Fintype.card H*Fintype.card I)
    27
    28end Lax342547.AdaptiveProtection
    29
    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…