Lax Lean Archive

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

Exact-pin leaf entropy is invariant under nominal axis reindexing

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

    Pull back exact pins along a finite axis equivalence. Relative ranks and specified image events agree exactly, so the original all-rank leaf cap applies to the opposite cross orientation.

    Concept map
    109 concepts; 3 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 responseAllowed channel changes and the actual tableinjection testsRank-controlled factorization throughallowed orthogonal channelsCoefficient phases as dot products ofrank-factor imagesJoint retained-cell characters across allcomponentsA 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 boundsFinite scalar agreement from binarycharacter boundsAmbient symmetries and frame marginalsFresh key directions are independent modulotable spacesBaseline bilinear extensions retaining allfrozen rows and columnsExact agreement of zero quotient charactersUnary records determine every frozen crossentryBaseline contractions on the selected atomsThe symmetric binary gradient formGram-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 failureAppend 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 partEndpoint 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 pinsRetractions 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 phasesCompression 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 crossorientationsActual frame observations realize thenominal channel contractionsRaw matrix frames and their tensorrealizationThe finite uniform raw-vertex lawOriginal retained-cell laws from finite PMFsGradient 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 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 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 3 statements. Each proof establishes one of them relative to its assumptions.

    1 event_reindex proven

    2 leaf_cap_reindex proven

    3 relative_rank_reindex proven

    Lean source view on GitHub

    1import Lax342547.LeafBlockCaps
    2
    3/-!
    4---
    5title: Exact-pin leaf entropy is invariant under nominal axis reindexing
    6type: lemma
    7---
    8Pull back exact pins along a finite axis equivalence. Relative ranks and specified image events agree exactly, so the original all-rank leaf cap applies to the opposite cross orientation.
    9-/
    10
    11namespace Lax342547.PinReindexing
    12
    13open Lax342547.MomentSpace Lax342547.ExactPins
    14open scoped ENNReal
    15
    16noncomputable def pull {Axis Axis' I N : Type} (e : Axis' ≃ Axis) (P : Pin Axis I N) : Pin Axis' I N :=
    17 ⟨fun a => P.space (e a), fun a => P.value (e a)⟩
    18
    19axiom relative_rank_reindex {Axis Axis' I N : Type} [Fintype Axis] [Fintype Axis'] [Fintype I]
    20 (e : Axis' ≃ Axis) (P : Pin Axis I N) (Q : Pin Axis' I N) :
    21 (pull e P).relativeRank Q = P.relativeRank (pull e.symm Q)
    22
    23axiom event_reindex {Ω Axis Axis' I N : Type}
    24 (e : Axis' ≃ Axis) (A : Ω → Axis → (I → Binary) →ₗ[Binary] (N → Binary))
    25 (Q : Pin Axis' I N) :
    26 Q.event (fun ω a => A ω (e a)) = (pull e.symm Q).event A
    27
    28axiom leaf_cap_reindex {Ω Axis Axis' I N : Type} [Fintype Axis] [Fintype Axis'] [Fintype I]
    29 (e : Axis' ≃ Axis) (p : PMF Ω)
    30 (A : Ω → Axis → (I → Binary) →ₗ[Binary] (N → Binary))
    31 (P : Pin Axis I N) (α : ℝ≥0∞)
    32 (hcap : ∀ Q : Pin Axis I N, 1 ≤ P.relativeRank Q →
    33 p.toOuterMeasure (Q.event A) ≤ α ^ (P.relativeRank Q))
    34 (Q : Pin Axis' I N) (hr : 1 ≤ (pull e P).relativeRank Q) :
    35 p.toOuterMeasure (Q.event (fun ω a => A ω (e a))) ≤ α ^ ((pull e P).relativeRank Q)
    36
    37noncomputable def opposite {Comp : Type} : (Comp × Bool) ≃ (Comp × Bool) where
    38 toFun a := (a.1,!a.2)
    39 invFun a := (a.1,!a.2)
    40 left_inv a := by simp
    41 right_inv a := by simp
    42
    43end Lax342547.PinReindexing
    44
    Show ProofShow 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…