Carlyle Circle¶

A coefficient-defined circle whose intersections with the horizontal axis geometrically realize the real roots of a normalized quadratic equation.

Version: v2 · 2026-09-06 · History
Domain-specific #: 1437
Origin domain: coordinate geometry
Subdomain: geometric equation solving

Core Idea¶

For a normalized quadratic equation

\[ x^2-sx+p=0, \]

the Carlyle circle is the circle with diameter endpoints \(A=(0,1)\) and \(B=(s,p)\). Its equation can be written

\[ x(x-s)+(y-1)(y-p)=0. \]

Setting \(y=0\) gives exactly \(x^2-sx+p=0\). Therefore the horizontal coordinates of the circle's intersections with the x-axis are the real roots of the quadratic.^[1]^[2]

The abstraction is a coefficient-to-geometry encoding: the sum and product of roots determine a diameter, and axis incidence decodes the roots. It links algebraic solvability to straightedge-and-compass construction. DeTemple used Carlyle circles systematically in constructions of regular polygons, demonstrating that the device is more than one isolated diagram.^[3]

The circle represents real roots as real intersections. A tangent x-axis corresponds to a repeated real root; no real intersection corresponds to a negative discriminant. Complex-root extensions require a modified interpretation and are not silently included in the basic construction.

Structural Signature¶

Recognition roles:

Normalized quadratic: monic form \(x^2-sx+p=0\).
Coefficient pair: \(s\) is the root sum and \(p\) the root product.
Fixed endpoint: \(A=(0,1)\) supplies the unit reference.
Coefficient endpoint: \(B=(s,p)\) carries both coefficients.
Diameter circle: the circle has \(AB\) as diameter.
Horizontal decoder: intersections with \(y=0\) return root coordinates.
Incidence classification: two, one, or zero real intersections match positive, zero, or negative discriminant.
Constructive use: constructible coefficients make the relevant circle and real roots constructible.

Recognition test. Substitute \(y=0\) into the diameter-circle equation. If the resulting polynomial is the intended normalized quadratic, the construction is a Carlyle circle. A circle merely passing through plotted roots is not enough.

What It Is Not¶

A Carlyle circle is not the graph of the quadratic function; that graph is a parabola. It is not any circle associated with a polynomial, and not a numerical root-finding iteration. It is a particular geometric encoding determined by coefficient data.

It is not a claim that every quadratic has two constructible real roots. Negative discriminant yields no real x-axis intersections. It is not Lill's method in full generality, which geometrically treats polynomials of arbitrary degree. The quadratic case is historically related, but the named circle has its own diameter prescription.

It is also not Mohr's circle. Both encode algebraic quantities in a circle, but Mohr's circle represents tensor transformation and stress extrema; Carlyle's encodes quadratic roots.

Scope of Application¶

The immediate application is geometric solution of monic real quadratics. A general quadratic \(ax^2+bx+c=0\) with \(a\ne0\) can first be normalized, giving \(s=-b/a\) and \(p=c/a\). If those signed lengths are constructible, the endpoints and circle can be constructed.

The method appears in pedagogical treatments of graphical quadratic solutions and in straightedge-and-compass constructions of regular polygons. DeTemple analyzed sequences of Carlyle circles for polygon constructions, including Fermat-prime cases.^[3] The device is useful when algebraic subproblems reduce to repeated extraction of roots of quadratics.

The construction also separates constructibility from numerical approximation. When \(s\) and \(p\) have already been produced as constructible signed lengths, midpoint, perpendicular, and circle operations remain within Euclidean construction. The theorem does not claim those coefficients arise constructibly in every problem; that obligation belongs to the surrounding derivation. This boundary explains why Carlyle circles fit nested quadratic extensions used for constructible polygons but cannot bypass general algebraic obstructions.

Clarity¶

The construction makes Vieta's relations visible. If the x-intersections are \(x_1,x_2\), then the decoded quadratic has \(x_1+x_2=s\) and \(x_1x_2=p\). The center is \((s/2,(1+p)/2)\), and the radius is half the distance between \((0,1)\) and \((s,p)\).

Clarity requires signed coordinates. Negative \(s\) or \(p\) are placed on the corresponding axes, not treated as impossible lengths. A ruler-and-compass implementation must explain how signed algebraic data are represented by directed segments.

Manages Complexity¶

The circle turns the quadratic formula into an incidence construction. Once the two endpoints are placed, one circle and its intersections encode both roots simultaneously. Repeated algebraic root extractions in polygon construction can be represented by a chain of such geometric steps.

This compression does not remove prerequisites. Normalization, coefficient construction, and intersection construction remain. For approximate drawings, graphical readout can be inaccurate; the abstraction's exact force belongs to ideal Euclidean construction and algebraic verification.

The representation also offers error checking. A proposed diameter can be tested by substituting its endpoint coordinates into the dot-product equation. The sum and product of any recovered intercepts must reproduce \(s\) and \(p\). These redundant checks make the construction useful pedagogically: geometric incidence, coordinate algebra, and Vieta's relations all verify the same result.

Abstract Reasoning¶

The diameter condition yields the equation through orthogonality: a point \((x,y)\) on the circle satisfies \((x,y-1)\cdot(x-s,y-p)=0\). Restricting to \(y=0\) gives the polynomial. This proves the decoding invariant rather than relying on a diagram.

The discriminant is also geometrized. The distance from the center to the x-axis compared with the radius determines whether the axis cuts, touches, or misses the circle. Algebraically those cases correspond to \(s^2-4p>0\), \(=0\), or \(<0\). Thus the same object provides roots and a real-root existence diagnostic.

Conversely, two real numbers chosen as x-intercepts determine their monic quadratic through sum and product, and hence determine the corresponding Carlyle construction. This bidirectional reasoning shows that the circle is not an arbitrary picture added after solving: the algebraic coefficient data and geometric incidence data encode one another. Care is still required with degenerate endpoint configurations; the equation, rather than visual intuition alone, supplies the authoritative test.

Knowledge Transfer¶

Literal transfer occurs among quadratic subproblems and polygon constructions that preserve coefficient endpoints, diameter, and axis decoding. One can rescale or translate coordinate conventions if the derivation is adjusted and the root readout remains exact.

The parent Representation transfers broadly; the Carlyle name does not. Using a circle to visualize cyclic processes is not an instance. Even another geometric solution of a quadratic is a sibling unless it uses this coefficient-to-diameter invariant.

Transfer into dynamic-geometry software is literal when the program constructs the same endpoints and circle and treats the intersections as exact dependent objects. Transfer into a hand-drawn classroom demonstration is also literal at the conceptual level, though measured coordinates are approximate. A spreadsheet plot of a parabola is not literal transfer because it changes the representing locus and decoding rule.

Examples¶

Two real roots. For \(x^2-5x+6=0\), take \(A=(0,1)\) and \(B=(5,6)\). Setting \(y=0\) in the circle equation gives \(x^2-5x+6=0\), so intersections occur at \(x=2\) and \(x=3\).

Repeated root. For \(x^2-4x+4=0\), endpoints are \((0,1)\) and \((4,4)\). The circle is tangent to the x-axis at \((2,0)\), representing the double root \(2\).

Pentagon subproblem. Values \(2\cos(2\pi/5)\) and \(2\cos(4\pi/5)\) satisfy a quadratic such as \(x^2+x-1=0\) under the standard pairing. Constructing its Carlyle circle supplies lengths used in a regular-pentagon construction.^[3] The polygon is downstream; the circle's identity remains the quadratic decoder.

Structural Tensions¶

Exact construction versus approximate drawing: Euclidean incidence is exact, while a sketch gives noisy roots. Diagnostic: state whether the output is ideal construction or measured approximation.
Elegant encoding versus limited degree: the method is compact for quadratics but does not directly solve general higher-degree equations. Diagnostic: inspect polynomial degree and any valid reduction to quadratics.
Real geometry versus complex roots: missing intersections correctly signal no real roots but do not display complex roots in the basic plane. Diagnostic: evaluate the discriminant before interpreting intersections.
Autonomy versus reduction: Representation gives encoding, but not the coefficient endpoint or axis-root invariant. Diagnostic: remove those two roles; if the circle becomes generic visualization, the residual is autonomous.

Structural–Framed Character¶

The device is highly structural: coefficients, coordinates, incidence, and polynomial identity completely specify it. Its frame is elementary algebraic and constructive geometry. It carries no evaluative or institutional content, but its specialist coordinate vocabulary does not travel intact beyond mathematics.

Structural Core vs. Domain Accent¶

The portable core is translating algebraic solutions into intersections of a geometric locus. The domain accent is the monic quadratic, Vieta coefficients, prescribed diameter, and x-axis decoding. Removing those yields generic visualization.

Recurrence in polygon construction remains a reuse of one Euclidean-algebraic tool, not cross-substrate prime evidence.

prime:representation is the minimal parent because the circle encodes a quadratic and makes roots readable as geometry. prime:transformation is related to the algebra-to-geometry conversion, while prime:constraint appears through incidence. Only Representation is proposed.

Relationships to Other Abstractions¶

Current abstraction Carlyle Circle Domain-specific

Parents (1) — more general patterns this builds on

Carlyle Circle is a kind of Representation Prime

prime:representation is the minimal parent because the circle encodes a quadratic and makes roots readable as geometry.

Hierarchy path (1) — routes to 1 parentless root

Carlyle Circle → Representation → Abstraction

Neighborhood in Abstraction Space¶

Carlyle Circle sits in a sparse region of the domain-specific corpus (68^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Applied Linear & Special Functions (18 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-09-08

Not to Be Confused With¶

Quadratic formula: an algebraic expression for roots rather than a geometric construction.
Lill's method: a broader graphical method for polynomial equations.
Mohr's circle: a stress-transformation representation.
Parabola graph: the function graph whose x-intercepts are roots, not the diameter circle.
Circle of Apollonius: a distance-ratio locus with different defining data.
Regular-polygon construction: an application that may use many Carlyle circles.

References¶

[1] Eric W. Weisstein, “Carlyle Circle,” MathWorld—A Wolfram Web Resource. https://mathworld.wolfram.com/CarlyleCircle.html registry ↩

[2] E. John Hornsby Jr., “Geometrical and Graphical Solutions of Quadratic Equations,” The College Mathematics Journal 21, no. 5 (1990), 362–378. https://doi.org/10.1080/07468342.1990.11973334 registry ↩

[3] Duane W. DeTemple, “Carlyle Circles and the Lemoine Simplicity of Polygon Constructions,” The American Mathematical Monthly 98, no. 2 (1991), 97–108. https://www.jstor.org/stable/2323939 registry ↩a ↩b ↩c