1. Base Case Verification:
- For ∣L∣=1, there are no triangles formed, hence no discs.
- For ∣L∣=2, there are still no triangles formed, hence no discs.
- For ∣L∣=3, exactly one triangle is formed by the three lines, and thus one disc is inscribed in this triangle. The formula 2(∣L∣−1)(∣L∣−2) gives 2(3−1)(3−2)=1, which matches our observation.
2. Inductive Step:
- Assume the formula holds for ∣L∣=n, i.e., the number of discs intersected by no line in L is 2(n−1)(n−2).
- Consider ∣L∣=n+1. The n+1-th line intersects each of the n lines in n distinct points, creating n segments and two half-lines.
- Each of these n segments creates a new finite region. Thus, the total number of finite regions formed by n+1 lines is:
n+2(n−1)(n−2)=2n(n−1)
- Each of these finite regions contains exactly one disc that is inscribed in a triangle formed by three of its sides.
3. Lemma:
- Inside each convex polygon formed by the lines, there is exactly one disc that is tangent to three of its sides.
- Proof of Lemma:
- Start with a small circle tangent to one side e1 of the polygon.
- Homothetically expand the circle until it touches another side e2.
- Let A be the intersection of the lines determined by e1 and e2. Expand the circle from A until it touches a third side e3.
- The circle is now tangent to three sides, forming a triangle △MNP.
- If the circle is not the incircle of △MNP, it must be an ex-circle. Continue expanding the circle until it touches another side e4.
- This process continues, increasing the radius of the circle until it must stop, at which point the circle is inscribed in a triangle formed by three sides of the polygon.
- To prove uniqueness, assume there are two such discs. The larger disc must be inside the triangle formed by the smaller disc, leading to a contradiction. Hence, there is exactly one such disc.
4. Conclusion:
- The total number of discs intersected by no line in L is given by the formula 2(∣L∣−1)(∣L∣−2).
The final answer is 2(∣L∣−1)(∣L∣−2)