Lax Lean Archive

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

Accepted key subprobabilities and uniform overlap

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

    Accepted queries retain their original mass. Uniform reference overlap is exactly the number of keys times independent accepted collision probability.

    Concept map
    96 concepts
    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 channelsA 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 plusframeCompression 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 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 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 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 blocksBoolean 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 productsEndpoint 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 cutprofilesCompression 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 lawNonlinear 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 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 formSelected 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 spacesWitness atoms and their numerical testerrecords
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on ADescendants are omitted for concepts with more than 10 descendants.
    Evidence

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

    1 key_collision_identity proven

    2 key_mass_nonneg proven

    3 key_mass_subprobability proven

    4 key_mass_total proven

    5 uniform_overlap_collision proven

    Lean source view on GitHub

    1import Lax342547.PrimalRecords
    2
    3/-!
    4---
    5title: Accepted key subprobabilities and uniform overlap
    6type: lemma
    7---
    8Accepted queries retain their original mass. Uniform reference overlap is exactly the number of keys times independent accepted collision probability.
    9-/
    10
    11namespace Lax342547.KeyMeasures
    12
    13
    14
    15noncomputable def keyMass {Ω Q : Type} [Fintype Ω]
    16 (ρ : Ω → ℝ) (key : Ω → Q) (accepted : Ω → Prop) (q : Q) : ℝ := by
    17 classical
    18 exact ∑ ω, if accepted ω ∧ key ω = q then ρ ω else 0
    19
    20axiom key_mass_nonneg {Ω Q : Type} [Fintype Ω]
    21 (ρ : Ω → ℝ) (key : Ω → Q) (accepted : Ω → Prop) (hρ : ∀ ω, 0 ≤ ρ ω) (q : Q) :
    22 0 ≤ keyMass ρ key accepted q
    23
    24axiom key_mass_total {Ω Q : Type} [Fintype Ω] [Fintype Q]
    25 (ρ : Ω → ℝ) (key : Ω → Q) (accepted : Ω → Prop) : by
    26 classical
    27 exact (∑ q, keyMass ρ key accepted q) = ∑ ω, if accepted ω then ρ ω else 0
    28
    29axiom key_mass_subprobability {Ω Q : Type} [Fintype Ω] [Fintype Q]
    30 (ρ : Ω → ℝ) (key : Ω → Q) (accepted : Ω → Prop)
    31 (hρ : ∀ ω, 0 ≤ ρ ω) (hsum : ∑ ω, ρ ω ≤ 1) :
    32 (∑ q, keyMass ρ key accepted q) ≤ 1
    33
    34axiom key_collision_identity {ΩA ΩB Q : Type} [Fintype ΩA] [Fintype ΩB] [Fintype Q]
    35 (α : ΩA → ℝ) (β : ΩB → ℝ) (keyA : ΩA → Q) (keyB : ΩB → Q)
    36 (acceptA : ΩA → Prop) (acceptB : ΩB → Prop) : by
    37 classical
    38 exact (∑ q, keyMass α keyA acceptA q * keyMass β keyB acceptB q) =
    39 ∑ a, ∑ b, if acceptA a ∧ acceptB b ∧ keyA a = keyB b then α a * β b else 0
    40
    41noncomputable def uniformDensity {Q : Type} [Fintype Q] (mass : Q → ℝ) : Q → ℝ :=
    42 fun q => Fintype.card Q * mass q
    43
    44noncomputable def uniformOverlap {Q : Type} [Fintype Q] (a b : Q → ℝ) : ℝ :=
    45 (∑ q, uniformDensity a q * uniformDensity b q) / Fintype.card Q
    46
    47axiom uniform_overlap_collision {Q : Type} [Fintype Q] [Nonempty Q] (a b : Q → ℝ) :
    48 uniformOverlap a b = Fintype.card Q * ∑ q, a q * b q
    49
    50end Lax342547.KeyMeasures
    51
    Show ProofShow ProofShow 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…