OAI/Probability/TraceReconstruction/ErrorRates.lean
62 declarations, 0 contain sorry, 0 declared as axioms
ErrorRates
Realization of block caps, sparse scales, sharp and smoothing budgets, tree tails, fit errors, and uniform polynomial/exponential bounds.
- theorem
OAI.TraceReconstruction.sourceWindowSize_leline 22 - theorem
OAI.TraceReconstruction.SourceArithmeticBounds.scheduled_trialsline 30Source comment
We use only positive target scales below.theorem SourceArithmeticBounds.scheduled_trials {C N F ε : ℝ} {s b ell k : ℕ} (H : SourceArithmeticBounds C N F ε s b ell k) (hN : 0 < N) (hC : 0 < C) (hF : 0 < F) (j : ℕ) (hj : j+1 < b) : N^(scaleKappa b (j+2) ε+ε)/(4800*(C^(2*b)*F)) ≤ (sourceScheduledTrials (sourceBlockWindows N b ε) (sourceArithmeticTrials C N b ε ell k) (j+1):ℝ) := by …Mentions: OAI.TraceReconstruction.SourceArithmeticBounds, OAI.TraceReconstruction.scaleKappa, OAI.TraceReconstruction.sourceScheduledTrials, OAI.TraceReconstruction.sourceBlockWindows, OAI.TraceReconstruction.sourceArithmeticTrials
- theorem
OAI.TraceReconstruction.SourceArithmeticBounds.binomial_capsline 63 - theorem
OAI.TraceReconstruction.sourceSparseCount_scaleline 94 - theorem
OAI.TraceReconstruction.sourceLeafCount_succline 109 - theorem
OAI.TraceReconstruction.sourceLeafCount_le_lengthline 113 - theorem
OAI.TraceReconstruction.sourceArithmeticLength_eq_blockline 123 - theorem
OAI.TraceReconstruction.SourceArithmeticBounds.leaf_boundline 130 - theorem
OAI.TraceReconstruction.source_sparse_weight_boundline 152Source documentation
Full sparse degree, with the excluded bottom window and the exact source gap. This is the high-degree geometric gain, before constants.
theorem source_sparse_weight_bound (N ε d W w : ℝ) (b s : ℕ) (hN : 0 < N) (hW : 0 ≤ W) (hw : w^2 ≤ W*N^(-scaleA b 0 ε*d)) : w^2*(sourceSparseCount (sourceBlockWindows N b ε) s (b-1):ℝ) ≤ W*((2^s:ℕ):ℝ)*N^(-(scaleA b 0 ε*d-sourceInteriorExponent b ε)) := by …Mentions: OAI.TraceReconstruction.scaleA, OAI.TraceReconstruction.sourceSparseCount, OAI.TraceReconstruction.sourceBlockWindows, OAI.TraceReconstruction.sourceInteriorExponent
- def
OAI.TraceReconstruction.sourceBadRoleFactorline 174 - def
OAI.TraceReconstruction.sourceForcedRoleFactorline 177 - theorem
OAI.TraceReconstruction.source_sharp_numericline 183Source documentation
Explicit finite sharp energy bound. The two undesirable pattern classes are suppressed by eta and a, and the genuine binary forced skeleton pays its full source exponent. The high tail uses the sparse, not dense count.
theorem source_sharp_numeric (T n : ℕ→ℕ) (s b R : ℕ) (ω η a w N ε d K W Q gap : ℝ) (hN : 1 ≤ N) (hK : 0 ≤ K) (hW : 0 ≤ W) (_hQ : 0 ≤ Q) (hleaves : (SourceLeafCount T (b+1):ℝ) ≤ N) (hwone : w^2 ≤ 1) (hw : w^2 ≤ W*N^(-scaleA (b+1) 0 ε*d)) (hsmall : w^2*((2^s:ℕ):ℝ)*(sourceSparseCount T s b:ℝ) ≤ 1) (hhalf : w^2*(sourceSparseCount T s b:ℝ) ≤ 1/2) (hsparse : w^2*(sourceSparseCount T s b:ℝ) ≤ Q*N^(-gap)) (hn : ∀j≤b,hiddenBinomialCap (n j) ω ≤ K*N^(-ε/2)) (hg : ∀j<b,hiddenBinomialCap (sourceScheduledTrials T n (j+1)) ω ≤ K*N^(-(scaleKappa (b+1) (j+2) ε+ε)/2)) : sourceSharpEnergyBudget T n s b R ω η a w ≤ sourceBadRoleFactor b R*N^R*(η^2+a^2)+ …Mentions: OAI.TraceReconstruction.SourceLeafCount, OAI.TraceReconstruction.scaleA, OAI.TraceReconstruction.sourceSparseCount, OAI.TraceReconstruction.hiddenBinomialCap, OAI.TraceReconstruction.sourceScheduledTrials, OAI.TraceReconstruction.scaleKappa, OAI.TraceReconstruction.sourceSharpEnergyBudget, OAI.TraceReconstruction.sourceBadRoleFactor
- def
OAI.TraceReconstruction.sourceSmoothingPrefactorline 264 - theorem
OAI.TraceReconstruction.hiddenSmoothingBound_scaleline 267 - theorem
OAI.TraceReconstruction.sourceLeafCount_positiveline 306 - theorem
OAI.TraceReconstruction.sourceFitTail_simpleline 314 - theorem
OAI.TraceReconstruction.windowCollection_card_boundline 336 - theorem
OAI.TraceReconstruction.collectionCount_lowerline 352 - theorem
OAI.TraceReconstruction.sourceEffectiveHiddenTail_simpleline 365 - theorem
OAI.TraceReconstruction.SourceArithmeticBounds.fit_exponentline 394Source documentation
The literal centering fluctuation has the source epsilon exponent. This does not treat nested window starts as independent.
theorem SourceArithmeticBounds.fit_exponent {C N F ε : ℝ} {s b ell k j : ℕ} (H : SourceArithmeticBounds C N F ε s b ell k) (hC : 0<C) (hF : 0<F) (hN : 1 ≤ N) (he : 0 ≤ ε) (hκ : ∀v<b,3*ε ≤ scaleKappa b (v+1) ε) (hj : j+1<b) : N^ε/512 ≤ 2*((sourceBlockWindows N b ε j:ℝ)/8)^2 / (((sourceBlockWindows N b ε (j+1):ℝ)+1)*(sourceArithmeticTrials C N b ε ell k j:ℝ)) := by …Mentions: OAI.TraceReconstruction.SourceArithmeticBounds, OAI.TraceReconstruction.scaleKappa, OAI.TraceReconstruction.sourceBlockWindows, OAI.TraceReconstruction.sourceArithmeticTrials
- def
OAI.TraceReconstruction.SourcePolyUpperline 442Source documentation
A convenience for the manuscript's fixed-B polynomial losses. This predicate is only used to prove bounds on the literal finite constants.
def SourcePolyUpper (f : ℕ→ℝ) : Prop := …
- theorem
OAI.TraceReconstruction.SourcePolyUpper.constline 445 - theorem
OAI.TraceReconstruction.SourcePolyUpper.depthline 450 - theorem
OAI.TraceReconstruction.SourcePolyUpper.monoline 453 - theorem
OAI.TraceReconstruction.SourcePolyUpper.addline 458 - theorem
OAI.TraceReconstruction.SourcePolyUpper.mulline 469 - theorem
OAI.TraceReconstruction.SourcePolyUpper.powline 480 - theorem
OAI.TraceReconstruction.sourceEpsilon_inverse_polyline 487 - theorem
OAI.TraceReconstruction.totalScoreExponent_polyline 494 - theorem
OAI.TraceReconstruction.SourcePolyUpper.ceilline 502 - theorem
OAI.TraceReconstruction.sourceCancellationOrder_polyline 508 - theorem
OAI.TraceReconstruction.sourceCancellationOrder_largeline 526 - def
OAI.TraceReconstruction.SourceExpUpperline 541Source documentation
Literal finite-block factors are subpower uniformly over the joint deletion regime when their logarithms grow polynomially in the depth.
def SourceExpUpper (f : ℕ→ℝ→ℝ) : Prop := …
- theorem
OAI.TraceReconstruction.SourcePolyUpper.expUpperline 545 - theorem
OAI.TraceReconstruction.SourceExpUpper.constline 555 - theorem
OAI.TraceReconstruction.SourceExpUpper.monoline 558 - theorem
OAI.TraceReconstruction.SourceExpUpper.mulline 563 - theorem
OAI.TraceReconstruction.SourceExpUpper.pow_variablyline 582 - theorem
OAI.TraceReconstruction.SourceExpUpper.powline 596 - theorem
OAI.TraceReconstruction.sourceOverlapConstant_expUpperline 601 - theorem
OAI.TraceReconstruction.initialOverlapLower_inverse_expUpperline 608 - theorem
OAI.TraceReconstruction.SourceExpUpper.uniformline 622Source documentation
All indices are inside the same physical n,q instance.
theorem SourceExpUpper.uniform (f : ℕ→ℝ→ℝ) (hf : SourceExpUpper f) (B : ℕ) (ζ δ : ℝ) (hB : 2 ≤ B) (hζ : ζ∈Set.Ioo 0 1) (hδ : 0<δ) {n q : ℕ→ℝ} (hn : Tendsto n atTop atTop) (hq : ∀t,q t∈Set.Ioc 0 (1/2:ℝ)) (hH : Tendsto (fun t=>(q t)^3*Real.log (n t)) atTop atTop) : ∀ᶠt in atTop,∀i,f (sourceDepth B ζ ((q t)^3*Real.log (n t))) (q t) ≤ (sourceTargetScale B (sourceDepth B ζ ((q t)^3*Real.log (n t))) (n t) i)^( δ*sourceEpsilon B (sourceDepth B ζ ((q t)^3*Real.log (n t)))) := by …Mentions: OAI.TraceReconstruction.SourceExpUpper, OAI.TraceReconstruction.sourceDepth, OAI.TraceReconstruction.sourceTargetScale, OAI.TraceReconstruction.sourceEpsilon
- def
OAI.TraceReconstruction.sourceMomentEnvelopeline 645 - def
OAI.TraceReconstruction.sourceCapEnvelopeline 648 - def
OAI.TraceReconstruction.sourceWeightEnvelopeline 651 - theorem
OAI.TraceReconstruction.sourceMomentEnvelope_posline 653 - theorem
OAI.TraceReconstruction.sourceCapEnvelope_posline 657 - theorem
OAI.TraceReconstruction.sourceMomentEnvelope_expUpperline 661 - theorem
OAI.TraceReconstruction.sourceCapEnvelope_expUpperline 672 - theorem
OAI.TraceReconstruction.sourceWeightEnvelope_expUpperline 683 - theorem
OAI.TraceReconstruction.sourceMotif_expUpperline 688 - theorem
OAI.TraceReconstruction.sourceSmoothingPrefactor_expUpperline 692 - theorem
OAI.TraceReconstruction.sourceSkeletonPrefactor_expUpperline 709 - theorem
OAI.TraceReconstruction.SourceArithmeticBounds.fit_tailline 731 - theorem
OAI.TraceReconstruction.SourceArithmeticBounds.metadata_tailline 742 - theorem
OAI.TraceReconstruction.source_clipping_moment_powerline 764Source documentation
Quantitative clipping without any default-limit increase or limiting interchange: the power is the finite even moment actually used by the oracle.
theorem source_clipping_moment_power (T : ℕ→ℕ) (s b k : ℕ) (N gap L : ℝ) (hN : 0<N) (hhalf : ((6*(2*k:ℕ):ℝ)*L)^2*sourceSparseCount T s b ≤ 1/2) (hscale : ((6*(2*k:ℕ):ℝ)*L)^2*sourceSparseCount T s b ≤ N^(-gap/2)/8) : Real.sqrt (6*(4*sourceCenteredBudget T s b k L)^k) ≤ 3*N^(-gap*(k:ℝ)/4) := by …Mentions: OAI.TraceReconstruction.sourceSparseCount, OAI.TraceReconstruction.sourceCenteredBudget
- theorem
OAI.TraceReconstruction.SourceExpUpper.addline 799 - def
OAI.TraceReconstruction.sourceScaleInverseEnvelopeline 826 - theorem
OAI.TraceReconstruction.sourceScaleInverseEnvelope_expUpperline 828 - theorem
OAI.TraceReconstruction.source_log_scale_lowerline 837 - theorem
OAI.TraceReconstruction.SourceExpUpper.uniform_logline 847 - theorem
OAI.TraceReconstruction.SourceExpUpper.uniform_tailline 895Source documentation
Uniform exponential domination at every working scale, with the full depth and the varying known deletion probability retained.
theorem SourceExpUpper.uniform_tail {f g h : ℕ→ℝ→ℝ} (hf : SourceExpUpper f) (hg : SourceExpUpper g) (hh : SourceExpUpper h) (hf0 : ∀D q,q∈Set.Ioc 0 (1/2:ℝ) → 0<f D q) (_hg0 : ∀D q,q∈Set.Ioc 0 (1/2:ℝ) → 0≤g D q) (hh0 : ∀D q,q∈Set.Ioc 0 (1/2:ℝ) → 0≤h D q) (B : ℕ) (ζ : ℝ) (hB : 2≤B) (hζ : ζ∈Set.Ioo 0 1) {n q : ℕ→ℝ} (hn : Tendsto n atTop atTop) (hq : ∀t,q t∈Set.Ioc 0 (1/2:ℝ)) (hH : Tendsto (fun t=>(q t)^3*Real.log (n t)) atTop atTop) : ∀ᶠt in atTop,∀i, g (sourceDepth B ζ ((q t)^3*Real.log (n t))) (q t)* Real.exp (-(sourceTargetScale B (sourceDepth B ζ ((q t)^3*Real.log (n t))) (n t) i)^ (sourceEpsilon B (sourceDepth B ζ ((q t)^3*Real.log (n t))))/ …Mentions: OAI.TraceReconstruction.SourceExpUpper, OAI.TraceReconstruction.sourceDepth, OAI.TraceReconstruction.sourceTargetScale, OAI.TraceReconstruction.sourceEpsilon