Pascal's theorem#Hexagrammum Mysticum

The most natural setting for Pascal's theorem is in a projective plane since any two lines meet and no exceptions need to be made for parallel lines. However, the theorem remains valid in the Euclidean plane, with the correct interpretation of what happens when some opposite sides of the hexagon are parallel.

If exactly one pair of opposite sides of the hexagon are parallel, then the conclusion of the theorem is that the "Pascal line" determined by the two points of intersection is parallel to the parallel sides of the hexagon. If two pairs of opposite sides are parallel, then all three pairs of opposite sides form pairs of parallel lines and there is no Pascal line in the Euclidean plane (in this case, the line at infinity of the extended Euclidean plane is the Pascal line of the hexagon).

Pascal's theorem is the polar reciprocal and projective dual of Brianchon's theorem. It was formulated by Blaise Pascal in a note written in 1639 when he was 16 years old and published the following year as a broadside titled "Essay pour les coniques. Par B. P."{{harvnb|Pascal|1640}}, translation {{harvnb|Smith|1959|p=326}}

Pascal's theorem is a special case of the Cayley–Bacharach theorem.

A degenerate case of Pascal's theorem (four points) is interesting; given points {{math|ABCD}} on a conic {{math|Γ}}, the intersection of alternate sides, {{math|AB ∩ CD}}, {{math|BC ∩ DA}}, together with the intersection of tangents at opposite vertices {{math|(A, C)}} and {{math|(B, D)}} are collinear in four points; the tangents being degenerate 'sides', taken at two possible positions on the 'hexagon' and the corresponding Pascal line sharing either degenerate intersection. This can be proven independently using a property of pole-polar. If the conic is a circle, then another degenerate case says that for a triangle, the three points that appear as the intersection of a side line with the corresponding side line of the Gergonne triangle, are collinear.

Six is the minimum number of points on a conic about which special statements can be made, as five points determine a conic.

The converse is the Braikenridge–Maclaurin theorem, named for 18th-century British mathematicians William Braikenridge and Colin Maclaurin {{harv|Mills|1984}}, which states that if the three intersection points of the three pairs of lines through opposite sides of a hexagon lie on a line, then the six vertices of the hexagon lie on a conic; the conic may be degenerate, as in Pappus's theorem.{{harvs|txt|last1=Coxeter|first1 = H. S. M. | authorlink1 = Harold Scott MacDonald Coxeter | last2 = Greitzer | first2 = Samuel L. | authorlink2 = Samuel L. Greitzer| |year=1967|p=76}} The Braikenridge–Maclaurin theorem may be applied in the Braikenridge–Maclaurin construction, which is a synthetic construction of the conic defined by five points, by varying the sixth point.

The theorem was generalized by August Ferdinand Möbius in 1847, as follows: suppose a polygon with {{math|4n + 2}} sides is inscribed in a conic section, and opposite pairs of sides are extended until they meet in {{math|2n + 1}} points. Then if {{math|2n}} of those points lie on a common line, the last point will be on that line, too.

If six unordered points are given on a conic section, they can be connected into a hexagon in 60 different ways, resulting in 60 different instances of Pascal's theorem and 60 different Pascal lines. This configuration of 60 lines is called the Hexagrammum Mysticum.{{harvnb|Young|1930|p=67}} with a reference to Veblen and Young, Projective Geometry, vol. I, p. 138, Ex. 19.{{harvnb|Conway|Ryba|2012}}

As Thomas Kirkman proved in 1849, these 60 lines can be associated with 60 points in such a way that each point is on three lines and each line contains three points. The 60 points formed in this way are now known as the Kirkman points.{{harvnb|Biggs|1981}} The Pascal lines also pass, three at a time, through 20 Steiner points. There are 20 Cayley lines which consist of a Steiner point and three Kirkman points. The Steiner points also lie, four at a time, on 15 Plücker lines. Furthermore, the 20 Cayley lines pass four at a time through 15 points known as the Salmon points.{{harvnb|Wells|1991|p=172}}

Pascal's original note has no proof, but there are various modern proofs of the theorem.

It is sufficient to prove the theorem when the conic is a circle, because any (non-degenerate) conic can be reduced to a circle by a projective transformation. This was realised by Pascal, whose first lemma states the theorem for a circle. His second lemma states that what is true in one plane remains true upon projection to another plane. Degenerate conics follow by continuity (the theorem is true for non-degenerate conics, and thus holds in the limit of degenerate conic).

A short elementary proof of Pascal's theorem in the case of a circle was found by {{harvtxt|van Yzeren|1993}}, based on the proof in {{harv|Guggenheimer|1967}}. This proof proves the theorem for circle and then generalizes it to conics.

A short elementary computational proof in the case of the real projective plane was found by {{harvtxt|Stefanovic|2010}}.

We can infer the proof from existence of isogonal conjugate too. If we are to show that {{math|X {{=}} AB ∩ DE}}, {{math|Y {{=}} BC ∩ EF}}, {{math|Z {{=}} CD ∩ FA}} are collinear for concyclic {{math|ABCDEF}}, then notice that {{math|△EYB}} and {{math|△CYF}} are similar, and that {{math|X}} and {{math|Z}} will correspond to the isogonal conjugate if we overlap the similar triangles. This means that {{math|∠CYX {{=}} ∠CYZ}}, hence making {{math|XYZ}} collinear.

A short proof can be constructed using cross-ratio preservation. Projecting tetrad {{math|ABCE}} from {{math|D}} onto line {{math|AB}}, we obtain tetrad {{math|ABPX}}, and projecting tetrad {{math|ABCE}} from {{math|F}} onto line {{math|BC}}, we obtain tetrad {{math|QBCY}}. This therefore means that {{math|R(AB; PX) {{=}} R(QB; CY)}}, where one of the points in the two tetrads overlap, hence meaning that other lines connecting the other three pairs must coincide to preserve cross ratio. Therefore, {{math|XYZ}} are collinear.

Another proof for Pascal's theorem for a circle uses Menelaus' theorem repeatedly.

Dandelin, the geometer who discovered the celebrated Dandelin spheres, came up with a beautiful proof using "3D lifting" technique that is analogous to the 3D proof of Desargues' theorem. The proof makes use of the property that for every conic section we can find a one-sheet hyperboloid which passes through the conic.

There also exists a simple proof for Pascal's theorem for a circle using the law of sines and similarity.

File:THPascal.svg hexagon {{math|ABCDEF}} (right) lie on the Pascal line MNP (left).]]

Pascal's theorem has a short proof using the Cayley–Bacharach theorem that given any 8 points in general position, there is a unique ninth point such that all cubics through the first 8 also pass through the ninth point. In particular, if 2 general cubics intersect in 8 points then any other cubic through the same 8 points meets the ninth point of intersection of the first two cubics. Pascal's theorem follows by taking the 8 points as the 6 points on the hexagon and two of the points (say, {{math|M}} and {{math|N}} in the figure) on the would-be Pascal line, and the ninth point as the third point ({{math|P}} in the figure). The first two cubics are two sets of 3 lines through the 6 points on the hexagon (for instance, the set {{math|AB, CD, EF}}, and the set {{math|BC, DE, FA}}), and the third cubic is the union of the conic and the line {{math|MN}}. Here the "ninth intersection" {{math|P}} cannot lie on the conic by genericity, and hence it lies on {{math|MN}}.

The Cayley–Bacharach theorem is also used to prove that the group operation on cubic elliptic curves is associative. The same group operation can be applied on a conic if we choose a point {{math|E}} on the conic and a line {{math|MP}} in the plane. The sum of {{math|A}} and {{math|B}} is obtained by first finding the intersection point of line {{math|AB}} with {{math|MP}}, which is {{math|M}}. Next {{math|A}} and {{math|B}} add up to the second intersection point of the conic with line {{math|EM}}, which is {{math|D}}. Thus if {{math|Q}} is the second intersection point of the conic with line {{math|EN}}, then

:$(A\; +\; B)\; +\; C\; =\; D\; +\; C\; =\; Q\; =\; A\; +\; F\; =\; A\; +\; (B\; +\; C)$

Thus the group operation is associative. On the other hand, Pascal's theorem follows from the above associativity formula, and thus from the associativity of the group operation of elliptic curves by way of continuity.

Suppose {{math|f}} is the cubic polynomial vanishing on the three lines through {{math|AB, CD, EF}} and {{math|g}} is the cubic vanishing on the other three lines {{math|BC, DE, FA}}. Pick a generic point {{math|P}} on the conic and choose {{math|λ}} so that the cubic {{math|h {{=}} f + λg}} vanishes on {{math|P}}. Then {{math|h {{=}} 0}} is a cubic that has 7 points {{math|A, B, C, D, E, F, P}} in common with the conic. But by Bézout's theorem a cubic and a conic have at most 3 × 2 = 6 points in common, unless they have a common component. So the cubic {{math|h {{=}} 0}} has a component in common with the conic which must be the conic itself, so {{math|h {{=}} 0}} is the union of the conic and a line. It is now easy to check that this line is the Pascal line.

Again given the hexagon on a conic of Pascal's theorem with the above notation for points (in the first figure), we have{{cite web|url=http://www.cut-the-knot.org/Generalization/OverlookedPascal.shtml|title=A Property of Pascal's Hexagon Pascal May Have Overlooked|date= 2014-02-03}}

:$\backslash frac\{\backslash overline\{GB\}\}\{\backslash overline\{GA\}\}\; \backslash times\; \backslash frac\{\backslash overline\{HA\}\}\{\backslash overline\{HF\}\}\; \backslash times\; \backslash frac\{\backslash overline\{KF\}\}\{\backslash overline\{KE\}\}\; \backslash times\backslash frac\{\backslash overline\{GE\}\}\{\backslash overline\{GD\}\}\; \backslash times\; \backslash frac\{\backslash overline\{HD\}\}\{\backslash overline\{HC\}\}\; \backslash times\; \backslash frac\{\backslash overline\{KC\}\}\{\backslash overline\{KB\}\}=1.$

File:Pascal-3456.png

There exist 5-point, 4-point and 3-point degenerate cases of Pascal's theorem. In a degenerate case, two previously connected points of the figure will formally coincide and the connecting line becomes the tangent at the coalesced point. See the degenerate cases given in the added scheme and the external link on circle geometries. If one chooses suitable lines of the Pascal-figures as lines at infinity one gets many interesting figures on parabolas and hyperbolas.

• Desargues's theorem
• Brianchon's theorem
• Unicursal hexagram

{{reflist}}

• {{citation

| last = Biggs | first = N. L. | author-link = Norman L. Biggs

| doi = 10.1112/blms/13.2.97

| issue = 2

| journal = Bulletin of the London Mathematical Society

| mr = 608093

| pages = 97–120

| title = T. P. Kirkman, mathematician

| volume = 13

| year = 1981}}

• {{citation | last1 = Conway | first1 = John | author-link1 = John Horton Conway | last2 = Ryba | first2 = Alex | title = The Pascal Mysticum Demystified | journal = The Mathematical Intelligencer | pages = 4–8 | year = 2012 | volume = 34 | issue = 3| doi = 10.1007/s00283-012-9301-4 | s2cid = 122915551 }}
• {{citation | last1 = Coxeter | first1 = H. S. M. | author-link1 = Harold Scott MacDonald Coxeter | last2 = Greitzer | first2 = Samuel L. | author-link2 = Samuel L. Greitzer | title = Geometry Revisited | location = Washington, DC | publisher = Mathematical Association of America | page = 76 | year = 1967}}
• {{citation | last1=Guggenheimer | first1=Heinrich W. | title=Plane geometry and its groups | publisher=Holden–Day Inc. | location=San Francisco, Calif. |mr=0213943 | year=1967}}
• {{citation | title = Note on the Braikenridge–Maclaurin Theorem | first = Stella | last = Mills | journal = Notes and Records of the Royal Society of London | volume = 38 | issue = 2 |date=March 1984 | pages = 235–240 | publisher = The Royal Society | doi = 10.1098/rsnr.1984.0014 | jstor = 531819 | s2cid = 144663075 }}
• {{eom|title=Pascal theorem|first=P.S. |last=Modenov|first2=A.S. |last2=Parkhomenko}}
• {{cite web

| last = Pascal

| first = Blaise

| title =Essay pour les coniques

| publisher = Niedersächsiche Landesbibliothek, Gottfried Wilhelm Leibniz Bibliothek

| year = 1640

| url = http://digitale-sammlungen.gwlb.de/index.php?id=6&no_cache=1&tx_dlf%5Bid%5D=548&tx_dlf%5Bpage%5D=19&cHash=7c32039131e4b3387740fbc6c9fd1cb8

| format = facsimile

| access-date = 21 June 2013 }}

• {{citation|last=Smith|first=David Eugene|title=A Source Book in Mathematics|publisher=Dover|place=New York|year=1959|isbn=0-486-64690-4|url=https://books.google.com/books?id=awAfO7Ff_z0C&q=smith+source+book}}
• {{citation | last1=Stefanovic | first1=Nedeljko | title=A very simple proof of Pascal's hexagon theorem and some applications| url=http://www.ias.ac.in/mathsci/vol120/nov2010/pm-10-00024.PDF | year=2010| publisher=Indian Academy of Sciences}}
• {{citation|last=Wells|first=David|title=The Penguin Dictionary of Curious and Interesting Geometry|year=1991|publisher=Penguin Books|place=London|isbn=0-14-011813-6|url-access=registration|url=https://archive.org/details/penguindictionar0000well}}
• {{citation|last=Young|first=John Wesley|title=Projective Geometry|year=1930|publisher=The Mathematical Association of America|series=The Carus Mathematical Monographs, Number Four}}
• {{citation | last1=van Yzeren | first1=Jan | title=A simple proof of Pascal's hexagon theorem |mr=1252929 | year=1993 | journal=The American Mathematical Monthly | issn=0002-9890 | volume=100 | issue=10 | pages=930–931 | doi=10.2307/2324214 | publisher=Mathematical Association of America | jstor=2324214}}

{{Commons category|Pascal's hexagram}}

• [http://www.cut-the-knot.org/Curriculum/Geometry/Pascal.shtml Interactive demo of Pascal's theorem (Java required)] at cut-the-knot
• [http://www.cut-the-knot.org/Curriculum/Geometry/PascalLines.shtml 60 Pascal Lines (Java required)] at cut-the-knot
• [https://archive.today/20121129152851/http://www.math.uregina.ca/~fisher/Norma/paper.html The Complete Pascal Figure Graphically Presented] by J. Chris Fisher and Norma Fuller (University of Regina)
• [http://www.mathematik.tu-darmstadt.de/~ehartmann/circlegeom.pdf Planar Circle Geometries, an Introduction to Moebius-, Laguerre- and Minkowski Planes] (PDF; 891 kB), Uni Darmstadt, S. 29–35.
• [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.665.5892&rep=rep1&type=pdf How to Project Spherical Conics into the Plane] by Yoichi Maeda (Tokai University)

{{Blaise Pascal}}

{{Authority control}}

Category:Blaise Pascal

Category:Conic sections

Category:Theorems in projective geometry

Category:Articles containing proofs

Category:Theorems about polygons

Category:Euclidean plane geometry