OAI/Dynamics/ThreeTorus/BlockMoments.lean
91 declarations, 0 contain sorry, 0 declared as axioms
Finite-color moment laws, binomial estimates, and phase expansion.
- lemma
OAI.ThreeTorus.binomial_quadratic_remainderline 12 - lemma
OAI.ThreeTorus.binomial_exponential_remainderline 41 - abbrev
OAI.ThreeTorus.phaseHaarline 60 - abbrev
OAI.ThreeTorus.phaseProductline 61 - lemma
OAI.ThreeTorus.integrable_circleline 64 - def
OAI.ThreeTorus.blockFactorline 68 - def
OAI.ThreeTorus.blockFactorCline 71 - lemma
OAI.ThreeTorus.blockFactor_castline 74 - lemma
OAI.ThreeTorus.continuous_blockFactorline 79 - lemma
OAI.ThreeTorus.continuous_blockFactorCline 83 - lemma
OAI.ThreeTorus.blockFactor_boundsline 87 - lemma
OAI.ThreeTorus.integral_phase_characterline 96 - lemma
OAI.ThreeTorus.integral_character_blockFactorCline 104 - lemma
OAI.ThreeTorus.integral_blockFactorCline 120 - lemma
OAI.ThreeTorus.integral_blockFactorline 124 - lemma
OAI.ThreeTorus.integral_blockFactorC_mulline 131 - lemma
OAI.ThreeTorus.integral_blockFactor_mulline 148 - def
OAI.ThreeTorus.blockProductline 157 - lemma
OAI.ThreeTorus.integral_blockProductline 160 - lemma
OAI.ThreeTorus.integral_blockProduct_mulline 166 - lemma
OAI.ThreeTorus.blockProduct_nonnegline 174 - lemma
OAI.ThreeTorus.square_root_polynomial_boundline 180 - lemma
OAI.ThreeTorus.continuous_blockProductline 186 - lemma
OAI.ThreeTorus.integrable_phaseProductline 191 - def
OAI.ThreeTorus.blockMixtureline 195 - lemma
OAI.ThreeTorus.continuous_blockMixtureline 198 - lemma
OAI.ThreeTorus.integral_blockMixtureline 205 - lemma
OAI.ThreeTorus.integral_blockMixture_sqline 213 - lemma
OAI.ThreeTorus.integral_blockMixture_varianceline 239 - lemma
OAI.ThreeTorus.blockMixture_nonnegline 254 - lemma
OAI.ThreeTorus.weighted_complex_crossline 265 - lemma
OAI.ThreeTorus.block_pair_boundline 278 - lemma
OAI.ThreeTorus.blockMixture_variance_boundline 300 - lemma
OAI.ThreeTorus.blockMixture_hellinger_boundline 327 - lemma
OAI.ThreeTorus.block_hellinger_numerical_constantline 357 - def
OAI.ThreeTorus.weightedProductline 379Source documentation
Tensor density on an n-fold product probability space.
def weightedProduct (h : X → ℝ) (n : ℕ) (z : Fin n → X) : ℝ := ∏ i, h (z i)
- lemma
OAI.ThreeTorus.weightedProduct_one_factorline 381 - lemma
OAI.ThreeTorus.weightedProduct_two_centeredline 398 - lemma
OAI.ThreeTorus.continuous_weightedProductline 421 - lemma
OAI.ThreeTorus.integral_weightedProduct_centered_sumline 426 - lemma
OAI.ThreeTorus.integral_weightedProduct_centered_sqline 439 - lemma
OAI.ThreeTorus.integral_weighted_norm_sub_sqline 482 - lemma
OAI.ThreeTorus.integral_block_centeredline 507 - lemma
OAI.ThreeTorus.integral_block_centered_sqline 518 - lemma
OAI.ThreeTorus.integral_block_sum_centeredline 531 - lemma
OAI.ThreeTorus.integral_block_sum_centered_sqline 539 - def
OAI.ThreeTorus.blockEstimatorNoiseline 549 - lemma
OAI.ThreeTorus.continuous_blockEstimatorNoiseline 552 - lemma
OAI.ThreeTorus.integral_blockEstimatorNoiseline 557 - lemma
OAI.ThreeTorus.integral_blockEstimatorNoise_sqline 563 - lemma
OAI.ThreeTorus.integral_weighted_norm_add_centeredline 574 - lemma
OAI.ThreeTorus.block_estimator_previous_errorline 597 - lemma
OAI.ThreeTorus.block_estimator_variance_boundline 606 - lemma
OAI.ThreeTorus.circle_fourierCoeff_realIntegralline 622 - lemma
OAI.ThreeTorus.circle_fourierCoeff_tendstoline 639 - lemma
OAI.ThreeTorus.separated_frequency_largeline 647Source documentation
A quantitative last-nonzero-frequency estimate. It admits an arbitrary additional lower bound at each successive choice of L.
lemma separated_frequency_large {n : ℕ} {R D : ℤ} {L ν : Fin n → ℤ} (hL : ∀ i, 0 ≤ L i) (hν : ν ≠ 0) (hD : ∀ i, |ν i| ≤ D) (hgap : ∀ j, R + D * ∑ i ∈ Finset.univ.filter (· < j), L i < L j) : R < |∑ i, ν i * L i| := by … - lemma
OAI.ThreeTorus.finite_fourierCoeff_boundline 699Source documentation
Uniform Riemann--Lebesgue bounds for a finite coefficient list.
lemma finite_fourierCoeff_bound {ι : Type*} [Finite ι] (c : ι → UnitAddCircle → ℂ) {ε : ℝ} (hε : 0 < ε) : ∃ R : ℤ, 0 ≤ R ∧ ∀ k : ℤ, R < |k| → ∀ i, ‖fourierCoeff (c i) k‖ < ε := by … - lemma
OAI.ThreeTorus.phase_integral_mFourierline 720 - lemma
OAI.ThreeTorus.mFourier_diagonalline 730 - def
OAI.ThreeTorus.phaseTestline 745Source documentation
A finite Laurent expression, with coefficients depending measurably on its original circle variable.
def phaseTest {ι : Type*} [Fintype ι] {n : ℕ} (c : ι → UnitAddCircle → ℂ) (ν : ι → Fin n → ℤ) (z : UnitAddCircle) (y : UnitAddTorus (Fin n)) : ℂ := … - lemma
OAI.ThreeTorus.integral_phaseTest_independentline 750 - lemma
OAI.ThreeTorus.integral_phaseTest_diagonalline 777 - lemma
OAI.ThreeTorus.finite_phase_test_boundsline 794Source documentation
All of a finite family of phase tests are accurate for every sufficiently separated positive frequency tuple. Thus the gaps can be strengthened during a geometric construction without invalidating earlier tests.
lemma finite_phase_test_bounds {κ ι : Type*} [Fintype κ] [Fintype ι] {n : ℕ} (c : κ → ι → UnitAddCircle → ℂ) (ν : κ → ι → Fin n → ℤ) (hc : ∀ k i, Integrable (c k i) phaseHaar) {ε : ℝ} (hε : 0 < ε) : ∃ R D : ℤ, 0 ≤ R ∧ 0 ≤ D ∧ ∀ L : Fin n → ℤ, (∀ i, 0 ≤ L i) → (∀ j, R + D * ∑ i ∈ Finset.univ.filter (· < j), L i < L j) → ∀ k, ‖(∫ z, phaseTest (c k) (ν k) z (fun i => L i • z) ∂phaseHaar) - (∫ z, ∫ y, phaseTest (c k) (ν k) z y ∂volume ∂phaseHaar)‖ < ε := by …Mentions: OAI.ThreeTorus.phaseHaar, OAI.ThreeTorus.phaseTest
- def
OAI.ThreeTorus.phaseFrequenciesline 838Source documentation
The recursive choices allow any finite lower bound depending on the already selected frequencies.
def phaseFrequencies (R D : ℤ) (B : (j : ℕ) → (Fin j → ℤ) → ℤ) : ℕ → ℤ := …
- lemma
OAI.ThreeTorus.phaseFrequencies_eqline 843 - lemma
OAI.ThreeTorus.sum_fin_lt_eq_prefixline 850 - lemma
OAI.ThreeTorus.phaseFrequencies_posline 866 - lemma
OAI.ThreeTorus.phaseFrequencies_lowerline 874 - lemma
OAI.ThreeTorus.phaseFrequencies_gapline 881 - theorem
OAI.ThreeTorus.finite_phase_testsline 892Source documentation
Source Lemma
phase-tests, including arbitrary lower bounds at each successive frequency choice.theorem finite_phase_tests {κ ι : Type*} [Fintype κ] [Fintype ι] {n : ℕ} (c : κ → ι → UnitAddCircle → ℂ) (ν : κ → ι → Fin n → ℤ) (hc : ∀ k i, Integrable (c k i) phaseHaar) {ε : ℝ} (hε : 0 < ε) (B : (j : ℕ) → (Fin j → ℤ) → ℤ) : ∃ L : Fin n → ℤ, (∀ j, 0 < L j) ∧ (∀ j : Fin n, B j (fun i => L ⟨i.val, i.isLt.trans j.isLt⟩) < L j) ∧ ∀ k, ‖(∫ z, phaseTest (c k) (ν k) z (fun i => L i • z) ∂phaseHaar) - (∫ z, ∫ y, phaseTest (c k) (ν k) z y ∂volume ∂phaseHaar)‖ < ε := by …Mentions: OAI.ThreeTorus.phaseHaar, OAI.ThreeTorus.phaseTest
- def
OAI.ThreeTorus.CircleBoundedline 926Source documentation
A bounded measurable coefficient on the temporal circle.
def CircleBounded (f : UnitAddCircle → ℂ) : Prop := …
- lemma
OAI.ThreeTorus.CircleBounded.integrableline 929 - lemma
OAI.ThreeTorus.CircleBounded.constline 934 - lemma
OAI.ThreeTorus.CircleBounded.addline 937 - lemma
OAI.ThreeTorus.CircleBounded.mulline 944 - lemma
OAI.ThreeTorus.CircleBounded.conjline 952 - lemma
OAI.ThreeTorus.CircleBounded.continuousline 957 - def
OAI.ThreeTorus.PhaseLaurentline 965Source documentation
An actual finite expansion; every coefficient is proved measurable and bounded. The finite coefficient type can vary with the expression.
def PhaseLaurent {n : ℕ} (F : UnitAddCircle → (Fin n → UnitAddCircle) → ℂ) : Prop := … - lemma
OAI.ThreeTorus.PhaseLaurent.coeffline 970 - lemma
OAI.ThreeTorus.PhaseLaurent.characterline 976 - lemma
OAI.ThreeTorus.PhaseLaurent.addline 982 - lemma
OAI.ThreeTorus.PhaseLaurent.mulline 998 - lemma
OAI.ThreeTorus.PhaseLaurent.conjline 1018 - lemma
OAI.ThreeTorus.PhaseLaurent.negline 1029 - lemma
OAI.ThreeTorus.PhaseLaurent.subline 1033 - lemma
OAI.ThreeTorus.PhaseLaurent.sumline 1037 - lemma
OAI.ThreeTorus.PhaseLaurent.prodline 1048 - lemma
OAI.ThreeTorus.PhaseLaurent.norm_sqline 1059 - lemma
OAI.ThreeTorus.PhaseLaurent.boundsline 1067 - lemma
OAI.ThreeTorus.PhaseLaurent.finite_boundsline 1082 - theorem
OAI.ThreeTorus.PhaseLaurent.finite_testsline 1106Source documentation
Compatible averaging for any finite collection of expressions assembled from the actual fixed pre-block data, with all forward construction bounds.
theorem PhaseLaurent.finite_tests {κ : Type*} [Fintype κ] {n : ℕ} {F : κ → UnitAddCircle → (Fin n → UnitAddCircle) → ℂ} (hF : ∀ k, PhaseLaurent (F k)) {ε : ℝ} (hε : 0 < ε) (B : (j : ℕ) → (Fin j → ℤ) → ℤ) : ∃ L : Fin n → ℤ, (∀ j, 0 < L j) ∧ (∀ j : Fin n, B j (fun i => L ⟨i.val, i.isLt.trans j.isLt⟩) < L j) ∧ ∀ k, ‖(∫ z, F k z (fun i => L i • z) ∂phaseHaar) - (∫ z, ∫ y, F k z y ∂phaseProduct n ∂phaseHaar)‖ < ε := by …Mentions: OAI.ThreeTorus.PhaseLaurent, OAI.ThreeTorus.phaseHaar, OAI.ThreeTorus.phaseProduct