Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
Read this false proof carefully.
Claim. For every : if lines in the plane are such that no two are parallel, then all lines pass through one point.
Proof. For , two lines that are not parallel meet in a point. Assume the claim for lines, and take lines , no two parallel. By the hypothesis, pass through one point , and pass through one point . The lines pass through both and , so , and all lines pass through it.
Check an answer or open a hint to unlock the worked solution.
Have you tried it?
Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.
Step 1. Part (a). The lines , and are not parallel in pairs. The first two meet at , which is not on . So the three lines do not share a point.
Step 2. Part (b). The argument " pass through both and , so " needs at least two shared lines, since two different lines meet in exactly one point. For the shared group is alone. One line passes through many points, so and can be different. The step fails at , that is from lines to .
Step 3. Part (c). At the groups and share line.
Step 4. Part (d). For the groups share at least two lines, so and the step is valid. But the chain needs every link. With the link from to broken, the true case never reaches , and nothing beyond it is proved.
Watch out. This is the same error as in the proof that all horses have one colour.
Answer: the step fails at , where the two groups share only line.
Log in to join the discussion.
Loading…
A valid induction needs a true base case. The step must work for every from the base case on, the smallest too. A step that looks back further needs more base cases. The step ends at and never starts from it.