Let two triples of projective lines meet in nine distinct points. Any plane cubic containing eight contains all nine. To prove this, write the triples as and , with the missing point on . The candidate cubic agrees with a scalar multiple of on , so . Its three known zeros on force . Two remaining known zeros on force the linear factor to be a multiple of . Hence and vanishes at the missing point.
A two-cell-thick strip of triangles with degree-six vertices in a dual arrangement of a planar point set produces three indexed primal point families with collinearities whenever . A plane cubic can be fitted to nine initial points because its homogeneous coefficient space has dimension ten. Overlapping nine-point configurations then force each next point onto the same cubic by eight-point cubic completion for two triples of lines. Safe neighbourhoods guarantee the distinctness needed in these local completion steps. A possible seed is . Adjacent completion blocks force , followed by the alternating continuation along the two long transverse families.
Articles by others on the same topic
There are currently no matching articles.