Markov. The set {X≥a} is an event, since {X≥a}=⋂j∈N{X>a−1/j} and each {X>a−1/j}∈F by Measurable Function and Real-Valued Measurable Function. Pointwise,
a1{X≥a}(ω) ≤ X(ω),
since the left side is a≤X(ω) on the event and 0≤X(ω) off it. The left side is a nonnegative simple function with integral aP(X≥a); by monotonicity of the nonnegative integral (claim 1 of Linearity and Monotonicity of the Lebesgue Integral) and Expectation, Variance, and Moments,
aP(X≥a) ≤ E[X],
and dividing by a>0 gives Markov's inequality (trivially valid when E[X]=∞).
Chebyshev. Let μ=E[X] and Y=(X−μ)2, a nonnegative random variable (a random variable by Step 0(a) of the proof of Linearity and Monotonicity of the Lebesgue Integral and the power argument of Expectation, Variance, and Moments) with E[Y]=Var(X), finite by hypothesis. Since ∣X−μ∣≥a holds exactly when Y≥a2, Markov's inequality applied to Y with threshold a2 gives
P(∣X−μ∣≥a)=P(Y≥a2) ≤ a2E[Y]=a2Var(X).■