Documentation

MathlibNt.AnalyticNumberTheory.LargeSieve.LiLiuPrereqFouvryExtractedKeyBound

Quantitative six-key grouping of the actual extracted exponential sum #

The five canonical gcd coordinates and the extraction divisor Δ give an explicit finite box. The complementary divisor Δ' is determined on each fiber. All original masks, cutoffs, signed coefficients, and both frequency signs remain in the actual fiber sums. The triangle inequality is used only between these fibers, not between their oscillatory summands.

This supplies the finite-key cost underlying Fouvry (1987), p. 627, (3.12). It is not an IV.3 cancellation estimate or a completion of C.2.

Inspect dependencies

MathlibNt.AnalyticNumberTheory.LargeSieve.LiLiuPrereqFouvry.WExtractedKey · compiled type and proof/definition references.

Inspect dependencies

MathlibNt.AnalyticNumberTheory.LargeSieve.LiLiuPrereqFouvry.wExtractedKey · compiled type and proof/definition references.

Inspect dependencies

MathlibNt.AnalyticNumberTheory.LargeSieve.LiLiuPrereqFouvry.wExtractedKeyBox · compiled type and proof/definition references.

Inspect dependencies

MathlibNt.AnalyticNumberTheory.LargeSieve.LiLiuPrereqFouvry.mem_wExtractedKeyBox_iff · compiled type and proof/definition references.

Inspect dependencies

MathlibNt.AnalyticNumberTheory.LargeSieve.LiLiuPrereqFouvry.wExtractedKeyBox_nonempty · compiled type and proof/definition references.

Inspect dependencies

MathlibNt.AnalyticNumberTheory.LargeSieve.LiLiuPrereqFouvry.wExtractedKeyBox_card · compiled type and proof/definition references.

Inspect dependencies

MathlibNt.AnalyticNumberTheory.LargeSieve.LiLiuPrereqFouvry.wExtractedKeyBox_card_le · compiled type and proof/definition references.

The actual extraction equation and strict positivity, without replacing Δ' by a new independent coordinate.

Inspect dependencies

MathlibNt.AnalyticNumberTheory.LargeSieve.LiLiuPrereqFouvry.wExtracted_extraction_spec · compiled type and proof/definition references.

Membership of the full six-key box follows from the actual mask and the extraction equation; Δ ≤ δ*δ₂ ≤ Y² uses Δ' > 0.

Inspect dependencies

MathlibNt.AnalyticNumberTheory.LargeSieve.LiLiuPrereqFouvry.wExtractedKey_mem_box · compiled type and proof/definition references.

Inspect dependencies

MathlibNt.AnalyticNumberTheory.LargeSieve.LiLiuPrereqFouvry.wExtractedKeyFiber · compiled type and proof/definition references.

Inspect dependencies

MathlibNt.AnalyticNumberTheory.LargeSieve.LiLiuPrereqFouvry.mem_wExtractedKeyFiber_iff · compiled type and proof/definition references.

theorem MathlibNt.AnalyticNumberTheory.LargeSieve.LiLiuPrereqFouvry.wExtractedKeyFiber_spec {H : ℕ → ℕ → ℕ} {N Q : Finset ℕ} {a : ℤ} {P : WOriginalTuple → Prop} {R S ξ : ℝ} {b : ℕ} {K : WExtractedKey} {t : WExtractedTuple × ℤ} (ht : t ∈ wExtractedKeyFiber H N Q a P R S ξ b K) :
(wGCDTuple (wExtractedOriginal t.1)).key = K.1 ∧ t.1.1.1.1 = K.2 ∧ 0 < K.2 ∧ 0 < t.1.1.1.2 ∧ t.1.1.1.2 = K.1.2.2.1 * K.1.2.2.2.2 / K.2

Fixed canonical source data on a fiber, including the determined complementary extraction divisor.

Inspect dependencies

MathlibNt.AnalyticNumberTheory.LargeSieve.LiLiuPrereqFouvry.wExtractedKeyFiber_spec · compiled type and proof/definition references.

noncomputable def MathlibNt.AnalyticNumberTheory.LargeSieve.LiLiuPrereqFouvry.wExtractedKeyExponential (H : ℕ → ℕ → ℕ) (N Q : Finset ℕ) (β c₁ γ ζ : ℕ → ℝ) (a : ℤ) (P : WOriginalTuple → Prop) (R S ξ : ℝ) (b : ℕ) (K : WExtractedKey) (u : ℝ) :
Equations
Instances For
    Inspect dependencies

    MathlibNt.AnalyticNumberTheory.LargeSieve.LiLiuPrereqFouvry.wExtractedKeyExponential · compiled type and proof/definition references.

    theorem MathlibNt.AnalyticNumberTheory.LargeSieve.LiLiuPrereqFouvry.wExtractedBlockExponential_eq_sum_keys (H : ℕ → ℕ → ℕ) (N Q : Finset ℕ) (β c₁ γ ζ : ℕ → ℝ) (a : ℤ) (x η R S ξ : ℝ) (b : ℕ) (u : ℝ) :
    wExtractedBlockExponential H N Q β c₁ γ ζ a (c2FiveSmallMask x η) R S ξ b u = ∑ K ∈ wExtractedKeyBox (x ^ η), wExtractedKeyExponential H N Q β c₁ γ ζ a (c2FiveSmallMask x η) R S ξ b K u
    Inspect dependencies

    MathlibNt.AnalyticNumberTheory.LargeSieve.LiLiuPrereqFouvry.wExtractedBlockExponential_eq_sum_keys · compiled type and proof/definition references.

    theorem MathlibNt.AnalyticNumberTheory.LargeSieve.LiLiuPrereqFouvry.wExtractedBlockExponential_le_keyMax (H : ℕ → ℕ → ℕ) (N Q : Finset ℕ) (β c₁ γ ζ : ℕ → ℝ) (a : ℤ) (x η R S ξ : ℝ) (b : ℕ) (u : ℝ) :
    ∃ K ∈ wExtractedKeyBox (x ^ η), (∀ K' ∈ wExtractedKeyBox (x ^ η), ‖wExtractedKeyExponential H N Q β c₁ γ ζ a (c2FiveSmallMask x η) R S ξ b K' u‖ ≤ ‖wExtractedKeyExponential H N Q β c₁ γ ζ a (c2FiveSmallMask x η) R S ξ b K u‖) ∧ ‖wExtractedBlockExponential H N Q β c₁ γ ζ a (c2FiveSmallMask x η) R S ξ b u‖ ≤ ↑(wExtractedKeyBox (x ^ η)).card * ‖wExtractedKeyExponential H N Q β c₁ γ ζ a (c2FiveSmallMask x η) R S ξ b K u‖

    A key attaining the maximum of the actual fiber sums, with the exact rectangular-box cardinality as loss. Empty source carriers cause no problem.

    Inspect dependencies

    MathlibNt.AnalyticNumberTheory.LargeSieve.LiLiuPrereqFouvry.wExtractedBlockExponential_le_keyMax · compiled type and proof/definition references.

    theorem MathlibNt.AnalyticNumberTheory.LargeSieve.LiLiuPrereqFouvry.wExtractedBlockExponential_le_keyMax_power (H : ℕ → ℕ → ℕ) (N Q : Finset ℕ) (β c₁ γ ζ : ℕ → ℝ) (a : ℤ) (x η R S ξ : ℝ) (b : ℕ) (u : ℝ) (hY : 1 ≤ x ^ η) :
    ∃ K ∈ wExtractedKeyBox (x ^ η), ‖wExtractedBlockExponential H N Q β c₁ γ ζ a (c2FiveSmallMask x η) R S ξ b u‖ ≤ 128 * (x ^ η) ^ 7 * ‖wExtractedKeyExponential H N Q β c₁ γ ζ a (c2FiveSmallMask x η) R S ξ b K u‖
    Inspect dependencies

    MathlibNt.AnalyticNumberTheory.LargeSieve.LiLiuPrereqFouvry.wExtractedBlockExponential_le_keyMax_power · compiled type and proof/definition references.

    theorem MathlibNt.AnalyticNumberTheory.LargeSieve.LiLiuPrereqFouvry.wMaskedFactorExtractedTruncated_fullLevel_key_bound {M Z L : ℝ} (hM : 0 < M) (hZ : 0 ≤ Z) (hL : 0 ≤ L) (N : Finset ℕ) (β c₁ γ ζ : ℕ → ℝ) (a : ℤ) (x η R S ξ : ℝ) (hY : 1 ≤ x ^ η) :
    ∃ b ≤ Nat.log 2 ⌈L ^ 2 / M * Z⌉₊, ∃ y ∈ Set.Icc (1 / 2) 3, ∃ K ∈ wExtractedKeyBox (x ^ η), |wMaskedFactorExtractedTruncated M (wUniformCutoff M Z) N (Finset.Ioc 0 ⌊L⌋₊) β c₁ γ ζ a (c2FiveSmallMask x η) R S ξ| ≤ 384 * M * ↑(Nat.log 2 ⌈L ^ 2 / M * Z⌉₊ + 1) * (x ^ η) ^ 7 * ‖wExtractedKeyExponential (wUniformCutoff M Z) N (Finset.Ioc 0 ⌊L⌋₊) β c₁ γ ζ a (c2FiveSmallMask x η) R S ξ b K (M * y)‖

    The actual full-level extracted W is bounded by one actual six-key fiber. The logarithmic shell cost and polynomial key cost are explicit.

    Inspect dependencies

    MathlibNt.AnalyticNumberTheory.LargeSieve.LiLiuPrereqFouvry.wMaskedFactorExtractedTruncated_fullLevel_key_bound · compiled type and proof/definition references.

    theorem MathlibNt.AnalyticNumberTheory.LargeSieve.LiLiuPrereqFouvry.wellFactorable_signedError_sq_le_fullLevel_key_c2 {ι : Type u_1} {κ k i j : ℕ} (A : ℕ) {T : ι → ℝ} {N : ι → Finset ℕ} {β : ι → ℕ → ℝ} (hSW : BetaCoprimeSWFamily κ T N β) (hT : ∀ (z : ι), 1 ≤ T z) (hN : ∀ (z : ι), ∀ n ∈ N z, T z ≤ ↑n ∧ ↑n ≤ 2 * T z) (hβ : ∀ (z : ι), ∀ n ∈ N z, |β z n| ≤ ↑((fouvryTau k) n)) {ε η : ℝ} (hε : 0 < ε) (hη : 0 < η) :
    ∀ᶠ (x : ℝ) in Filter.atTop, ∀ (z : ι) (M ν : ℝ), 1 ≤ M → 4 * M * T z = x → ε ≤ ν → ν ≤ 1 / 10 → T z = x ^ ν → ∀ (U : Finset ℕ), (∀ m ∈ U, M ≤ ↑m ∧ ↑m ≤ 2 * M) → ∀ (α c : ℕ → ℝ), (∀ m ∈ U, |α m| ≤ ↑((fouvryTau i) m)) → SignedWellFactorable j (x ^ ((5 - 5 * ν) / 9 - ε)) c → have L := x ^ ((5 - 5 * ν) / 9 - ε); have R₀ := x ^ c2RExponent ν ε; have S₀ := x ^ c2SExponent ν ε; have J := Nat.log 2 ⌈L ^ 2 / M * x ^ η⌉₊; R₀ * S₀ = L ∧ ∃ (γ : ℕ → ℝ) (ζ : ℕ → ℝ), factorSupported R₀ γ ∧ factorSupported S₀ ζ ∧ (∀ (r : ℕ), |γ r| ≤ ↑((fouvryTau j) r)) ∧ (∀ (s : ℕ), |ζ s| ≤ ↑((fouvryTau j) s)) ∧ c = factorConvolution γ ζ ∧ ∀ (a : ℤ), a ≠ 0 → |↑a| ≤ x → ∃ b ≤ J, ∃ y ∈ Set.Icc (1 / 2) 3, ∃ K ∈ wExtractedKeyBox (x ^ η), signedError U (N z) (Finset.Ioc 0 ⌊L⌋₊) α (β z) c a ^ 2 ≤ (3072 * M * ∑ m ∈ U, α m ^ 2) * ↑(J + 1) * (x ^ η) ^ 7 * ‖wExtractedKeyExponential (wUniformCutoff M (x ^ η)) (N z) (Finset.Ioc 0 ⌊L⌋₊) (betaClean (β z) a) (factorConvolution γ (betaLowOmega ζ (highOmegaCutoff x))) γ ζ a (c2FiveSmallMask x η) R₀ S₀ (highOmegaCutoff x) b K (M * y)‖ + x ^ 2 / Real.log x ^ A

    The original signed-error endpoint with quantitative six-key cost. WF factors are still chosen before a; no new SW hypothesis, arbitrary fiber bound, or cancellation claim is introduced.

    Inspect dependencies

    MathlibNt.AnalyticNumberTheory.LargeSieve.LiLiuPrereqFouvry.wellFactorable_signedError_sq_le_fullLevel_key_c2 · compiled type and proof/definition references.