Lax Lean Archive

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

Paper parameter graph probability

Lax342547.PaperGraphProbability · concepts/Lax342547/PaperGraphProbability.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 failure probability of the connected matching bound is eventually at most two to minus half the sample size, assuming actual raw supersaturation.

    Concept map
    134 concepts; 1 descendant 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 matricesSubexponential container counts at thepaper sample scaleEntropy 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 budgetsThe paper fingerprint and exception scalesFinite 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 framesSampled graph failure boundThe 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 recipeequationsPaper parameter graph probabilitySparse 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 inputsExponential sampling failure marginExact 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 cellsEventual sampling margins for the paperparametersGraphs 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

    Each proof establishes this claim relative to its assumptions.

    Lean source view on GitHub

    1import Lax342547.GraphFailure
    2import Lax342547.ProbabilityScales
    3
    4/-!
    5---
    6title: Paper parameter graph probability
    7type: lemma
    8---
    9The failure probability of the connected matching bound is eventually at most two to minus half the sample size, assuming actual raw supersaturation.
    10-/
    11
    12namespace Lax342547.PaperGraphProbability
    13
    14open Lax342547.RelativeEntropy Lax342547.UnitLaws Lax342547.ContainerLaws
    15open Lax342547.MatchingSamples Lax342547.SampledGraph Lax342547.ConnectedMatching
    16open Lax342547.FingerprintScales Lax342547.FiniteSampling Lax342547.RetainedImages
    17open Filter
    18
    19axiom paper_graph_failure_probability {Ω : ℕ → Type} [∀ N, Fintype (Ω N)] [∀ N, Nonempty (Ω N)]
    20 (μ : ∀ N, Ω N → ℝ) (hole : ∀ N, Ω N → Ω N → Prop) (A g : ℕ) (hg : 0 < g)
    21 (hsymm : ∀ N, ∀ ⦃x y⦄, hole N x y → hole N y x)
    22 (hloop : ∀ N x, ¬ hole N x x)
    23 (hμ : ∀ N, Probability (μ N)) (hμpos : ∀ N x, 0 < μ N x)
    24 (hcard : ∀ᶠ N : ℕ in atTop, Fintype.card (Ω N) ≤ 2^(A*N^2))
    25 (hsuper : ∀ᶠ N : ℕ in atTop, ∀ ρ,
    26 Feasible (μ N) (fun x y => ¬ hole N x y) ((2 : ℝ)^1000) ((2 : ℝ)^(4000*g*N)) ρ →
    27 1/(2 : ℝ)^(100*g*N) ≤ conflictMass ρ (fourConflict (hole N))) :
    28 ∀ᶠ N : ℕ in atTop,
    29 cellMass (productLaw (fun _ : Fin (sampleSize g N) => μ N))
    30 (fun sample => sampleSize g N ≤ 100*connectedMatchingNumber (sampleGraph (hole N) (hsymm N) sample)) ≤
    31 1/(2 : ℝ)^(sampleSize g N/2)
    32
    33end Lax342547.PaperGraphProbability
    34
    Show 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…