The (real) projective plane is often motivated by the issue of lines in $\mathbb R^2$ having exactly one intersection, except in the case of parallel lines. The solution is to mimic what we see when we stand on the plane and see parallel train tracks on the ground: add "points at infinity"/"at the horizon" (using the language of perspective in art), one in each possible direction of a line. By construction, all lines have 1 intersection (the "correct number").
In higher dimensions, the construction is still to add a point at infinity for every possible direction of a line, so that all parallel lines of that direction intersect once at that newly added point at infinity.
I also understand that another major part of projective spaces is projective duality. Still, this is about linear things (affine linear subspaces).
What I'm bothered by is the apparent miracle, that spaces constructed to make linear things work well (e.g. the initial motivation of making sure parallel lines intersect, or the "richer" observation of duality), somehow work well for many other things. For example, in the simplest non-trivial example of conic sections, with these extra points at infinity, all the conic sections now look like simple loops!
Is there any intuition that tells us why making things nice for lines, also makes everything else nice too? (I'm aware that another point brought up is that projective spaces are compact, and hence projective spaces will have the nice properties that compactness bestows. But there are many ways of making affine space compact, so again it's not clear why this specific compactification is so magical.)
Some further remarks/"analogies" to better contextualize my question, and to paint a picture of what type of answer I might be looking for:
I'm reminded of a similar phenomenon for algebraic closedness of $\mathbb C$: adding in the points needed to solve quadratic equations over $\mathbb R$, somehow we get enough to solve all polynomial equations! With the technology of Galois and group theory, we see that this miracle boils down to
(1) Every polynomial of odd degree in $\mathbb{R}[X]$ has a root in $\mathbb{R}$.
(2) Every polynomial of degree 2 in $\mathbb{C}[X]$ has a root in $\mathbb{C}$.
(or as a comment pointed out, and explained in this answer, further reduced to just the fact that $\mathbb R$ is a "ordered field in which every positive element has a square root and every odd degree polynomial has a root"). Although still an amazing fact, these answers investigate the miracle piece by piece and lay out clearly the foundational facts on which standard machinery (which one can develop completely independent of the miracle) can produce the result.
I'm also reminded of examples of limits in multivariable calculus where approaching along straight lines things are fine, but along polynomial or other curves, the limit doesn't exist. So somehow lines are "enough" for projective spaces, but not "enough" for even basic limits in multiple variables. Of course the "analogy" is bad, but I write it to point out it's reasonable to expect that a situation which works well for lines may not work well at all for higher degree polynomials.
EDIT 2/7/24: I've been reading the book Ideals, Varieties, and Algorithms and in particular the proof of Bezout's theorem using resultants. The fundamental difference between ordinary polynomials and homogeneous polynomials is that the resultant for the latter, with $f$ of degree $n$ and $g$ of degree $m$, has degree exactly $mn$, whereas the resultant for ordinary polynomials may have "perfect cancellation" and end up with a lower degree than $mn$. For example, taking the resultant of $f=y^{2}+\left(2\sqrt{3}x-2\sqrt{3}\right)y+3x^{2}+2x$ and $g=\left(1+\epsilon \right)y^{2}+\left(2\sqrt{3}x-\left(4-2\sqrt{3}\right)\right)y+\left(3x^{2}-\left(4\sqrt{3}+2\right)x\right)=0$ is degree $2$ for $\epsilon=0$, but otherwise degree $4$ (the expected number). So somehow homogeneous polynomials are better algebraically behaved, perhaps captured by the idea of "grading" (e.g. for a homogeneous polynomial in $k[x,y,z]$ of degree $d$, the coefficients (in $k[x,y]$) of all $z^k$ terms is guaranteed to be a homogeneous polynomial in $k[x,y]$ of degree $d-k$).
Also, geometrically, it seems like "generically" (in the sense of $\epsilon$-perturbations of the coefficients like I did above) we get the correct counts over $\mathbb C$, and bringing $\epsilon \searrow 0$, the only issue is that some intersection points run away to infinity. So yes it is an issue with the noncompactness of affine space. But the reason lines suffice is somehow that when intersection points run away in this setting, they run away "polynomially" and that is well-behaved enough that having an observer standing one unit in a new orthogonal direction looking "down at the 2D-ground" their line of sight following the point running away doesn't move so much, and in fact converges to a horizontal line of sight. E.g. the point can not run off to infinity an any wild oscillatory/spiral path (in those situations the line of sight would not converge). This heuristic seems to be supported by Bezout's theorem itself, since Bezout's theorem tells us that algebraic curves can not have infinite oscillations or spirals.
However, I still feel like these 2 reasons (algebraic and geometric) that I have provided are somewhat artificial. It does not give the air of some beautiful philosophy about the "true nature"/"soul" of projective space.
A friend also pointed out that perhaps there is a "good reason" that things intersect at all in projective space: Reference request for the dimension of intersection of affine varieties tells us that if the intersection of 2 varieties over affine space intersect once, then they do so "many times" (with a lower bound on the dimension of the intersection space). Projective space extends curves in affine space to be "cones" intersecting at a point (that is by construction fundamentally what projective space does: project everything through one point), and so now the intersection theorem applies and tells us we should have one line of intersection, corresponding to a point of intersection in projective space.
This I think is a pretty substantial part, but of course it doesn't say anything about capturing all the intersections, just at least one.