Documentation

MathlibNt.SieveTheory.LinearSieve.Suzuki.SuzukiClaim145CaseAHighSFinal

The high-coordinate cutoff sqrt K / log K eventually exceeds any fixed Section-13 threshold. The threshold is chosen before all later parameters.

theorem MathlibNt.SieveTheory.claim145_caseA_highS_actual_uniform_in_S (H : SwitchingPrinciple.SuzukiLemma144KappaOne.Section13HatLayers) {d Δ C1 Θ : } (hH : SwitchingPrinciple.SuzukiLemma144KappaOne.Section13HatSourceContract H) (hC1 : 0 < C1) ( : 0 Θ) (hΔ0 : 0 Δ) (hΔ1 : Δ 1) (hgap : 0 < d - 2 * Θ) :
∃ (K0 : ), 2 K0 ∀ (S : BoundingSieve), Claim145CaseALargeKHighSClosed S H d Δ C1 Θ K0 1

Actual high-s producer for source Case A. Proposition 13.1(ii) supplies its uniform lower-profile constants first; one subsequent K threshold then works for every K, depth N, natural cutoff D, and coordinate s.

theorem MathlibNt.SieveTheory.claim145_caseA_highS_actual (S : BoundingSieve) (H : SwitchingPrinciple.SuzukiLemma144KappaOne.Section13HatLayers) {d Δ C1 Θ : } (hH : SwitchingPrinciple.SuzukiLemma144KappaOne.Section13HatSourceContract H) (hC1 : 0 < C1) ( : 0 Θ) (hΔ0 : 0 Δ) (hΔ1 : Δ 1) (hgap : 0 < d - 2 * Θ) :
∃ (K0 : ), 2 K0 Claim145CaseALargeKHighSClosed S H d Δ C1 Θ K0 1

Compatibility specialization of the uniform high-coordinate leaf.

theorem MathlibNt.SieveTheory.exists_claim145_caseA_highS_actual_claim14_5Bound (S : BoundingSieve) (H : SwitchingPrinciple.SuzukiLemma144KappaOne.Section13HatLayers) {d Δ C1 Θ : } (hH : SwitchingPrinciple.SuzukiLemma144KappaOne.Section13HatSourceContract H) (hC1 : 0 < C1) ( : 0 Θ) (hΔ0 : 0 Δ) (hΔ1 : Δ 1) (hgap : 0 < d - 2 * Θ) :
∃ (C145 : ), 0 < C145 ∃ (K0 : ), 2 K0 ∀ (K : ) (N D : ) (s : ), K0 KSwitchingPrinciple.HasDimensionOneLocalProductBound S K2 D2 sK / Real.log K sReal.log D C1 * K ^ ΘSwitchingPrinciple.SuzukiLemma144KappaOne.Claim14_5Bound (fun (m : ) (D' z' : ) => suzukiActualT S m D'⌉₊ z'⌉₊) S H N (↑D) (↑D ^ (1 / s)⌉₊) d Δ (SwitchingPrinciple.SuzukiLemma144KappaOne.sourceSigma (↑D) d) K s C145

Public Claim14_5Bound spelling of the same actual producer.