Direct Proof

The sum of two rationals r1=p1q1r_1 = \frac{p_1}{q_1}, r2=p2q2r_2 = \frac{p_2}{q_2} on a number line, with the computation p1q2+p2q1q1q2\frac{p_1 q_2 + p_2 q_1}{q_1 q_2} running straight from hypothesis to conclusion — that is a direct proof.

r1+r2=p1q2+p2q1q1q2r_1 + r_2 = \frac{p_1 q_2 + p_2 q_1}{q_1 q_2}
34+−56=−112\frac{3}{4} + \frac{-5}{6} = -\frac{1}{12}

Examples & Exercises

Prove by a direct proof that the sum of two rational numbers is rational, and verify each step on this scene's default numbers r1=34r_1 = \frac34, r2=−56r_2 = -\frac56, confirming the sum is −112-\frac{1}{12} step by step.

r1=p1q1, r2=p2q2  ⇒  r1+r2=p1q2+p2q1q1q2r_1 = \frac{p_1}{q_1},\ r_2 = \frac{p_2}{q_2} \;\Rightarrow\; r_1 + r_2 = \frac{p_1 q_2 + p_2 q_1}{q_1 q_2}
p1=3p_1 = 3, q1=4q_1 = 4, p2=−5p_2 = -5, q2=6q_2 = 6: numerator 18−20=−218 - 20 = -2, denominator 2424, gcd⁡(2,24)=2\gcd(2, 24) = 2, reduced −112≈−0.083333-\frac{1}{12} \approx -0.083333.
Show proof
  1. Take the hypothesis: since r1,r2r_1, r_2 are rational, there exist integers p1,q1,p2,q2p_1, q_1, p_2, q_2 with q1≠0q_1 \ne 0, q2≠0q_2 \ne 0 such that r1=p1q1r_1 = \frac{p_1}{q_1} and r2=p2q2r_2 = \frac{p_2}{q_2}. A direct proof feeds this assumption straight into a computation.
  2. Use a common denominator: r1+r2=p1q2q1q2+p2q1q1q2=p1q2+p2q1q1q2r_1 + r_2 = \frac{p_1 q_2}{q_1 q_2} + \frac{p_2 q_1}{q_1 q_2} = \frac{p_1 q_2 + p_2 q_1}{q_1 q_2}. The numerator p1q2+p2q1p_1 q_2 + p_2 q_1 is a sum of products of integers, hence an integer; the denominator q1q2q_1 q_2 is a product of nonzero integers, hence a nonzero integer. So r1+r2r_1 + r_2 is a ratio of integers — rational. That completes the direct proof. On the scene's numbers: 3⋅6+(−5)⋅44⋅6=18−2024=−224=−112≈−0.083333\frac{3 \cdot 6 + (-5) \cdot 4}{4 \cdot 6} = \frac{18 - 20}{24} = \frac{-2}{24} = -\frac{1}{12} \approx -0.083333.
    34+−56=−224=−112\frac{3}{4} + \frac{-5}{6} = \frac{-2}{24} = -\frac{1}{12}

Prove by a direct proof that the product of two rational numbers is rational. Then prove that the square of a rational number is rational, and verify on the scene's numbers r1=34r_1 = \frac34, r2=−56r_2 = -\frac56 that the product is −58-\frac58.

r1r2=p1p2q1q2,r12=p12q12r_1 r_2 = \frac{p_1 p_2}{q_1 q_2}, \qquad r_1^2 = \frac{p_1^2}{q_1^2}
p1=3p_1 = 3, q1=4q_1 = 4, p2=−5p_2 = -5, q2=6q_2 = 6: product −1524=−58=−0.625-\frac{15}{24} = -\frac58 = -0.625.
Show proof
  1. Assume r1=p1q1r_1 = \frac{p_1}{q_1}, r2=p2q2r_2 = \frac{p_2}{q_2} (integers, q1,q2≠0q_1, q_2 \ne 0). Multiplying gives r1r2=p1p2q1q2r_1 r_2 = \frac{p_1 p_2}{q_1 q_2}. The numerator p1p2p_1 p_2 is an integer and the denominator q1q2q_1 q_2 is a nonzero integer, so the product is rational. On the scene's numbers: 3⋅(−5)4⋅6=−1524=−58=−0.625\frac{3 \cdot (-5)}{4 \cdot 6} = \frac{-15}{24} = -\frac58 = -0.625 (dividing numerator and denominator by 3).
  2. The square is a special case of the product: if r=pqr = \frac{p}{q} with q≠0q \ne 0, then r2=p2q2r^2 = \frac{p^2}{q^2}, and p2p^2 is an integer while q2q^2 is a positive integer (hence ≠0\ne 0), so r2r^2 is rational. Example: r12=(34)2=916r_1^2 = \left(\frac34\right)^2 = \frac{9}{16}. Both claims are proved by a single computation running straight from hypothesis to conclusion — the typical shape of a direct proof.

Prove by a direct proof that if an integer nn is odd then n2n^2 is odd: write n=2k+1n = 2k + 1 and expand to show (2k+1)2=4k2+4k+1=2(2k2+2k)+1(2k+1)^2 = 4k^2 + 4k + 1 = 2(2k^2 + 2k) + 1.

n=2k+1  ⇒  n2=(2k+1)2=4k2+4k+1=2(2k2+2k)+1n = 2k + 1 \;\Rightarrow\; n^2 = (2k+1)^2 = 4k^2 + 4k + 1 = 2(2k^2 + 2k) + 1
This problem is about an algebraic proof for odd nn — the preset is a valid scene combination, r1=r2=12r_1 = r_2 = \frac12.
Show proof
  1. Assume nn is odd. By the definition of odd, there is an integer kk with n=2k+1n = 2k + 1. Now compute: n2=(2k+1)2=4k2+4k+1n^2 = (2k+1)^2 = 4k^2 + 4k + 1.
  2. Group the even part: 4k2+4k+1=2(2k2+2k)+14k^2 + 4k + 1 = 2(2k^2 + 2k) + 1. Since 2k2+2k2k^2 + 2k is an integer, n2n^2 is "twice an integer, plus one" — odd. One expansion carried us from hypothesis to conclusion, so this is a direct proof. (Note: this lemma is exactly what the next scene, contrapositive, consumes — the proof of "n2n^2 even ⇒\Rightarrow nn even" reduces to its contrapositive "nn odd ⇒\Rightarrow n2n^2 odd", whose proof is precisely this direct proof.)

1. Foundations of Proof