Lax Lean Archive

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

Original-rank no-cover tails for endpoint groups

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

    Independent endpoint channels amplify the moment decay while retaining the original tensor rank and original cover hypothesis.

    Concept map
    62 concepts; 3 descendants hidden
    100%
    Actual projected span deficitSampling after exposed coordinatesAdaptive sampling on disjoint coordinatesetsUnion over adaptive component coversExact uniform bilinear character meanWalsh operator bounds with explicit bilinearrankRank of a lifted tensor sumIndependent binary channel charactersActual 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 familyMoments across endpoint channel groupsOriginal-rank no-cover tails for endpointgroupsDyadic 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 even moment expansionFinite independent sampling and vertexexception tailsGreedy mode space exposureSmall actual greedy exposure tailsNo-cover rank growth on arbitrary finiteindicesActual 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 spacesWalsh bounds for independent image lawsand separated phasesRank of a tensor killed in two quotientspacesRank loss under two restrictionsOriginal 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 modesMonotonicity 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

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

    1 no_cover_even_moment proven

    2 no_cover_phase_tail proven

    Lean source view on GitHub

    1import Lax342547.DuplicatedMoments
    2import Lax342547.NoCoverMoments
    3/-!
    4---
    5title: Original-rank no-cover tails for endpoint groups
    6type: lemma
    7---
    8Independent endpoint channels amplify the moment decay while retaining the original tensor rank and original cover hypothesis.
    9-/
    10
    11namespace Lax342547.DuplicatedNoCover
    12
    13open Lax342547.MomentSpace Lax342547.RelativeEntropy Lax342547.FiniteSampling Lax342547.RetainedImages
    14open Lax342547.ChannelCharacters Lax342547.TensorCharacters Lax342547.ComponentSpaces
    15open Lax342547.ComponentDuals Lax342547.CoverProjection
    16open scoped BigOperators
    17
    18axiom no_cover_even_moment {e d I J Ω : Type} [Fintype e] [Fintype d] [Fintype I] [Fintype J] [Fintype Ω]
    19 [DecidableEq e] [DecidableEq d] [DecidableEq I] [DecidableEq J]
    20 (μ : Ω → ℝ) (A : Ω → e → Matrix I J Binary) (ψ : Ω → ℝ) (r h t k : ℕ) (p : ℝ)
    21 (hμ : Probability μ) (hp0 : 0 ≤ p) (hp1 : p ≤ 1) (hr : 1 ≤ r)
    22 (hA : ∀ x, ∑ i, (A x i).rank ≤ r) (hψ : ∀ x, |ψ x| ≤ 1)
    23 (hsize : 2*t = 2^k) (hk : 100*r+12 ≤ k)
    24 (hcover : ∀ S : Submodule Binary (e → I → Binary),
    25 ∀ T : Submodule Binary (Module.Dual Binary (e → J → Binary)),
    26 Componentwise S → DualComponentwise T →
    27 (Module.finrank Binary S : ℝ) ≤ (r : ℝ)*(2*t) →
    28 (Module.finrank Binary T : ℝ) ≤ (r : ℝ)*(2*t) →
    29 cellMass μ (fun x => projection (LinearMap.piMap (fun i => (A x i).mulVecLin)) S T = 0) ≤ p) :
    30 (∑ c, productLaw (fun _ : (e × d) × Fin h => channelLaw) c*
    31 |∑ x, μ x*ψ x*tensorCharacter h (fun i : e × d => A x i.1) c|^(2*t)) ≤
    32 (4 : ℝ)^(2*t)*p^(2^(k-(100*r+10)))+1/(2 : ℝ)^((Fintype.card d*h)*2^(k-(100*r+12)))
    33
    34axiom no_cover_phase_tail {e d I J Ω : Type} [Fintype e] [Fintype d] [Fintype I] [Fintype J] [Fintype Ω]
    35 [DecidableEq e] [DecidableEq d] [DecidableEq I] [DecidableEq J]
    36 (μ : Ω → ℝ) (A : Ω → e → Matrix I J Binary) (ψ : Ω → ℝ) (r h t k : ℕ) (p θ : ℝ)
    37 (hμ : Probability μ) (hp0 : 0 ≤ p) (hp1 : p ≤ 1) (hr : 1 ≤ r)
    38 (hA : ∀ x, ∑ i, (A x i).rank ≤ r) (hψ : ∀ x, |ψ x| ≤ 1)
    39 (hsize : 2*t = 2^k) (hk : 100*r+12 ≤ k)
    40 (hcover : ∀ S : Submodule Binary (e → I → Binary),
    41 ∀ T : Submodule Binary (Module.Dual Binary (e → J → Binary)),
    42 Componentwise S → DualComponentwise T →
    43 (Module.finrank Binary S : ℝ) ≤ (r : ℝ)*(2*t) →
    44 (Module.finrank Binary T : ℝ) ≤ (r : ℝ)*(2*t) →
    45 cellMass μ (fun x => projection (LinearMap.piMap (fun i => (A x i).mulVecLin)) S T = 0) ≤ p)
    46 (hθ : 0 < θ) :
    47 cellMass (productLaw (fun _ : (e × d) × Fin h => channelLaw))
    48 (fun c => θ ≤ |∑ x, μ x*ψ x*tensorCharacter h (fun i : e × d => A x i.1) c|) ≤
    49 ((4 : ℝ)^(2*t)*p^(2^(k-(100*r+10)))+1/(2 : ℝ)^((Fintype.card d*h)*2^(k-(100*r+12))))/θ^(2*t)
    50
    51end Lax342547.DuplicatedNoCover
    52
    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…