Documentation

MathlibNt.SieveTheory.LiLiuGoldbachG12SafeGridTerminal

noncomputable def G12SafeGridBudget.safeUnion (ρ : ℝ) (N : ℕ) (e : ℝ) :

The literal union of all actual safe cells in the original finite grid.

Equations
Instances For
    Inspect dependencies

    G12SafeGridBudget.safeUnion · compiled type and proof/definition references.

    theorem G12SafeGridBudget.safe_pairwise {ρ : ℝ} (hρ : 1 < ρ) {N : ℕ} (hN : 1 ≤ N) (e : ℝ) :
    Inspect dependencies

    G12SafeGridBudget.safe_pairwise · compiled type and proof/definition references.

    theorem G12SafeGridBudget.safe_union_sum {ρ : ℝ} (hρ : 1 < ρ) {N : ℕ} (hN : 1 ≤ N) (e : ℝ) (f : ℕ × ℕ → ℝ) :
    ∑ p ∈ safeUnion ρ N e, f p = ∑ k ∈ G12FineGrid.indices ρ N, ∑ p ∈ G12FineGrid.safe ρ N e k, f p
    Inspect dependencies

    G12SafeGridBudget.safe_union_sum · compiled type and proof/definition references.

    Literal safe-set terminal: no duplicated grid atoms, no artificial weights, no unbound additive fees, and independent fixed main/additive slacks.

    Inspect dependencies

    G12SafeGridBudget.safe_union_normalized · compiled type and proof/definition references.