bh_dense_stage
def
The k-th stage of the construction (paper (3.2)): S_0 = {1} and S_{k+1} = S_k ∪ (M_k + B_q), where q = q_k is a prime exceeding both h and h · max S_k, D = h^(h-1) q^h bounds the block, and M_k = (h-1)D + q.
Statement
noncomputable def bh_dense_stage (h : ℕ) : ℕ → Finset ℕ
- Source
- step towards infinite_bh_set_upper_density_eq_one_div_h
- Verified
- 05 Nov 2026
- Axioms
- none listed
- Built on 2
- bh_dense_primeThe prime used for the next block of the construction: a prime larger than both
handh*n, chosen arbitrarily (Classical.choose)… - moment_blockThe finite moment-curve block
B_q = {moment_elem h q h a | 0 ≤ a < q}: theqresidues encoded inhbase-h*qdigits.
- bh_dense_primeThe prime used for the next block of the construction: a prime larger than both
- Used by 1
- bh_dense_setThe infinite set produced by the construction (paper (3.2)): the union of all stages
S_k.
- bh_dense_setThe infinite set produced by the construction (paper (3.2)): the union of all stages
Lean source view module on GitHub
/-- Stage `k` of the recursive construction: start with `{1}` and repeatedly append a translated moment-curve block. -/ noncomputable def bh_dense_stage (h : ℕ) : ℕ → Finset ℕ := fun k => Nat.rec {1} (fun _ S => let n := S.sup id let q := bh_dense_prime h n let D := h ^ (h - 1) * q ^ h let M := (h - 1) * D + q S ∪ (moment_block h q).image (fun x => M + x)) k