OAI/InformationTheory/QuantumCircuit/Asymptotics.lean
13 declarations, 0 contain sorry, 0 declared as axioms
- lemma
OAI.QAC.eventually_power_leline 12Source documentation
Strict exponent gaps absorb every fixed multiplicative constant.
lemma eventually_power_le {s t : ℝ} (hst : s < t) (C : ℝ) : ∀ᶠ N : ℕ in atTop, C * (N : ℝ) ^ s ≤ (N : ℝ) ^ t := by … - lemma
OAI.QAC.eventually_power_log_leline 24Source documentation
The same strict gap absorbs a logarithm, with no change to the exponent.
lemma eventually_power_log_le {s t : ℝ} (hst : s < t) (C : ℝ) : ∀ᶠ N : ℕ in atTop, C * (N : ℝ) ^ s * Real.log N ≤ (N : ℝ) ^ t := by … - lemma
OAI.QAC.ceil_rpow_boundsline 42 - lemma
OAI.QAC.ceil_rpow_logline 52 - lemma
OAI.QAC.approx_weight_expline 69 - lemma
OAI.QAC.approx_decay_expline 99 - lemma
OAI.QAC.ceil_approx_conditionline 113 - theorem
OAI.QAC.polynomial_approximationline 159Source documentation
Polynomial approximation uniform in
N, includingb > 1.theorem polynomial_approximation {a b u : ℝ} (ha : 0 < a) (hab : a < b) (hu : (a + b) / 2 < u) : ∀ᶠ N : ℕ in atTop, ∃ p : ℝ[X], (p.natDegree : ℝ) ≤ (N : ℝ) ^ u ∧ weight N p ≤ Real.exp ((N : ℝ) ^ u) ∧ p.eval 0 = 1 ∧ ∀ x : ℕ, 1 ≤ x → x ≤ ⌈(N : ℝ) ^ b⌉₊ → |p.eval (x : ℝ)| ≤ Real.exp (-((N : ℝ) ^ a)) := by …Mentions: OAI.QAC.weight
- lemma
OAI.QAC.eventually_two_powers_leline 209 - lemma
OAI.QAC.eventually_exp_power_gapline 215Source documentation
Every fixed coefficient and prefactor is absorbed by the strict power gaps.
lemma eventually_exp_power_gap {s u v : ℝ} (hs : s < v) (hu : u < v) (hv : 0 < v) (C ε D K : ℝ) (hC : 0 < C) (hε : 0 < ε) : ∀ᶠ N : ℕ in atTop, C * Real.exp (K*(N:ℝ)^u - (N:ℝ)^v) ≤ ε * Real.exp (-(D*(N:ℝ)^s)) := by … - lemma
OAI.QAC.ceil_power_log_boundline 230 - lemma
OAI.QAC.eventually_pattern_costline 246 - lemma
OAI.QAC.eventually_backward_costline 260