Lax Lean Archive

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

Uniform early channel choice for actual accepting tables

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

    Theorem

    The channel dimension is fixed before the polynomial accepting-mass exponent, the ambient dimension, the unit law, and the adaptive marks. All sixteen flags of each component are controlled on actual admissible tables, paying the loss relative to their original accepting mass.

    Concept map
    119 concepts
    100%
    Finite accepting-family lossesActual finite accepting-pair injectionActual projected span deficitChannel bounds with adaptive protectedcoefficient spacesSampling after exposed coordinatesAdaptive sampling on disjoint coordinatesetsUnion over adaptive component coversExact-image bounds for independent affinecolumnsFinite amplified-test averagingExact 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 diagonaltensorsConcrete coordinates, quadratic testers, andthe self-Gram formThe affine minus-column law at a fixed plusframeExact 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 projectionCut profiles and the constant kernelRank 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 informationprojectionExact image pins in nominal coefficientspacesProjection removes the exposed termsCount tested index occurrencesFinite pin-injection exceptionFinite linear images and their uniform-lawdensity boundsFinite even moment expansionFinite independent sampling and vertexexception tailsAmbient symmetries and frame marginalsReciprocal raw-frame orientation and dualpin avoidanceThe symmetric binary gradient formGram-conditioned columns and theirrank-failure probabilityTwo-sided Gram normalization forindividually injective framesGreedy independence of subspacesGreedy mode space exposureSmall actual greedy exposure tailsThe binary hole relationPaying the reference-image conditioning anddimension costsGreedy independent failure samplesAmplified channel failures on independentpinned spacesNo-cover rank growth on arbitrary finiteindicesRelative injection loss for polynomialaccepting massEarly channel choice and injection exponentbudgetsInjection parameter quantifiersAccepting-pair test unions and relative lossUniform injective-matrix densityUniform injective frames and channeltranspose failureActual deficits indexed by a distinct listFinite list tail statisticsFactorization and counting of low-rankbinary matricesDimension deficits after an arbitrary modemapExposed mode dimension budgetExplicit no-cover moment parameter marginsBoolean 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 partitionsActual phase averages from small exceptionaltailsPrepared-unit injection on actual acceptingpairsEarly channel choice for preparedaccepting-pair injectionUniform primal-span avoidanceExact images mixing independent injectiveframesJoint minus images after exposing severalplus framesProjected nonzero terms in the actualremaining sumPrimal projections and preservation ofeffective spacesDimensions 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 accepting-family injection withexponential lossActual frame observations realize thenominal channel contractionsRaw matrix frames and their tensorrealizationThe finite uniform raw-vertex lawActual raw primal-span avoidanceOriginal retained-cell laws from finite PMFsJoint reference image caps across both signsand all drawsThe full reference cap for exact pin eventsFinite relative entropy and support costsRank loss under restriction of a bilinear formImage caps inside original retained cellsFinite sequential testsOne exposure controls both modesCounting all bounded-dimensional protectedspacesNumerical cross tables, injection flags, andunary admissibilityMonotonicity of span deficitsMode space span deficitsNonzero tensor count from span deficitsRank of an actual linear map sumTable contractions on effective profiles andtheir full extensionsActual table injection and ambient pinfailuresTable coordinates and private channelcomplementsMajority intersections in the cyclic taggeometryCharacters of all independent tensor channelsWell-defined channel contractions onprojected tensor spacesCounting component tensors with boundedtotal rankUniform raw channel phase tails overbounded-rank targetsUniform early channel choice for actualaccepting tablesAdmissible pair lawsWhole-unit conditioned pin avoidanceUniversal protected pin witnessesOrthogonality 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.PreparedInjectionScale
    2
    3/-!
    4---
    5title: Uniform early channel choice for actual accepting tables
    6type: theorem
    7---
    8The channel dimension is fixed before the polynomial accepting-mass
    9exponent, the ambient dimension, the unit law, and the adaptive marks.
    10All sixteen flags of each component are controlled on actual admissible
    11tables, paying the loss relative to their original accepting mass.
    12-/
    13
    14namespace Lax342547.UniformTableInjection
    15open Lax342547.MomentSpace Lax342547.RawFrames Lax342547.ExactPins
    16open Lax342547.TableSpaces Lax342547.SmallTables Lax342547.PreparedInjection
    17open Lax342547.RealCellLaws Lax342547.PushforwardWalsh Lax342547.RetainedImages
    18open Lax342547.RelativeEntropy
    19open scoped BigOperators
    20axiom exists_uniform_injection {Comp : Type} [Fintype Comp] [Nonempty Comp]
    21 (K Cs : ℕ) (ε : ℝ) (hε : 0 < ε) :
    22 ∃ h : ℕ,∀ c : ℕ,∃ N₀ : ℕ,∀ N p m : ℕ,N₀ ≤ N → p ≤ N/8 → m ≤ N/100 →
    23 ∀ (U I : Type) [Fintype U] [Fintype I] (E : Matrix (Fin p) (Fin p) Binary)
    24 [Nonempty (Frame (Fin p) (Fin h) (Fin N) E)]
    25 (ρ : U → ℝ) (P : U → Pin (Comp × Bool) (Fin 2 × (Fin p ⊕ Fin h)) (Fin N))
    26 (A : U → Fin 2 → Comp → Frame (Fin p) (Fin h) (Fin N) E)
    27 (accept : U → U → Prop) (CL CR : I → U → Prop) (keyL keyR : U → I)
    28 (T : ∀ a b,Table (P a) (P b)) (M : ℝ),
    29 Probability ρ → 0 ≤ M → M ≤ (2 : ℝ)^m →
    30 (Fintype.card I : ℝ) ≤ (2 : ℝ)^(Cs*N) →
    31 (∀ u,(P u).rank ≤ K) →
    32 (∀ i e f,push ρ (fun u => A u i e) f ≤
    33 M*weights (PMF.uniformOfFintype (Frame (Fin p) (Fin h) (Fin N) E)) f) →
    34 (∀ a b,accept a b ↔ CL (keyL b) a) → (∀ a b,accept b a ↔ CR (keyR b) a) →
    35 (∀ a b,accept a b → Admissible (T a b)
    36 Lax342547.ReferencePins.observation Lax342547.ReferencePins.observation (A a) (A b)) →
    37 1/(N : ℝ)^c ≤ cellMass (fun ab : U × U => ρ ab.1*ρ ab.2) (fun ab => accept ab.1 ab.2) →
    38 cellMass (fun ab : U × U => ρ ab.1*ρ ab.2)
    39 (fun ab => accept ab.1 ab.2 ∧ ¬ Injecting (T ab.1 ab.2)) ≤
    40 ε*cellMass (fun ab : U × U => ρ ab.1*ρ ab.2) (fun ab => accept ab.1 ab.2)
    41
    42end Lax342547.UniformTableInjection
    43
    Show Proof
    Builds on
    Used by

    none

    From Mathlib

    none

    Discussion

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

    Loading discussion…