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.

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.

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. The device is useful when algebraic subproblems reduce to repeated extraction of roots of quadratics.

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.

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.

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.

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.

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

• Quadratic Equation — 0.91
• Quadratic Space — 0.86
• Polynomial Ring — 0.85
• Divisor Function — 0.84
• Polynomial Chaos Expansion — 0.83

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