Bugeaud Collection of Conjectures and Open Questions: Lacunary Sequences in Real Number Fields
Problem 10.5 ("moreover" clause). With the same hypotheses as problem_10_5, the sequence can be chosen so that, for any real not in , each subinterval of of length contains a limit point of the sequence $(...
Mathematical statement
Problem 10.5 ("moreover" clause). With the same hypotheses as problem_10_5, the
sequence can be chosen so that, for any real not in , each
subinterval of of length contains a limit point of the sequence
. This is strictly stronger than problem_10_5: the limsup
bound is the special case at the subinterval .
Statement source: Books statement material
Statement terms: Source-specific
Source-specific terms. Therefore does not assert reuse rights beyond attributed display.
Statement artifacts, not proofs
These records expose exact Lean propositions and statement-only wrappers. Defining a proposition does not supply a proof of it. A placeholder-bearing target also contains no proof. Elaboration checks syntax and types; it does not certify that a formalization perfectly captures every nuance of the informal problem.
Pinned Lean formulation 1
problem_10_5_moreover
theorem problem_10_5_moreover (K : IntermediateField ℚ ℝ) [FiniteDimensional ℚ K] {ε : ℝ} (hε : 0 < ε) : ∃ t : ℕ → K, (∀ n, 0 < (t n : ℝ)) ∧ IsLacunaryReal (fun k => (t k : ℝ)) ∧ ∀ ξ : ℝ, ξ ∉ K → ∀ a, a ∈ Set.Icc (0 : ℝ) (1 - ε) → ∃ y ∈ Set.Icc a (a + ε), MapClusterPt y atTop (fun n => Int.fract (ξ * (t n : ℝ))) := by sorry- Statement source
- Formal Conjectures
- Lean version
- v4.27.0
- Placeholder
- Present; no proof artifact
- Source evidence
- Pinned source index
- Fidelity review
- Community formulation
References