Step
*
2
2
1
of Lemma
slln-lemma1
.....assertion.....
1. p : FinProbSpace
2. f : ℕ ⟶ ℕ
3. X : n:ℕ ⟶ RandomVariable(p;f[n])
4. s : ℚ
5. k : ℚ
6. ∀n:ℕ. ∀i:ℕn. f[i] < f[n]
7. ∀n:ℕ. ((E(f[n];X[n]) = 0 ∈ ℚ) ∧ (E(f[n];(x.x * x) o X[n]) = s ∈ ℚ) ∧ (E(f[n];(x.(x * x) * x * x) o X[n]) = k ∈ ℚ))
8. ∀n:ℕ. ∀i:ℕn. rv-disjoint(p;f[n];X[i];X[n])
9. 0 ≤ s
10. B : ℚ
11. k ≤ B
12. s ≤ B
⊢ ∀n:ℕ
((E(f[n];(x.(x * x) * x * x) o rv-partial-sum(n;i.X[i])) ≤ (((3 * s) + 1) * B * n * n))
∧ (E(f[n];(x.x * x) o rv-partial-sum(n;i.X[i])) ≤ (B * n)))
BY
{ InductionOnNat
⋅ }
1
.....basecase.....
1. p : FinProbSpace
2. f : ℕ ⟶ ℕ
3. X : n:ℕ ⟶ RandomVariable(p;f[n])
4. s : ℚ
5. k : ℚ
6. ∀n:ℕ. ∀i:ℕn. f[i] < f[n]
7. ∀n:ℕ. ((E(f[n];X[n]) = 0 ∈ ℚ) ∧ (E(f[n];(x.x * x) o X[n]) = s ∈ ℚ) ∧ (E(f[n];(x.(x * x) * x * x) o X[n]) = k ∈ ℚ))
8. ∀n:ℕ. ∀i:ℕn. rv-disjoint(p;f[n];X[i];X[n])
9. 0 ≤ s
10. B : ℚ
11. k ≤ B
12. s ≤ B
⊢ (E(f[0];(x.(x * x) * x * x) o rv-partial-sum(0;i.X[i])) ≤ (((3 * s) + 1) * B * 0 * 0))
∧ (E(f[0];(x.x * x) o rv-partial-sum(0;i.X[i])) ≤ (B * 0))
2
.....upcase.....
1. p : FinProbSpace
2. f : ℕ ⟶ ℕ
3. X : n:ℕ ⟶ RandomVariable(p;f[n])
4. s : ℚ
5. k : ℚ
6. ∀n:ℕ. ∀i:ℕn. f[i] < f[n]
7. ∀n:ℕ. ((E(f[n];X[n]) = 0 ∈ ℚ) ∧ (E(f[n];(x.x * x) o X[n]) = s ∈ ℚ) ∧ (E(f[n];(x.(x * x) * x * x) o X[n]) = k ∈ ℚ))
8. ∀n:ℕ. ∀i:ℕn. rv-disjoint(p;f[n];X[i];X[n])
9. 0 ≤ s
10. B : ℚ
11. k ≤ B
12. s ≤ B
13. n : ℤ
14. [%9] : 0 < n
15. (E(f[n - 1];(x.(x * x) * x * x) o rv-partial-sum(n - 1;i.X[i])) ≤ (((3 * s) + 1) * B * (n - 1) * (n - 1)))
∧ (E(f[n - 1];(x.x * x) o rv-partial-sum(n - 1;i.X[i])) ≤ (B * (n - 1)))
⊢ (E(f[n];(x.(x * x) * x * x) o rv-partial-sum(n;i.X[i])) ≤ (((3 * s) + 1) * B * n * n))
∧ (E(f[n];(x.x * x) o rv-partial-sum(n;i.X[i])) ≤ (B * n))
3
.....wf.....
1. p : FinProbSpace
2. f : ℕ ⟶ ℕ
3. X : n:ℕ ⟶ RandomVariable(p;f[n])
4. s : ℚ
5. k : ℚ
6. ∀n:ℕ. ∀i:ℕn. f[i] < f[n]
7. ∀n:ℕ. ((E(f[n];X[n]) = 0 ∈ ℚ) ∧ (E(f[n];(x.x * x) o X[n]) = s ∈ ℚ) ∧ (E(f[n];(x.(x * x) * x * x) o X[n]) = k ∈ ℚ))
8. ∀n:ℕ. ∀i:ℕn. rv-disjoint(p;f[n];X[i];X[n])
9. 0 ≤ s
10. B : ℚ
11. k ≤ B
12. s ≤ B
13. n : ℤ
14. 0 < n
⊢ istype((E(f[n - 1];(x.(x * x) * x * x) o rv-partial-sum(n - 1;i.X[i])) ≤ (((3 * s) + 1) * B * (n - 1) * (n - 1)))
∧ (E(f[n - 1];(x.x * x) o rv-partial-sum(n - 1;i.X[i])) ≤ (B * (n - 1))))
4
.....wf.....
1. p : FinProbSpace
2. f : ℕ ⟶ ℕ
3. X : n:ℕ ⟶ RandomVariable(p;f[n])
4. s : ℚ
5. k : ℚ
6. ∀n:ℕ. ∀i:ℕn. f[i] < f[n]
7. ∀n:ℕ. ((E(f[n];X[n]) = 0 ∈ ℚ) ∧ (E(f[n];(x.x * x) o X[n]) = s ∈ ℚ) ∧ (E(f[n];(x.(x * x) * x * x) o X[n]) = k ∈ ℚ))
8. ∀n:ℕ. ∀i:ℕn. rv-disjoint(p;f[n];X[i];X[n])
9. 0 ≤ s
10. B : ℚ
11. k ≤ B
12. s ≤ B
13. n : ℕ
14. (E(f[0];(x.(x * x) * x * x) o rv-partial-sum(0;i.X[i])) ≤ (((3 * s) + 1) * B * 0 * 0))
∧ (E(f[0];(x.x * x) o rv-partial-sum(0;i.X[i])) ≤ (B * 0))
15. ∀n:{n:ℤ| 0 < n}
(((E(f[n - 1];(x.(x * x) * x * x) o rv-partial-sum(n - 1;i.X[i])) ≤ (((3 * s) + 1) * B * (n - 1) * (n - 1)))
∧ (E(f[n - 1];(x.x * x) o rv-partial-sum(n - 1;i.X[i])) ≤ (B * (n - 1))))
⇒ ((E(f[n];(x.(x * x) * x * x) o rv-partial-sum(n;i.X[i])) ≤ (((3 * s) + 1) * B * n * n))
∧ (E(f[n];(x.x * x) o rv-partial-sum(n;i.X[i])) ≤ (B * n))))
⊢ λn.((E(f[n];(x.(x * x) * x * x) o rv-partial-sum(n;i.X[i])) ≤ (((3 * s) + 1) * B * n * n))
∧ (E(f[n];(x.x * x) o rv-partial-sum(n;i.X[i])) ≤ (B * n))) ∈ ℕ ⟶ ℙ
Latex:
Latex:
.....assertion.....
1. p : FinProbSpace
2. f : \mBbbN{} {}\mrightarrow{} \mBbbN{}
3. X : n:\mBbbN{} {}\mrightarrow{} RandomVariable(p;f[n])
4. s : \mBbbQ{}
5. k : \mBbbQ{}
6. \mforall{}n:\mBbbN{}. \mforall{}i:\mBbbN{}n. f[i] < f[n]
7. \mforall{}n:\mBbbN{}
((E(f[n];X[n]) = 0)
\mwedge{} (E(f[n];(x.x * x) o X[n]) = s)
\mwedge{} (E(f[n];(x.(x * x) * x * x) o X[n]) = k))
8. \mforall{}n:\mBbbN{}. \mforall{}i:\mBbbN{}n. rv-disjoint(p;f[n];X[i];X[n])
9. 0 \mleq{} s
10. B : \mBbbQ{}
11. k \mleq{} B
12. s \mleq{} B
\mvdash{} \mforall{}n:\mBbbN{}
((E(f[n];(x.(x * x) * x * x) o rv-partial-sum(n;i.X[i])) \mleq{} (((3 * s) + 1) * B * n * n))
\mwedge{} (E(f[n];(x.x * x) o rv-partial-sum(n;i.X[i])) \mleq{} (B * n)))
By
Latex:
InductionOnNat
\mcdot{}
Home
Index