---

Step * 1 2 of Lemma partition-sum-bound-no-mc


1. I : Interval
2. icompact(I)
3. f : I ⟶ℝ
4. b : {b:ℝ| (r0 ≤ b) ∧ (∀x:ℝ. ((x ∈ I) ⇒ (|f x| ≤ b)))} 
5. p : partition(I)
6. y : partition-choice(full-partition(I;p))
7. a : ℕ||p|| + 1 ⟶ {x:ℝ| x ∈ I} 
8. y = a ∈ (ℕ||p|| + 1 ⟶ {x:ℝ| x ∈ I} )
9. ||full-partition(I;p)|| = (||p|| + 2) ∈ ℤ
10. Σ{|(f (a i)) * (full-partition(I;p)[i + 1] - full-partition(I;p)[i])| | 0≤i≤||full-partition(I;p)|| - 2} ≤ Σ{b
* (full-partition(I;p)[i + 1] - full-partition(I;p)[i]) | 0≤i≤||full-partition(I;p)|| - 2}
⊢ Σ{|(f (a i)) * (full-partition(I;p)[i + 1] - full-partition(I;p)[i])| | 0≤i≤||full-partition(I;p)|| - 2} ≤ (b * |I|)
BY
{ (RWO "-1" 0 THENA Auto) }

1
1. I : Interval
2. icompact(I)
3. f : I ⟶ℝ
4. b : {b:ℝ| (r0 ≤ b) ∧ (∀x:ℝ. ((x ∈ I) ⇒ (|f x| ≤ b)))} 
5. p : partition(I)
6. y : partition-choice(full-partition(I;p))
7. a : ℕ||p|| + 1 ⟶ {x:ℝ| x ∈ I} 
8. y = a ∈ (ℕ||p|| + 1 ⟶ {x:ℝ| x ∈ I} )
9. ||full-partition(I;p)|| = (||p|| + 2) ∈ ℤ
10. Σ{|(f (a i)) * (full-partition(I;p)[i + 1] - full-partition(I;p)[i])| | 0≤i≤||full-partition(I;p)|| - 2} ≤ Σ{b
* (full-partition(I;p)[i + 1] - full-partition(I;p)[i]) | 0≤i≤||full-partition(I;p)|| - 2}
⊢ Σ{b * (full-partition(I;p)[i + 1] - full-partition(I;p)[i]) | 0≤i≤||full-partition(I;p)|| - 2} ≤ (b * |I|)

---

Latex:

---

Latex:

1.  I  :  Interval
2.  icompact(I)
3.  f  :  I  {}\mrightarrow{}\mBbbR{}
4.  b  :  \{b:\mBbbR{}|  (r0  \mleq{}  b)  \mwedge{}  (\mforall{}x:\mBbbR{}.  ((x  \mmember{}  I)  {}\mRightarrow{}  (|f  x|  \mleq{}  b)))\} 
5.  p  :  partition(I)
6.  y  :  partition-choice(full-partition(I;p))
7.  a  :  \mBbbN{}||p||  +  1  {}\mrightarrow{}  \{x:\mBbbR{}|  x  \mmember{}  I\} 
8.  y  =  a
9.  ||full-partition(I;p)||  =  (||p||  +  2)
10.  \mSigma{}\{|(f  (a  i))
*  (full-partition(I;p)[i  +  1]  -  full-partition(I;p)[i])|  |  0\mleq{}i\mleq{}||full-partition(I;p)||  -  2\}  \mleq{}  \mSigma{}\{b
*  (full-partition(I;p)[i  +  1]  -  full-partition(I;p)[i])  |  0\mleq{}i\mleq{}||full-partition(I;p)||  -  2\}
\mvdash{}  \mSigma{}\{|(f  (a  i))
*  (full-partition(I;p)[i  +  1]  -  full-partition(I;p)[i])|  |  0\mleq{}i\mleq{}||full-partition(I;p)||  -  2\}  \mleq{}  (b
*  |I|)


By

---

Latex:
(RWO  "-1"  0  THENA  Auto)

---

Home Index