Intersection Study Guide

📖 Core Concepts Intersection – the set of elements that satisfy all given conditions simultaneously. In Euclidean geometry it is the common point(s) where objects meet (e.g., two non‑parallel lines). Uniqueness – there is exactly one intersection set for any collection of objects; it may be empty. Empty intersection ⇔ the objects are disjoint (no common element). Set‑theoretic definition: $A \cap B = \{\,x \mid x\in A \text{ and } x\in B\,\}$. Geometric view: intersecting flats (lines, planes, etc.) yields a lower‑dimensional object (point, line, curve). 📌 Must Remember Commutative: $A \cap B = B \cap A$. Associative: $(A \cap B) \cap C = A \cap (B \cap C)$. Distributive over union: $A \cap (B \cup C) = (A \cap B) \cup (A \cap C)$. Parallel lines → no intersection (empty set). Line–sphere: 0, 1, or 2 intersection points depending on distance to center. Line–plane: intersect at a single point unless the line is parallel to the plane. Intersection of two surfaces can be a curve (e.g., plane ∩ sphere = circle). 🔄 Key Processes Set intersection: List elements common to all sets. Linear geometric intersection: Write equations for each object (e.g., line: $\mathbf{r}= \mathbf{p}+t\mathbf{d}$; plane: $\mathbf{n}\cdot\mathbf{x}=c$). Solve the resulting linear system for the coordinates. Line–conic intersection: Substitute line parametric equations into conic equation → quadratic in the parameter. Solve the quadratic (discriminant tells 0, 1, or 2 points). Numerical solution (Newton iteration): When analytic solution is messy, iterate $x{k+1}=xk-\frac{f(xk)}{f'(xk)}$ until convergence. 🔍 Key Comparisons Line–line vs. line–plane Line–line: single point or empty (parallel). Line–plane: always a point unless line ∥ plane → empty. Empty intersection vs. disjoint sets Empty intersection is the result; disjoint describes the relationship of the original sets. Analytic vs. numerical intersection Analytic (solve algebraic equations) – exact, works for low-degree problems. Numerical (Newton, etc.) – approximate, needed for high-degree or implicit surfaces. ⚠️ Common Misunderstandings “Intersection always exists.” Wrong – parallel lines or a line parallel to a plane give an empty set. Confusing “union” with “intersection.” Union $\cup$ gathers all elements; intersection $\cap$ keeps only common elements. Assuming a line‑sphere intersection is always two points. It can be 0 (misses sphere) or 1 (tangent). 🧠 Mental Models / Intuition Venn‑diagram overlay: Think of stacking shapes; the overlapping region is the intersection. Logical AND: Each condition must be true simultaneously – like a checklist where all items must be checked. Dimensional reduction: Intersecting two objects “drops” dimensions (line ∩ plane → point; plane ∩ sphere → curve). 🚩 Exceptions & Edge Cases Parallel but coincident lines: Infinite intersection (the whole line) – still a valid (non‑empty) set. Tangent cases: Exactly one intersection point (line‑sphere, line‑plane). Degenerate objects: Intersecting a point with any set yields either that point (if it belongs) or empty. 📍 When to Use Which Use set‑theoretic definition when dealing with abstract collections or proving properties (commutative, associative). Apply linear algebra for intersecting flats (lines, planes, hyperplanes) → set up and solve linear equations. Switch to quadratic solving for line ∩ conic or line ∩ sphere problems. Choose Newton iteration when the equations are non‑linear and no closed‑form solution is feasible. 👀 Patterns to Recognize Zero/One/Two point pattern for line‑sphere or line‑circle: check distance $d$ from line to center vs. radius $r$ → $d>r$ → 0 points, $d=r$ → 1 (tangent), $d<r$ → 2 points. Parallelism → empty intersection – always test for parallel direction vectors or normal vectors before solving. Distributive pattern: When a set appears inside a union, you can distribute intersection to simplify (e.g., $A\cap(B\cup C)$). 🗂️ Exam Traps Choosing “union” instead of “intersection.” The wording “both” or “and” signals $\cap$, not $\cup$. Assuming parallel lines intersect at infinity. In Euclidean geometry the intersection is empty, not a point at infinity. Missing the tangent case. A line just touching a sphere/plane yields a single point, not two. Neglecting associativity: $A\cap B\cap C$ can be evaluated in any order; forgetting this may lead to unnecessary extra work. Misreading “disjoint” as “no overlap at all” vs. “empty intersection” – they are equivalent but the term “disjoint” describes the sets, not the result.