Lax Lean Archive

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

Both actual cross orientations have retained-cell image entropy

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

    Actual query-key independence and the exact leaf caps give all-rank matrix-image bounds on the original retained cells. Reindexing the second nominal orientation preserves ranks and uses the same key-slot exponent.

    Concept map
    132 concepts; 2 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 responseSimultaneous assembly of opposite endpointsand reciprocal unit rolesAllowed channel changes and the actual tableinjection testsRank-controlled factorization throughallowed orthogonal channelsCoefficient phases as dot products ofrank-factor imagesJoint retained-cell characters across allcomponentsSimultaneous scalar Gram agreement acrosscomponentsA 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 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 boundsActual gradient agreement and matched keysproduce all four cross holesFinite scalar agreement from binarycharacter boundsAmbient 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 columnsOriginal record cells determine the commonfrozen gradient targetExact agreement of zero quotient charactersWhole-space gradient realization preservingthe actual frozen entriesUnary records determine every frozen crossentryBaseline 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 framesScalar agreement after quotient characterestimatesThe binary hole relationPaying the reference-image conditioning anddimension costsUniform injective frames and channeltranspose failureFrozen pin and key records with nominalcolumn budgetsAppend fresh directions to the independentkey tupleExact leaf entropy bounds joint key andadditional imagesFresh point-ray spans are disjoint from thenominal table spacesLow-rank Boolean moments have boundedlabel supportTriangle relations separate into individuallabel blocksJoint matrix-image caps for retained leaflawsJoint fresh-image entropy on originalretained leaf cellsExtracting a leaf with all remainingexact-image capsAll-rank tuple image caps from exact-pin leafentropyBoolean 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 productsSquared restriction cost for independent uniteventsEndpoint projections of paired pure-responseannihilatorsPaired-frame orbit under the primal anddual actionsActual 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 basecoefficientsExact-pin leaf entropy is invariant undernominal axis reindexingSparse residual contractions belong to theactual primal pinsActual primal-channel scalar tests andretained-cell four-hole probabilityFinite 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 framesSplit quotient projections preserve coefficientcharactersPrimal projections and preservation ofeffective spacesPure obstructions on the actual pair of cutprofilesWalsh bounds for independent image lawsand separated phasesActual query keys independent modulo oldpinsActual query frozen spaces and linear recordexponentsReference keys and matched keys for actualpaired listsThe actual paired-list key slot budgetCompression on the actual barred nominalquotientsExtracting fresh label coefficients throughpin quotientsRank factors independent modulo the actualfrozen spacesRank of a tensor killed in two quotientspacesFull rank coefficient factorizationsRank-controlled pure forms on the actualbarred quotientsBounded baselines for both actual crossorientationsBoth actual cross orientations haveretained-cell image entropyActual frame observations realize thenominal channel contractionsRaw matrix frames and their tensorrealizationThe finite uniform raw-vertex lawActual query-key image caps on raw leavesOriginal 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 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 formActual cross Gram characters on frozenunary cellsImage caps inside original retained cellsRight endpoint query-key caps via paired-listreindexingSimultaneous agreement of linear cross Gramtests on 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 spacesOrthogonality 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 left_cell_block_cap proven

    2 right_cell_block_cap proven

    Lean source view on GitHub

    1import Lax342547.LeafBlockCaps
    2import Lax342547.PinLabelExclusions
    3import Lax342547.FrozenCellDirections
    4import Lax342547.PinReindexing
    5
    6/-!
    7---
    8title: Both actual cross orientations have retained-cell image entropy
    9type: lemma
    10---
    11Actual query-key independence and the exact leaf caps give all-rank matrix-image bounds on the original retained cells. Reindexing the second nominal orientation preserves ranks and uses the same key-slot exponent.
    12-/
    13
    14namespace Lax342547.RawCellEntropy
    15
    16open Lax342547.MomentSpace Lax342547.ConcreteGeometry Lax342547.TagGeometry
    17open Lax342547.PairedWitnesses Lax342547.QueryReference Lax342547.QueryIndependence
    18open Lax342547.ReferencePins Lax342547.JoinedRecords Lax342547.ExactPins Lax342547.KeySpans
    19open Lax342547.RawQueryImages Lax342547.RealCellLaws Lax342547.ComponentCharacters
    20open Lax342547.PrimalGramTests
    21open scoped ENNReal
    22
    23axiom left_cell_block_cap {k n b degree r : ℕ} {hr : 2 * r ≤ n} {H N : Type}
    24 [Fintype H] [Fintype N] {M : Moment k n b degree}
    25 (W : Lists k n b degree r hr) (p : PMF (Unit (H := H) (N := N) (E := M)))
    26 (P : Pin (Lax342547.CutProfiles.Component (Tag k) × Bool)
    27 (Fin 2 × (Coordinate k n b degree ⊕ H)) N)
    28 (A : Fin 2 → Finset (Fin b → Binary)) (hA : Excludes P A)
    29 (hfresh : ∀ i z t, (W.left i z t).label ∉ A i)
    30 (q : Lax342547.ReferenceKeys.Tuples (Lax342547.CutProfiles.Component (Tag k)) (ComponentPosition W) N)
    31 (C : Unit (H := H) (N := N) (E := M) → Prop) (hCkey : ∀ o, C o → leftTuple W o = q)
    32 (ζ : ℝ) (hζ : 0 ≤ ζ) (hζsmall : ζ ≤ 1/1000)
    33 (hk : 2*ζ*Fintype.card (Lax342547.QuerySlots.Slot W) ≤ (1/500 : ℝ))
    34 (hCmass : (2 : ℝ)^(-((Fintype.card (Lax342547.QuerySlots.Slot W) : ℝ)+1/100)*Fintype.card N) ≤
    35 (p.toOuterMeasure {o | C o}).toReal)
    36 (hcap : ∀ Q : Pin (Lax342547.CutProfiles.Component (Tag k) × Bool)
    37 (Fin 2 × (Coordinate k n b degree ⊕ H)) N, 1 ≤ P.relativeRank Q →
    38 p.toOuterMeasure (Q.event observation) ≤ ((2 : ℝ≥0∞)^(-(1-2*ζ)*Fintype.card N))^(P.relativeRank Q))
    39 (ranks : Lax342547.CutProfiles.Component (Tag k) × Bool → ℕ)
    40 (F : ∀ a, Matrix (Fin 2 × (Coordinate k n b degree ⊕ H)) (Fin (ranks a)) Binary)
    41 (hF : ∀ a, Function.Injective ((joined P (fun a => keyMap (H := H) W a.1) a).mkQ.comp (F a).mulVecLin))
    42 (y : ((Σ a, Fin (ranks a)) × N) → Binary) : by
    43 classical
    44 exact Lax342547.PushforwardWalsh.push (subtypeWeights (weights p) C)
    45 (fun o => blockImage F (leftMatrices o.val)) y ≤
    46 (2 : ℝ)^(-(95/100 : ℝ)*((∑ a, ranks a)*Fintype.card N))
    47
    48axiom right_cell_block_cap {k n b degree r : ℕ} {hr : 2 * r ≤ n} {H N : Type}
    49 [Fintype H] [Fintype N] {M : Moment k n b degree}
    50 (W : Lists k n b degree r hr) (p : PMF (Unit (H := H) (N := N) (E := M)))
    51 (P : Pin (Lax342547.CutProfiles.Component (Tag k) × Bool)
    52 (Fin 2 × (Coordinate k n b degree ⊕ H)) N)
    53 (A : Fin 2 → Finset (Fin b → Binary)) (hA : Excludes P A)
    54 (hfresh : ∀ i z t, (W.right i z t).label ∉ A z)
    55 (q : Lax342547.ReferenceKeys.Tuples (Lax342547.CutProfiles.Component (Tag k)) (ComponentPosition W) N)
    56 (C : Unit (H := H) (N := N) (E := M) → Prop) (hCkey : ∀ o, C o → rightTuple W o = q)
    57 (ζ : ℝ) (hζ : 0 ≤ ζ) (hζsmall : ζ ≤ 1/1000)
    58 (hk : 2*ζ*Fintype.card (Lax342547.QuerySlots.Slot W) ≤ (1/500 : ℝ))
    59 (hCmass : (2 : ℝ)^(-((Fintype.card (Lax342547.QuerySlots.Slot W) : ℝ)+1/100)*Fintype.card N) ≤
    60 (p.toOuterMeasure {o | C o}).toReal)
    61 (hcap : ∀ Q : Pin (Lax342547.CutProfiles.Component (Tag k) × Bool)
    62 (Fin 2 × (Coordinate k n b degree ⊕ H)) N, 1 ≤ P.relativeRank Q →
    63 p.toOuterMeasure (Q.event observation) ≤ ((2 : ℝ≥0∞)^(-(1-2*ζ)*Fintype.card N))^(P.relativeRank Q))
    64 (ranks : Lax342547.CutProfiles.Component (Tag k) × Bool → ℕ)
    65 (F : ∀ a, Matrix (Fin 2 × (Coordinate k n b degree ⊕ H)) (Fin (ranks a)) Binary)
    66 (hF : ∀ a, Function.Injective ((joined (Lax342547.PinReindexing.pull Lax342547.PinReindexing.opposite P)
    67 (fun a => keyMap (H := H) (Lax342547.PairedRecipes.flip W) a.1) a).mkQ.comp (F a).mulVecLin))
    68 (y : ((Σ a, Fin (ranks a)) × N) → Binary) : by
    69 classical
    70 exact Lax342547.PushforwardWalsh.push (subtypeWeights (weights p) C)
    71 (fun o => blockImage F (rightMatrices o.val)) y ≤
    72 (2 : ℝ)^(-(95/100 : ℝ)*((∑ a, ranks a)*Fintype.card N))
    73
    74end Lax342547.RawCellEntropy
    75
    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…