Mrs. Miniver's Problem¶
The placement problem for two circles of fixed radii in which the area of their intersection lens must equal the area of their symmetric difference.
Core Idea¶
Mrs. Miniver's problem asks how to place two circles of fixed radii so their intersection lens has the same area as their symmetric difference—the regions inside exactly one disk. If I is intersection area, I=area(A)+area(B)−2I, so the lens is one third of the two disk areas summed and one half of their union.
With radii fixed, center distance controls overlap. Circular-segment formulas generally yield a transcendental equation solved numerically, and extreme radius ratios can make the target impossible.
For equal circles, the solution places centers about 0.529864 radii apart. Uniform resizing preserves this normalized distance because every relevant area scales by the square of the common length factor.
Unequal circles require radius-ratio-specific feasibility analysis and careful numerical solution.
Scope of Application¶
It applies when two disk radii are fixed and center separation is chosen to satisfy the exact area balance.
- Recreational geometry — A visual puzzle becomes a precise set-area equation.
- Circle intersections — Circular segments express the shared lens as separation changes.
- Numerical analysis — A bracketed root solver handles the transcendental relation.
- Feasibility analysis — Radius-ratio bounds determine whether a solution exists.
- Scale invariance — Uniform resizing preserves normalized separation and overlap fraction.
- Set geometry — Intersection, union, and symmetric difference organize the regions.
Other shapes or overlap fractions are related generalizations, not literal instances of the named problem.
Clarity¶
Mrs. Miniver's Problem separates intersection, symmetric difference, and union. Set algebra shows that the lens equals half the union, preventing a drawing from substituting for the constraint. It also reduces placement to one essential variable: translations and rotations do not alter area, so fixed radii leave center distance to determine the solution.
Manages Complexity¶
Two disks create multiple arcs, sectors, triangles, and crescents. The abstraction collapses them into two radii, one separation, a lens-area function, and one equality. This keeps the nonlinear difficulty visible: elementary regions can produce a transcendental equation, so numerical solution is appropriate rather than evidence that the geometry was formulated incorrectly.
Abstract Reasoning¶
Use set-area translation, variable reduction, and feasibility-bounded root finding. Convert the prose to area(A∩B)=area(A△B), derive the target lens fraction, express the lens with circular segments, and solve for center distance. Verify the root lies within intersection bounds and reproduces the equality; check radius ratio before assuming a solution exists.
Knowledge Transfer¶
The method transfers literally to rescaled circles and unequal-radius instances inside the feasible range. For other shapes or target fractions, only the set-algebra and numerical strategy transfers. The literary relationship analogy motivates the name but does not become social advice. The current DAG leaves the problem as an approved unparented root; circle, intersection, equality, scale invariance, and root finding remain related abstractions.
Relationships to Other Abstractions¶
Current abstraction Mrs. Miniver's Problem Domain-specific
Parents (1) — more general patterns this builds on
-
Mrs. Miniver's Problem is a kind of Computational problem Domain-specific
Mrs. Miniver's Problem is a strict kind of Computational problem: it specifies circle radii and asks for a placement satisfying one exact area equality.
Hierarchy path (1) — routes to 1 parentless root
- Mrs. Miniver's Problem → Computational problem → Function (Mapping)
Neighborhood in Abstraction Space¶
Mrs. Miniver's Problem sits in a sparse region of the domain-specific corpus (95th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Unclustered & Miscellaneous (2551 abstractions)
Nearest neighbors
- Desargues's Theorem — 0.78
- Disk-Covering Problem — 0.78
- Karlsruhe Metric — 0.77
- Tarski's Plank Problem — 0.77
- Rhombus — 0.77
Computed from structural-signature embeddings · 2026-10-08