Dyadic rationals and dyadic truncation
DefinitionKLSModular_LevyStochCalc_Brownian_ContinuityDyadicChainingVendored from LevyStochCalc, repository https://github.com/cgarryZA/LevyStochCalc, commit 984dbf0b790031eac05d56fe5a84b65e15e1e932. The set dyadicRationals consists of real numbers of the form k · 2^(−n), with k ∈ ℤ and n ∈ ℕ. The noncomputable function dyadicTrunc maps x ∈ ℝ to floor(x · 2ⁿ) divided by 2ⁿ, the level-n dyadic approximation from below. This bundle contains these definitions only; the surrounding module documents their use in deterministic Hölder chaining.
Original module imports
import LevyStochCalc.Brownian.Construction
import Mathlib.Probability.Process.Kolmogorov
import Mathlib.Probability.Distributions.Gaussian.Fernique
Original declaration excerpt
Shown in the original module context.
def dyadicRationals : Set ℝ :=
{x : ℝ | ∃ k : ℤ, ∃ n : ℕ, x = (k : ℝ) * (2 : ℝ)^(-n : ℤ)}
Module navigation
Direct project imports: LevyStochCalc/Brownian/Construction.
Theorems in source order:
dense_dyadicRationalsdyadicTrunc_succ_stepdyadicTrunc_telescopedyadicTrunc_near_stepdyadicTrunc_eventually_eqexists_dyadic_scalerpow_half_pow_lekc_exponent_identitydyadic_holder_chaining
Project result: The KLS conjecture.
Original module · LevyStochCalc.Brownian.ContinuityDyadicChaining · Frozen source 408915f.
import Definitions.Def_KLSModular_LevyStochCalc_Brownian_Construction
import Mathlib.Probability.Process.Kolmogorov
import Mathlib.Probability.Distributions.Gaussian.Fernique
/-
Copyright (c) 2026 Christian Garry. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Christian Garry
-/
-- Vendored from https://github.com/cgarryZA/LevyStochCalc at commit 984dbf0b790031eac05d56fe5a84b65e15e1e932 (upstream path LevyStochCalc/Brownian/ContinuityDyadicChaining.lean; Apache-2.0; provenance in formalization/vendor/vendor-lock.json of the KLS repository)
open MeasureTheory ProbabilityTheory
open scoped NNReal ENNReal Topology
namespace LevyStochCalc
namespace Brownian
namespace Continuity
/-- The set of dyadic rationals: `D := {k * 2^{-n} : k ∈ ℤ, n ∈ ℕ}`. Dense in ℝ. -/
def dyadicRationals : Set ℝ :=
{x : ℝ | ∃ k : ℤ, ∃ n : ℕ, x = (k : ℝ) * (2 : ℝ)^(-n : ℤ)}
/-- Level-`n` dyadic truncation `⌊x·2ⁿ⌋ / 2ⁿ` — the largest level-`n` dyadic
`≤ x`. -/
noncomputable def dyadicTrunc (n : ℕ) (x : ℝ) : ℝ := (⌊x * 2 ^ n⌋ : ℝ) / 2 ^ n
end Continuity
end Brownian
end LevyStochCalc