Lax Lean Archive

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

Finite supersaturation implies an actual sampled graph

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

    The exact admissible raw-unit supersaturation property, together with the explicit entropy, counting and sampling margins, produces a graph on sampled positions with independence number at most two and 100 times its actual connected matching number less than its order.

    Concept map
    128 concepts; 7 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 correctionsBipartite capacity networksBounded allowed derivatives preserving theactual linearized responseActual-mass averaging over retainedrecord-cell pairsSimultaneous assembly of opposite endpointsand reciprocal unit rolesAllowed channel changes and the actual tableinjection testsRank-controlled factorization throughallowed orthogonal channelsPruning small unary record cellsA 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 massesConnected matchingsCompression that fixes pin/key vectors andpreserves target matricesEntropy progress for residual pair lawsFinite deterministic container recursionIndependence of distinct sample positionsCut profiles and the constant kernelThe full linearized response on pairs ofactual cut profilesDisjoint pair exception tailsFull response obstructions are effectiveprofiles plus selected atomsEntropy bounded container familiesEntropy along feasible mixture lines,including new supportFull feasible support and finite informationprojectionDeterministic entropy and neighborhoodselectionsExact image pins in nominal coefficientspacesFinite ordered fingerprint budgetsFinite linear images and their uniform-lawdensity boundsFinite independent sampling and vertexexception tailsReal max-flow min-cut from residualreachabilityActual gradient agreement and matched keysproduce all four cross holesAmbient 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 columnsWhole-space gradient realization preservingthe actual frozen entriesBaseline contractions on the selected atomsA good sample from the explicit containerbudgetAll 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 framesThe binary hole relationPaying the reference-image conditioning anddimension costsUniform injective frames and channeltranspose failureAccepted key subprobabilities and uniformoverlapFresh point-ray spans are disjoint from thenominal table spacesLow-rank Boolean moments have boundedlabel supportTriangle relations separate into individuallabel blocksCount matching occurrences covered byterminal exceptionsMatching occurrences and raw unit typesBoolean 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-responseannihilatorsActual 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 basecoefficientsSparse residual contractions belong to theactual primal pinsFinite 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 framesPrimal 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 of a tensor killed in two quotientspacesRank-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 lawFinite supersaturation implies an actualsampled graphOriginal retained-cell laws from finite PMFsCompact real-capacity flows and amaximizing flowNonlinear 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 drawsThe full reference cap for exact pin eventsFinite relative entropy and support costsResidual walk augmentation for real-capacityflowsRemoving 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 formImage caps inside original retained cellsGraphs sampled from a hole relationSelected 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 spacesTerminal exceptions from real capacity cutsTerminal containers for actual admissibleunit lawsAdmissible pair lawsOrthogonality 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 exception_budget_nonneg proven

    2 supersaturation_to_sample proven

    Lean source view on GitHub

    1import Lax342547.UnitContainers
    2import Lax342547.GoodSamples
    3import Lax342547.MatchingCoverage
    4
    5/-!
    6---
    7title: Finite supersaturation implies an actual sampled graph
    8type: lemma
    9---
    10The exact admissible raw-unit supersaturation property, together with the explicit entropy, counting and sampling margins, produces a graph on sampled positions with independence number at most two and 100 times its actual connected matching number less than its order.
    11-/
    12
    13namespace Lax342547.RawToGraph
    14
    15open Lax342547.RelativeEntropy Lax342547.UnitLaws Lax342547.ContainerLaws
    16open Lax342547.RetainedImages Lax342547.CellAveraging Lax342547.FiniteSampling
    17open Lax342547.GoodSamples Lax342547.MatchingSamples Lax342547.SampledGraph Lax342547.ConnectedMatching
    18
    19noncomputable def exceptionBudget (m k : ℕ) (M κ : ℝ) : ℝ :=
    20 (m.choose k : ℝ)*(1/M)^k+(m : ℝ)^(2*k)*(1/κ)^k
    21
    22axiom exception_budget_nonneg (m k : ℕ) (M κ : ℝ) (hM : 0 < M) (hκ : 0 < κ) :
    23 0 ≤ exceptionBudget m k M κ
    24
    25axiom supersaturation_to_sample {Ω : Type} [Fintype Ω] [Nonempty Ω]
    26 (μ : Ω → ℝ) (hole : Ω → Ω → Prop)
    27 (hsymm : ∀ ⦃x y⦄, hole x y → hole y x) (hloop : ∀ x, ¬ hole x x)
    28 (htriangle : ∀ x y z, hole x y → hole y z → ¬ hole z x)
    29 (M κ ε : ℝ) (m k L : ℕ)
    30 (hμ : Probability μ) (hμpos : ∀ x, 0 < μ x)
    31 (hM : 0 < M) (hκ : 0 < κ) (hε : 0 < ε) (hε1 : ε < 1)
    32 (hL : Real.log κ/(-Real.log (1-ε))+1 ≤ L)
    33 (hscale : 200*(k-1) < m)
    34 (hbudget : (((Fintype.card Ω^2+1)^L : ℕ) : ℝ)*exceptionBudget m k M κ < 1)
    35 (hsuper : ∀ ρ, Feasible μ (fun x y => ¬ hole x y) M κ ρ →
    36 ε ≤ conflictMass ρ (fourConflict hole)) :
    37 ∃ sample : Fin m → Ω,
    38 (sampleGraph hole hsymm sample).indepNum ≤ 2 ∧
    39 100*connectedMatchingNumber (sampleGraph hole hsymm sample) < m
    40
    41end Lax342547.RawToGraph
    42
    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…