Which type of proof uses boxes and arrows to show the logical connections between statements?
2 answers:
You might be interested in
Consider the contrapositive of the statement you want to prove.
The contrapositive of the logical statement
<em>p</em> ⇒ <em>q</em>
is
¬<em>q</em> ⇒ ¬<em>p</em>
In this case, the contrapositive claims that
"If there are no scalars <em>α</em> and <em>β</em> such that <em>c</em> = <em>α</em><em>a</em> + <em>β</em><em>b</em>, then <em>a₁b₂</em> - <em>a₂b₁</em> = 0."
The first equation is captured by a system of linear equations,
or in matrix form,
If this system has no solution, then the coefficient matrix on the right side must be singular and its determinant would be
and this is what we wanted to prove. QED