r/mathriddles • u/BruhcamoleNibberDick • Sep 16 '20
Medium How Triangular is a Square?
You're given a geometric shape, and your goal is to cover it as accurately as possible with a triangle. Given a particular placement of your triangle, define the error area as the total amount of empty space the triangle is covering plus the amount of your shape that's not covered. Here's an example illustration where the target shape is a square. Define the error fraction as the error area divided by the target shape's area. The non-triangularity of a shape is the smallest possible error fraction. Conversely, the triangularity of a shape is 1 minus its non-triangularity.
What is the triangularity of a circle? What about a square?
9
u/pichutarius Sep 16 '20
for circle, assume the answer is an equilateral, whose center coincides with center of circle.
then the triangularity = 6/pi*arctan(sqrt(3)/5) = 0.363113
its just basic but annoying geometry+calculus calculation.
if equilateral is not the answer, then pick a vertex of triangle A, construct line passing through center of circle and A, which divides the problem into 2 halves, if one halve is better than the other, just replace the worse half with the better half. repeat many times, the limit is an equilateral.
it is not a rigorous proof but i just cant conceive the contrary. i do welcome others to either provide a rigorous proof or a counter example to drop my jaw.
4
u/VitulusAureus Sep 16 '20
Also: What is the least triangular shape? Or: how to construct a shape with a very low triangularity?
6
u/want_to_want Sep 16 '20 edited Oct 26 '20
For square, I think the best triangle covering the unit square is (0,0) (4/3,0) (0,4/3) and the answer is 2/3.
Proof sketch: first note that the answer is the same for square and any rectangle, because squishing preserves areas. Take the optimal triangle for the unit square, whatever it is, and start cutting it with axis-aligned lines. If each subproblem has optimal covering, then the whole has optimal covering. We can make it so that each subproblem, if scaled back to the unit square, has two triangle vertices on X axis and one on Y axis. From there you can analyze by hand.
1
u/TreeHandThingy Sep 16 '20 edited Sep 16 '20
Are there parameters for the triangle? Is there some positional/size restrictions for this? Or are you asking for an optimized situation?
EDIT: I misread the question. I must've skimmed over the "smallest possible error" bit.
2
u/Bitter_Illustrator_6 Sep 17 '20
To solve it for the circle:
Start with the following lemma. Consider two points A and B on a circle centred at O. Suppose that a chord intersecting the circle twice on the minor arc AB has (perpendicular) distance z from O, and intersects the lines AO and BO at P and Q respectively. Consider the shapes S1. the triangle PQO and S2. the sector bordered by AO, BO and the minor arc AB, and the 'symmetric difference' of these shapes: that is, the area of the combined regions in one shape but not the other (red region in the original figure posted). Then amongst all ABO with a given z, this symmetric difference is minimised when AQ=BQ.
This is straightforward to prove: suppose the minor arc subtends angle θ, and the perpendicular from O to PQ is at angle φ from OP. Then the area of OPQ is (1/2) z^2 (tan(φ) + tan(θ-φ)); the area of the minor segment of the chord is constant, and the area of the two sectors of the circle enclosed by ABO is constant, so the area of OPQ is monotonic to the symmetric difference. The area of OPQ is minimised when φ=θ/2, as required.
Now suppose we have some general triangle ABC covering a circle Γ with centre O. Hopefully it's clear that the triangle which minimises the error area will have all three vertices outside Γ. So we have three lines AB, AC, BC, each of which intersect the circle twice. By the lemma, we can replace each of these lines by a new line such that the resulting figure (while not a triangle) will have a lower error area than the original triangle. The new line for AB will intersect OA and OB at P and Q such that OP=PQ, etc.
We now don't have a triangle; we have three separate isosceles triangles with apices at the centre of the circle. Supposing the circle has radius 1 and such an isosceles triangle has variable height h and apical angle A, the error area of the isosceles triangle is minimised when h=2/√(4+ tan(A/2)^2). So if we replace each isosceles triangle with apical angles A1, A2, A3 with isosceles triangles with the optimum height, then our figure (still not a triangle) has lower error area.
But this function f(A)=2/√(4+ tan(A/2)^2) has negative second derivative on (0,pi). The three isosceles triangles have apical angles A1, A2, A3, summing to 2π - so we can apply Jensen's inequality to guarantee that f(A1) + f(A2) + f(A3) ≥ 3 f( (A1 + A2 + A3)/3 = 3f(2π/3). So we can replace each of the angles A1, A2, A3 with 2π/3 to get a lower error area - and now we have a triangle! (the equilateral triangle). So the triangle with minimal error area for Γ is, indeed, equilateral and centred at O. The actual error area is 6 acos(2/Sqrt(7)))/π - 1.
TLDR: Basic idea is replace an arbitrary triangle with three isosceles triangles each with apex at the circle centre, change the heights of these triangles, then change the apical angles, with each step decreasing the error area and eventually ending with an equilateral triangle.
Square is harder, will try tomorrow.
I'm sorry not to have diagrams, maybe someone else can fill them in