Download data/lean/OAI/NumberTheory/Jacobsthal/Analysis/ContinuousQRecurrence.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 2.22 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/NumberTheory/Jacobsthal/Analysis/ContinuousQRecurrence.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/NumberTheory/Jacobsthal/Analysis/ContinuousQRecurrence.lean
-
curl -L -o ContinuousQRecurrence.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/NumberTheory/Jacobsthal/Analysis/ContinuousQRecurrence.lean
2.22 kB
| import OAI.NumberTheory.Jacobsthal.Estimates.GateIterates | |
| namespace OAI | |
| namespace Erdos970 | |
| open scoped _root_.Erdos970 | |
| section | |
| open _root_.MeasureTheory _root_ | |
| namespace ErdosContinuousOmission | |
| open ErdosContinuousBoundary NumberTheoryLean.FinitePathGeometry | |
| theorem gate_truncatedReference (N : β) (i : Side) (r b : β) : | |
| gate (truncatedReference N) i r b= | |
| β n β Finset.range N,(-1:β)^n*boundaryTerm (n+1) i r b := by | |
| change gate (fun j s t => β n β Finset.range N,(-1:β)^n*boundaryTerm n j s t) i r b=_ | |
| rw [gate_sum N (fun n j s t => (-1:β)^n*boundaryTerm n j s t) | |
| (fun n j => continuous_const.mul (boundaryTerm_continuous n j))] | |
| apply Finset.sum_congr rfl | |
| intro n _hn | |
| rw [gate_mul] | |
| rfl | |
| theorem truncatedReference_recurrence (N : β) (i : Side) (r b : β) : | |
| truncatedReference (N+1) i r b=1-gate (truncatedReference N) i r b := by | |
| have hfirst : truncatedReference (N+1) i r b= | |
| (β n β Finset.range N,(-1:β)^(n+1)*boundaryTerm (n+1) i r b)+1 := by | |
| rw [truncatedReference,Finset.sum_range_succ'] | |
| simp only [pow_zero,show boundaryTerm 0 i r b=(1:β) by rfl,one_mul] | |
| have hs (n : β) : (-1:β)^(n+1)*boundaryTerm (n+1) i r b= | |
| -((-1:β)^n*boundaryTerm (n+1) i r b) := by rw [pow_succ]; ring | |
| rw [hfirst] | |
| simp_rw [hs] | |
| rw [Finset.sum_neg_distrib,β gate_truncatedReference] | |
| ring | |
| theorem boundaryReference_recurrence (i : Side) (r b : β) : | |
| boundaryReference i r b=1-gate boundaryReference i r b := by | |
| let N := referenceDepth r | |
| have hN : 2 β€ N := (referenceDepth_bounds r).1 | |
| have hrN : r β€ (N:β)-1 := (referenceDepth_bounds r).2 | |
| have hq : boundaryReference i r b=truncatedReference (N+1) i r b := | |
| boundaryReference_eq_truncated (N+1) (by omega) i (by push_cast; linarith) | |
| have hchild : gate boundaryReference i r b=gate (truncatedReference N) i r b := by | |
| unfold gate | |
| apply intervalIntegral.integral_congr | |
| intro x hx | |
| rw [uIcc_of_le (upperCutoff_bounds i r b).1] at hx | |
| dsimp only | |
| rw [boundaryReference_eq_truncated N hN i.flip (by linarith [hx.1] : r-x β€ (N:β)-1)] | |
| rw [hq,truncatedReference_recurrence,β hchild] | |
| end ErdosContinuousOmission | |
| end | |
| end Erdos970 | |
| end OAI | |