Moser’s Worm is an important unsolved problem in geometry with a very amusing name. The name comes from an odd hypothetical. Suppose you have an inch-long pet worm, who’s a very restless sleeper. When the worm goes to bed, there’s no way of knowing how it might be twisted or curved. Nonetheless, you want to cover your worm with a little blanket. What’s the smallest blanket you could use, regardless of how the worm is positioned?
Although many unsolved problems in mathematics are known for their incomprehensibility, the standard statement of Moser’s worm only requires requires one definition:
A set of points (in euclidean 2D space) Aaccommodates a set B when there is a set B’ such that B’⊆A, and B’ is congruent to B.
Equivalently, a set of points Aaccommodates a set B when there is a set A’ such that B⊆A’, and A’ is congruent to A.
For these notes, A accommodates B will sometimes be notated with A⊒B. If B does not accommodate A, then we write A⊐B
From here on out, I might be a little bit looser. I’ll be certain to eliminate ambiguity whenever necesary, but the point of these notes is mostly to ensure that these concepts are written down somewhere they’re easy to locate later on, without necessarily being up to the hyper-rigorous standards of mathematical publication. This is my website, after all. Without further ado, here’s the statement of the problem:
Question 1 What is the smallest convex shape that can accommodate any curve of length 1?
It’s a shockingly simple question for something that has remained unsolved for so long! Although my background is in mathematics, and I studied differential geometry in my undergrad, this question in particular is one I don’t know a lot about. It’s a bit refreshing to work on something unrelated to what you normally do, so I’m looking forward to it! I should mention that I’m deliberately not looking into the already existing body of work on this problem. This is partly for my own satisfaction of discovering things for myself, and partly to avoid bias. Although I don’t suppose that I could fully crack an infamous problem outside my own specialty, it can still be very invigorating for a field to get a fresh pair of eyes and a fresh perspective.
There’s also the second benefit of writing an article on a subject from an outsider’s perspective, which is that it should be very approachable for the reader. Because I don’t know any of the jargon, techniques, or theorems in this field, I can’t possibly confuse a reader by using them. That said, I will use some basic calculus at a couple points.
My goal here is to see what curves we don’t need to worry about. There’s two prongs to this:
Show that curve A is always accommodated when curve B is accommodated.
Show that when curves A and B are accommodated, curve C is also accommodated.
To that end, we give these definitions:
Given a shape a, the convex hull of a will be noted [a].
The length of a curve X will be noted ℓX. The section of an open curve X between two points a and b will be noted with Xab, so that the length of an open curve between between two points a and b will be noted with ℓXab.
For any set of points p1,p2…, the polygonal chain that connects each of them in order will be denoted ⟨p1,p2…⟩.
This entire problem exists in euclidean space. If d is the euclidean distance metric, and a and b are points, then ℓ⟨a,b⟩ will be used as a synonym for d(a,b)
A unit-length curve X is taut if there does not exist another unit-length curve X’ such that [X’]⊐[X].
Immediately there are some lemmas we can form regarding taut curves without any further context. For example, this is the lemma that inspired the choice of the word “taut”:
Lemma 1 If a curve experiences any non-zero curvature at a point that is not on the border of its convex hull, it is not taut.
proof: Let X be a unit-length curve, and let x be a contiguous section of X that does not touch the border of [X], except at two endpoints, a and b. Then let X’ be identical to X, except that x is replaced with a straight line from a to b. The length of X’ is necessarily less than 1, although X’ has the same convex hull. Finally, let X’’ be the unit-length curve that includes all of X’, but with an added length at the end. X’’ must have a convex hull that includes everything in [X] and more.
□
Hopefully, this drawing explains why I chose the word "taut" to describe this property. The curve on the left is "taut", in the sense that it could be stretched to coincide with the border of its convex hull, and that extra length could be used to create a larger hull. The light grey area is the same between the two shapes, but the dark grey area is added by using length more efficiently
Here’s another brief and straightforward observation about taut curves.
No self intersecting curves are taut.
Let’s start our effort to characterize taut curves with yet another definition
A Type 1 curve is a curve for which all points on the curve lie on the boundary of its convex hull.
A Type 2 curve is a curve for which there is one single segment that crosses the inside of the convex hull.
In general, a Type n curve is one with n distinct, discontinuous segments along the boundary of its convex hull, and n−1 distinct segments passing through the interior of the convex hull
An example of a Type 1 and Type 2 curve.
Type 1 and Type 2 curves can also be thought of in terms of path direction. A path along a Type 1 curve moves entirely either clockwise or counterclockwise across the edge of its convex hull. A path along a Type 2 curve starts moving either clockwise or counterclockwise along the border, but then moves in the opposite direction for a length.
Here’s a brief lemma about Type n curves that will be useful in several results coming up
Lemma 2 Let X be a taut curve, and let a and b be points on X such that Xab consists only of internal points of [X]. Xab has zero curvature.
proof: Suppose, for the sake of contradiction, that Xab does not have zero curvature. Then ℓXab>ℓ⟨a,b⟩. Let X’ be formed by replacing Xab in X with ⟨a,b⟩. It is clear that ℓX’<X, and so X is accommodated by X’, and is not taut.
□
I’ve only talked about Type 1 and Type 2 curves so far. Why hasn’t any special attention been given to curves of other types? As it turns out, these curves are never taut.
Theorem 1 There are no taut Type n curves, for n≥3.
proof: To force a contradiction, let X be such a curve. Let a, b, c, d, e, f, and g be points on X, appearing in that order, with the added requirements that:
a, b, c, d, e, f, and g are all on the boundary of [X].
a and g are the endpoints of X.
d is the point furthest from ⟨a,g⟩, on the opposite side from b and f
⟨b,c⟩ is internal to the convex hull of X.
⟨e,f⟩ is internal to the convex hull of X.
Here’s a drawing to explain.
For ease of upcoming calculations, let ⟨a,g⟩ lie on the x axis, with a existing at 0,0.
Let ϕ be the minimal distance from d to ⟨a,g⟩. It immediately follows that:
2ℓXbf≤ϕ
In this case, define a’ and g’ to be these two points:
a’=(0,−2ℓXbf)
g’=(ℓ⟨a,g⟩,−2ℓXbf)
Then we can define X’ to be the curve
X’=⟨a’,a⟩∪Xab∪⟨b,f⟩∪Xfg∪⟨g,g’⟩
This is given in the drawing below:
Because a’ and g’ are both below d, the entirety of X must be inside X’.
□
Let’s limit a bit further which curves can be Type 1.
Lemma 3 Let X be a Type 1 taut curve with endpoints a and b. Every point on X lies on a line perpendicular to ⟨a,b⟩.
proof: Let X be a curve as described above, and let c be the point on X that lies furthest from any line perpendicular to ⟨a,b⟩. without loss of generality, assume c is closer to a than it is to b.
Let α be the line that includes the line segment ⟨a,b⟩, and let c’ be the point on α closest to c. Let X’ be a curve identical to X, except that the section between c and a is replaced with a straight line between c and c’.
This situation is illustrated below:
It is clear that
ℓ⟨c,c’⟩<ℓCca
and therefore
ℓX’<ℓX
Therefore, X’ has a length less than X, and so is a unit curve. The convex hull of X’ can accommodate X, but is larger. By definition, X is not taut.
□
Finally, these past few lemmas and a few other ideas are compiled in a theorem that helps to characterize Type 1 curves:
Theorem 2 A curve X with endpoints a and b is not accommodated by a distinct Type 1 curve if and only if:
All points on X are on its convex hull.
Every point on X lies on a line perpendicular to a point on ⟨a,b⟩.
There does not exist a set of points {c,d,e,f} such that: a.⟨d,e⟩ is tangent to X. b.f is one of the end points of X. c.e is a point on X that is not an end point. d.⟨c,d⟩ is perpendicular to ⟨f,c⟩ and ⟨d,e⟩. e.ℓ⟨a,b⟩+ℓ⟨c,f⟩+ℓ⟨e,d⟩≤ℓXfe.
proof: The fist of these requirements is implied by the definition of a Type 1 curve, and the second is implied by Lemma 3. Therefore, this proof focuses on the third requirement
First, suppose that a set of points as described exists. Without loss of generality, let f=a. As before, I’ll include a diagram to clarify what the situation described in the lemma statement is.
Let X’=⟨c,a,b⟩∪Xbe∪⟨e,d⟩. As evident from the diagram, the convex hull of X’ accommodates the convex hull of X. Next, consider the inequality assumed earlier:
Therefore, [X’] both accommodates [X] and includes other area as well, but X’ is shorter than X. By definition, X is not taught.
An “if and only if” proof requires that the statement is proven in both directions, so Theorem 2 will now be proved in the opposite direction. Suppose that such a set of points as c,d,e,f does not exist, but that X1 is a Type 1 curve such that [X1]⊐X. Let c and d be the endpoints of X1. An example of what this might look like is shown below:
Next, let α be the line passing through c and d. let X2 be the shortest curve with endpoints on α that accommodates X. X2 must consist of two lines parallel to α, as well as a section of the boundary of [X], which may or may not include ⟨a,b⟩. Let c’ and d’ be the endpoints of X2, and let e and f be the points where X2 meets the convex hull of X, as shown below:
Finally, the length of X2 can be reduced even further. Let d’’ and c’’ be points on ⟨d’,e⟩ and ⟨c’,e⟩ that are both a distance ϕ away from d’ and c’, with ϕ having the largest possible value without ⟨d’’,c’’⟩ intersecting the interior of [X].
Let X3 be X2, without the lines from d’ to d’’ and from c’ to c’’. If f and e are both endpoints of X, then X3 must contain the entirety of X. This is impossible, as ℓX=1, so either e or f is not an endpoint of X.
Instead, assume (for the sake of contradiction), that neither f nor e are endpoints of X. This would require that at least one of the two points is not on a line parallel to ⟨a,b⟩.
Therefore, {c’’,f,e,d’’} satisfies the requirements of the lemma.
□
The reason I set out this lemma is because I want to demonstrate that there is a limit on the “height” of Type 1 curves. If ⟨a,b⟩ is very short, and X has a point very distant from ⟨a,b⟩, it would be easy to find a way to maximize ℓXae and minimize ℓ⟨a,c⟩
This theorem serves to characterize type 1 curves fairly precisely. One of the broader goal of this project is to characterize Type 2 curves equally as well.
Lemma 4 Let X be a taught Type 2 curve, and let a and d be the end points of X. Let b and c be the endpoints of the section of X which are internal to the convex hull of X. It it required that:
ℓ⟨b,c⟩≤ℓ⟨a,c⟩ℓ⟨b,c⟩≤ℓ⟨b,d⟩
proof: The locations of a though d can be clarified by this diagram:
Suppose for the sake of contradiction that ℓ⟨a.c⟩>ℓ⟨b,c⟩. Define X’ such that
X’=Xba∪⟨a,c⟩∪Xcd
Because ℓ⟨a,c⟩>ℓ⟨b,c⟩, ℓX’<ℓX=1. Then let X’’ be identical to X’, except that an extra bit is added to increase the area of the convex hull while keeping ℓX’’≤1. By definition, X is not taut.
By symmetry, X is also not taut if ℓ⟨b.d⟩>ℓ⟨b,c⟩.
□
The non-internal sections of a Type 2 curve behave something like Type 1 curves themselves. For example, consider the following Lemma:
Lemma 5 Let X be a taut Type 2 curve with endpoints a and d, and let b and c be the endpoints of the section of X that is internal to [X]. Let L1 be the line passing through a and c, and let L2 be the line perpendicular to ⟨b,d⟩ that passes through d. Then any point p on Xcd must lie in the triangle bound by L1, L2, and ⟨c,d⟩.
proof: First, for clarity, a diagram of these lines is shown:
First, if p is a point on Xcd that is on the “wrong” side of L1, then c is an internal point of [X]. This is not true by assumption.
The point p must be on the exterior of [X], by assumption, and so cannot be on the wrong side of ⟨c,d⟩.
Finally, suppose for the sake of contradiction that p lies on the wrong side of L2. Without loss of generality, let p specifically be the point furthest from L2. Then let p’ be the point on the line containing b and d that is closest to p. If X’=Xap⋃⟨p,p’⟩, then X’ is shorter than X. Because ⟨p,p’⟩ is perpendicular to ⟨p’,d⟩, p’ must also be further from L2 than any other point in X. Therefore, X’ accommodates X, giving a contradiction.
□
This lemma comes with a few charming corollaries:
Let X be a Type 2 curve with endpoints a and d, and let b and c be the endpoints of the section of X that is internal to [X]. Let L2 be the line perpendicular to ⟨b,d⟩ that passes through d. If p and q are points on Xcd such that ℓXqd<ℓXpd, then q is not further from L2 than p is.
Let X be a Type 2 curve with endpoints a and d, and let b and c be the endpoints of the section of X that is internal to [X]. The angles formed by ⟨c,b,d⟩ and ⟨d,a,c⟩ are acute.
Finally, we can make a little theorem effectively characterizing taut Type 2 curves.
Theorem 3 Let X be a Type 2 curve, and let a and d be the end points of X. Let b and c be the endpoints of the section of X which are internal to the convex hull of X. Let a’ be the point that is co-linear to a and c, such that ⟨a,a’,b⟩ is a right triangle. Similarly, let d’ be the point that is co-linear to b and d, such that ⟨c,d’,d⟩ is a right triangle. This is shown in the illustration below.
If X is taught, then:
ℓ⟨b,c⟩≤ℓ⟨a,c⟩
ℓ⟨b,c⟩≤ℓ⟨b,d⟩
Every point on X between c and d lies in the triangle bounded by L1, L2, and ⟨c,d⟩.
Every point on X between a and b lies in the triangle bounded by L3, L4, and ⟨a,b⟩.
If p and q are points on X between c and d, with q closer to d, then q is closer to L2.
If p and q are points on X between b and a, with q closer to a, then q is closer to L4.
Now that the framework for which curves are worth considering has been well established, let’s build up a vocabulary of specific curves to consider. First, what exactly do I mean by “curve”? In a context where curves can be translated and rotated, it makes sense to define a curve more broadly than usual.
When I refer to a curve, I actually mean the congruence class to a specific curve. The term “curve” refers only to a particular shape, and not a position.
When I wish to refer to a curve in a particular position, I’ll mention an instance of a curve. If an instance of a curve is translated, rotated, or flipped, it becomes a different instance of that curve.
As a useful convention, curves will be named in capital letters, while their instances are named in lowercase letters.
Which curves are we going to give names to? In some sense, the simplest unit-length curve is the single line segment. I don’t want to use the letter L or I for this purpose, so I’ll call this G, in reference to the French spelling of the word line, or ligne.
The curve G will refer to the straight line segment of length 1. Equivalently, G is congruent to ⟨(0,0),(1,0)⟩
There’s a bit of an opposite to G. While G has a maximum distance from end to end (or diameter), it has no width whatsoever. A correlating question would be to search for the maximum radius of a circle accomodated by a single curve’s convex hull.
The maximum radius of a circle accomodated by a single cure’s convex hull is 2+π1.
proof: Consider the circle c of radius r defined with (y−r)2+x2=(r)2. Suppose m is a curve with endpoints a and b that accomodates c with minimal length. In order to minimize the length of m, ⟨a,b⟩ must be tangent to c. Without loss of generality, let a and b lie on the x axis. The locations of a and b that minimize the length of m are directly beneath the ends of c, at (±r,0)
To minimize the size of m, assume that m is “taut” against the circle c, as shown in the drawing below:
The total length of m is therefore 2r+πr. If m is a unit length curve, then
1=2r+πr2+π1=r(2+π)=r
□
Now that that’s done, we can use this as the basis of the definition of our second useful curve!
The curve M will refer to the curve that accomodates the circle with radius 2+π1. This can be defined as the curve congruent to the set:
x=±2+π1x2+y2=(2+π)21for y∈{−∞,0}for y∈{0,r}}
That’s the largest possible circle that can be accomodated with a unit length curve, but what about the largest possible square? We might as well define it as simply as possible:
A curve S will refer to the unit length curve with three orthogonal sides of length 31. This is conruent to the curve defined by
⟨(0,0),(31,0),(31,31),(0,31)⟩
Of course, S was chosen as a name because that is the first letter of the word “square”. This shape is shown below:
What other simple curves are important enough to be given brief names? There’s a fair argument to be made that the simplest curves would be those of constant curvature, also known as arcs.
For any radius r, Let Ar be the unit length arc of a circle with radius r. Equivalently, Ar is congruent to
y=r2−x2−rsin(2rπr−1)
for y>0
It’s worth showing that the shape given in this definition does in fact have a length of 1. The two places where y=0 are given with:
One could also argue that the simplest shape to consider is two line segments meeting at a single vertex, also known as a 2-chain (no relation), with both line segments of equal length. The convex hulls of these shapes are simple triangles. From this perspective, it would only make sense to define
For any angle θ, Let Vθ be the union of two line segments of length 21 meeting at an angle of θ. Equivalently, Vθ is congruent to
⟨(−21cos2θ,0),(0,21sin2θ),(21cos2θ,0)⟩
For convenience, define E=V6π.
As you might have guessed, the name V was chosen due to its resemblance to an angle. The name E was chosen because of the similarity to an equilateral triangle. As before, it’s worthwhile to show that the length of this curve is 1. The distance between (0,21sin2θ) and (21cos2θ,0) is given by:
All of these have been type 1 curves! In a sense, the simplest type 2 curve is one that can be formed with just four points.
Let Z be 3-chain consisting of three line segments of length 31 sitting at alternating right angles to one another. More precicely, Z is congruent to
⟨(0,0),(31,0),(31,31),(32,31)⟩
Of course, this is also shown below:
A hopeful reader might wonder if this curve might in fact be accomodated by a type 1 curve. Z certainly doesn’t look like it could be accomodated by a type 1 curve, by any of the lemmas encountered earlier.
To see if it’s possible to accomodate this with a type 1 curve, let’s start by placing the Z curve on it’s side, so that the starting and ending points are on the y-axis. I will refer to this instance of Z as z, and label its points with:
I’m loath to stretch the length of this paper out any further with information the reader could easily find for themselves. That said, it is important to show that these points really do form an instance of Z. First, note that the distances between each point really does come out to ⅓.
Additionally, the slope between z1 and z2 is 1525−0−155−0=2−1. The slope between z2 and z3 is 1535−1525155+155=2. Finally, the slope between z4 and z3 is 35−15350−155=2−1. This shows that each edge is orthogonal to the previous one, confirming that this is an instance of Z.
I want to define a type 1 curve that gets very close to accomodating this. For a start, I’ll have this curve include z1, z2, and z3. This curve is shown in purple:
In order to get as close as possible to accomodating z2, we may place a single point at a distance of 32−2 from z1. The optimal point p would be the one where ⟨z1,p⟩ and ⟨p,z4⟩ are orthogonal. (trust me)
If p=(px,py), then these two requirements may be expressed as:
(px−0)2+(py−0)2=32−2
px−0py−0=−0−py35−px
If we take the first of these two equations and square both sides, this becomes:
px2+py2=96−42
Meanwhile, we multiply both sides of the other equation by pxpy to get
py2=35px−px2
Now we can plug this into the other equation for py2 and solve to get
35px=96−42px=356−42
Square this to get
px2=4568−482
Plug this and 35px into our equation for py2 to get
My plan is to spend this section establishing some useful lemmas about the convex hulls of multiple curves, as a bit of set dressing for the sections to come. The nature of this problem requires that we seek to minimize the size of a convex hull, so I’ll give a definition relating to this:
Given a set of curves {A,B,…}=Ω, let {a,b,…}=ω be a set of containing exactly one instance of each curve in ω. define [ω] to be the single convex hull of the union of ω. Define [Ω] to be the set of all possible instances of ω.
Let [ω] be a convex hull in [Ω]. We say a[ω] is minimal if it has the smallest possible area of all elements of [Ω]. The set of minimal convex hulls in [Ω] will be denoted with [Ω]−.
For convenience, we order [Ω] by area, so that it is a weakly ordered set. We use ω1≲ω2 to indicate that ω1 is smaller than or equal in size to ω2. By this ordering, [Ω]− is the set of minimal elements of [C].
Here’s the first lemma for this section:
Lemma 6
Let Ω={A,B,C,…} be a set of curves, and let ω={a,b,c,…} be a set of their instances, such that [ω]∈[Ω]−. If there is an instance of A inside [ω] that does not touch its boundary, then [ω]∈[Ω/A]−.
proof: Let a’ be the instance of A that is internal to X but does not touch its boundary, let ω’={a’,b,c,…}, and let X’ be the convex hull of the union of ω’.
It can be immediately seen by definition that ω’∈Ω, and therefore that X’∈[Ω]. Because X is a minimal element of [Ω], X≲X’. X’ contains no points outside the boundary of X, and so X≮X’.
Therefore, X’ has the same area as X. This implies that X=X’.
□
In order to produce the next lemma. we give a special definition:
Let A and B be two shapes, and let a and b be instances of those shapes. We say that a and b are fully intersecting if there exists no linear translation of a, called a’, such that [b∪a’] is a strict subset of [b∪a]
It should be noted that “fully intersecting” and minimal are not the same thing. Given two shapes A and B, and a pair of instances a and b, it is possible that a and b may be fully intersecting, even if [a,b]∈[A,B]−. On the other hand, it is true that if a and b are not fully intersecting, then [a,b]∈[A,B]−.
This definition comes with an almost immediate lemma:
Lemma 7 Let Ω be a set of curves, and let ω be a set of their instances. If A and B are elements of Ω, then [ω] accomodates some pair of instances a and b, where a and b are fully intersecting.
proof:
Let a,b∈ω. First, we know that [ω]⊒[a,b]. We also know that if a and b are not fully intersecting, they at least have a fully intersecting pair of linear transformations, a’ and b’, such that [a,b]⊒[a’,b’]. By the transitive property, [ω]⊒[a’,b’]
□
We can extend this lemma just a little bit further, finally reaching a theorem about the nature of minimal convex hulls.
Theorem 4 Let Ω be a set of curves. If ω is a set of instances, such that [ω]∈[Ω]−, then every pair of elements in ω are fully intersecting.
proof:
Let ω be such that [ω]∈[Ω]−. In order to force a contradiction, assume that there exists a,b∈ω such that a and b are not fully intersecting. Because of Lemma 6, we may assume that both a and b touch the boundary of [ω]. In fact, they both extend the boundary of [ω], meaning that removing them would result in a smaller overall convex hull.
Let’s assume (WLOG) that a’ is a linear transformation of a, such that a’⊏[a,b]. Let ω’ be formed by replacing a in ω with a’. Note that, by the definition of fully intersecting, [a,b]⊒[a’b], and therefore, [ω]⊒[ω’]. This means that if there is any point on the boundary of [ω] that is not present in [ω’], then [ω]⊐[ω’]. But this cannot be the case if [ω]∈[Ω]−, so it must be that [ω]=[ω’].
We now know that there are some points present in [a,b] that are absent in [a’,b], but that none of these points are on the boundary of [ω]. As mentioned, a lies on the boundary of [ω]. If a’ is also on the boundary of [ω], that means that a must not have actually expanded the boundary of [ω]. This also violates the spirit of Lemma 6, giving a contradiction.
□
For this lemma to be maximally useful, it’s a good idea to characterize better what makes two curves fully intersecting.
Theorem 4½ Let c and d be closed convex shapes, neither of which is a subset of the other, and neither of which has an area of 0. Suppose also that the boundaries of c and d intersect at fewer than three points.
If [c,d]/(c∪d) is discontinuous, c and d are not fully intersecting.
proof:
To use more down-to-earth terminology, if [c,d]/(c∪d) is discontinuous, this means that [c,d] adds two non-adjacent regions to (c∪d). An example of this is shown below. The dark grey regions are the interiors of c and d, while the light grey regions are the areas added by [c,d]
Let ⟨c1,d1⟩ and ⟨c2,d2⟩ be the two lines on the border of [c,d] that are not part of c or d, where c1 and c2 lie on c, and d1 and d2 lie on d. Assume, without loss of generality, that ℓ⟨c1,c2⟩≤ℓ⟨d1,d2⟩, so that the two lines are either parallel, or slanting to be closer near c. This is shown below:
For what comes next, consider rotating [c,d] such that the slope of ⟨c1,d1⟩ is non-negative, and the slope of ⟨c2,d2⟩ is non-positive, as in the previous diagram. For every point p in c, there is a positive distance between p and the point on the border of d and [c,d] that shares p’s y-coordinate. If there wasn’t, then p would lie on the the border of d, violating one of our assumptions. Let x be the minimal possible such distance, and let c’ be the result of shifting c a distance of x towards d.
We have now demonstrated that [c’,d]⊂[c,d], and by definition, c and d are not fully intersecting.
□
Corrolary 4½.1
Let g be an instance of G, and let c be a closed convex shape that does not accommodate G. If either endpoint of g is internal to c, then g and c are not fully intersecting.
proof:
Let g1 be the endpoint of g that is internal to c, meaning that it is in c, but not on its boundary. Let g2 be the endpoint of g that is external to c. There exists a closed ball with positive radius r around g1 entirely in c. Let g2’ be the point on g at distance r from g2, and let g1’ be the point 1 unit from g2’ such that ⟨g1’,g2’⟩ passes through g1. furthermore, let g’=⟨g1’,g2’⟩. We may observe that g1’ an g2’ are both in [c,g], but g2 is not in [c,g’]. By definition, [c,g’]⊂[c,g], and so g and c are not fully intersecting.
□
For the final result of this this section, it’ll be helpful to note one final definition. To be clear, this isn’t a definition of my own, but one that is commonly used.
Given a shape A, the maximal distance between any two points in A is called A’s diameter.
In mathematical equations, the diameter of A will be notated with diam(A)
The theorem we’re attempting to develop with this is:
Theorem 4¾
For any convex shapes C and D, the diameter of any element of [C,D]− is max(diam(C),diam(D)).
Showing this is quite hard! It seems true, but that’s hardly proof. I’m spinning off this discussion into its own mini-article, so it doesn’t become a massive part of this one.
In a previous section, I limited the space of curves worth considering by defining taughtness. I showed that some curves are accomodated by other curves, and therefore not worth considering. In the next section, I’ll try to limit the space of curves even further by finding some curves that are accomodated by sets of other curves.
A curve X is proxy accommodated by a set of curves Ξ if X is accommodated by every shape in [Ξ]−.
My initial goal was to hopefully find a finite set of taut curves that proxy accommodate all other taut curves, and then to find the smallest set that contains all curves in that finite set. This goal seems reasonable at first, as it is much easier to find [Ξ]− when Ξ is a finite set of curves as opposed to an infinite one. There are some severe problems with this as an objective, but there’s still much to be learned by exploring it!
In this section, to illustrate that it is in fact possible to find the minimal size of covering shapes for certain finite numbers of curves, we’ll find a few examples. These next two theorems are 5% insight and 95% bookkeeping, so feel free to skip their proofs if you’re in a hurry.
Theorem 5 All elements of [S,G]− are congruent to a quadrilateral defined with:
⟨(31,0),(a,31),(0,31),(b,0),(31,0)⟩
Where b<0, a>31, and a−b=322. Their area is approximately 0.268.
proof: First, assume without loss of generality that the instance of S is located on the points (0,0), (31,0), (31,31), and (0,31), as in the definition’s example. Call this instance s. Let the intance of G have endpoints A and B, so that ℓ⟨A,B⟩=1. Define this instance of the line so that ⟨A,B⟩=g. Note that the line between A and B must pass through the square in order for these shapes to be fully intersecting.
Of course, [s,g] is the convex hull of these points. A potential instance of [s,g] is shown in the illustration below:
[s,g] can be deconstructed into the central square and multiple triangles:
Let A=(ax,ay), and let B=(bx,by). Additionally, let f(x) be the distance of x to the interval [0,31], so that
f(x)=⎩⎨⎧−x0x−31if x≤0if x∈(0,31)if x≥31
To give an example of how this could be useful, consider the triangle formed by ax. If A is the lower point on the figure above, this would be the green triangle. Using the standard formula for area of a triangle, we get 21⋅31⋅f(ax)
Then, the full area of [s,g] would be given by:
91+i∑6f(i)
Where i is an element of {ax,ay,bx,by}. The presence of 91 is due to the area of s. There is also the limitation from the length of g which implies that:
For the time being, let’s hold A constant, and consider the optimal placement of B, assuming without loss of generality that bx≥0 and that by≥31. Solving the previous equation for by gives
This is obviously not possible, meaning that the critical points of this area function are when bx=0, when bx=31, when by=31, or when 0<bx=ax<0.
If bx,ax∈[0,31], then the formula for area is given by ay−1−(ax−bx)2. It is clear from inspection that this function is larger when ax=bx as opposed to otherwise. Because of this, we conclude that B lies on either x=0, x=31, y=0, or y=31. By symmetry, A also lies on one of these lines. This leads to one of two possibilities:
In one possibility, assume that both A and B lie on x=0 and y=0. Without loss of generality, let bx=0 while ax=31. Then the distance between \(A) and \(B\) gives the restriction that:
Assuming that the square lies between these two points, the area of the full shape is then given by:
A=91+61⋅322=⋅182+22≈0.268
In the other possibility, A lies on a vertical line, while B lies on a horizontal line, or vice versa. Without loss of generality, let ax=0, and let by=0.Then the distance between \(A) and \(B\) gives the restriction that:
If ay=21, then bx=21 as well. This solution is invalid, however, as the instance of L in this case would not pass through the instance of S. Rather than showing this mathematically, I’ll just show the results of a graphing utility.
The non-differentiable points in the second possibility are identical to the non-differentiable points in the first possibility, proving the theorem.
□
Admittedly, the statement of that theorem might have been highly intuitive to you. You might find it much less intuitive to consider elements of [G,V6π]−.
Theorem 6 All elements of [E,G]− are congruent to a triangle with base length 1 and height 43, and have an area of 83.
proof:
To start, let’s place an instance of E in the cartesian plane, and we’ll call this instance e (Euler’s number does not appear anywhere in this article). I’ll place this triangle with two points on the x-axis, and one point on the y-axis. Then the points in this triangle are:
e1=(4−1,0)e2=(41)e3=(0,43)
Note that it isn’t really important which two sides of this triangle make up e, as we’ll be considering the convex hull, so all three sides are included in this graph. I will illustrate this triangle below:
Note that I have labeled the sections of this triangle with numbers 1 though 6. This is because the instance of G must pass through e by Theorem 4. Note that G cannot have endpoints in adjacent sections if it passes through e. Note also that G cannot have both its endpoints in odd-numbered sections. Therefore, define the endpoints of G to be a=(ax,ay) and b=(bx,by). Without loss of generality, assume a is in section 4, and assume b is in section 1 or 6.
What is the size of [e,⟨a,b⟩]? First, Let’s find the area of [e,a]. This consists of the area inside e, as well as the area in the triangle defined by the points e1, e2, and a.
The area of the grey region inside e is given by 21⋅21⋅43. The area of the blue region created by a is given by 21⋅21⋅ay. Therefore, the total area of these two regions is:
163+4ay
Let’s start by assuming that b is located in region 6. In this case, the inclusion of b creates an additional triangle defined by the points e3, e2, and b, as shown below:
The area of this green region is determined by the distance from b to the line from e3 to e2. There’s a useful formula that gives the area of a triangle given the locations of its three points:
Because bx>0, and by is so low above ay, we may assume that b=(ax+23,ay+21). This is signifigant, because we may observe that the slope from a to b is 31. This is perpendicular to the slope from Z3 to Z2, meaning that this location of b maximizes the area of the green triangle.
The other posibility that would create a critical point for the area of the green triangle is that b lies on either the x-axis, or on the line y=3x+43, as these are the bounds of b’s location. It is not possible for b to lie on the x-axis, as this would result in the line G lying outside e. Therefore, the minimum area is achieved when b lies on y=3x+43.
The other posibility is that b lies in section 1. If this is the case, we may ignore the area of e, as the overall area can now be defined by a triangle between b, e1, and e2.
In this case, the total area of [e,⟨a,b⟩] is 41ay+41by. Holding the position of a constant, by is minimized by maximizing ∣(bx−ax)∣. This means that b must lie on the boundary of Section 1.
We have concluded that b must lie on the boundary of section 1, regardless of what other assumptions have been made. Let’s assume, without loss of generality, that b lies on the line y=3x+43, while a is in section 4. From here, we’ll hold the location of b constant and find the optimal location of a. As before, to minimize the area of the blue triangle formed by a, we must minimize ay, which means maximizing ∣(bx−ax)∣. We conclude that a must lie on the boundary of section 1. If a lies on the line passing through e3 and e2, then ⟨a,b⟩ does not intersect e.
We have now shown that [e,⟨a,b⟩] is congruent to a triangle with base length 1 and height 43. The area of such a triangle is 43.
There are two ideas that I imediately had when considering how to find minimal covers. Neither of them are effective, but it’s informative to see how these strategies can fail. The first would look like this:
Theorem 6 and a half Let A and B be curves, and let a and b be instances of those curves. Additionally, let a’ be such that [a’,b]∈[A,B]−, while [a,b]∈[A,B]−. There does not nececarily exist a linear transformation T:a→a’ such that the area of [Tt(a),b] is monotonically decreasing on t∈[0,1].
Another way of phrasing this is that there might not be a way to smoothly slide a shape into position to minimize the size of the complex hull without first increasing the size of the complex hull. A third way of phrasing it is that there may be local minima in the size of the convex hull of two shapes that is not an absolute minimum.
proof
Let b be a rectangle defined by the points 0,0, 0,41, 21,41, and 21,0. Consider the convex hull of this rectangle and a unit length line A. It was shown in Theorem 5 that the optimal locations for this line are such that its endpoints lie on opposite parallel extensions of the sides of b. This means that the endpoints of a either lie on x=0 and x=21, or they lie on y=0 and y=41. Without loss of generality, assume one endpoint of a lies at the origin. Because the other endpoint of a must lie a unit away from the origin, the two possible locations are (21,23) and (415,41), as shown below:
The area of the box on its own is 21⋅41=81. The total area of [a,b] is:
81+21⋅21⋅(23−41)=162+41⋅423−1=1623+1≈0.27981+21⋅41⋅(415−21)=324+81⋅415−2=3215+2≈0.184 if an endpoint lies at (21,23) if an endpoint lies at (415,41)
Suppose a is located with an endpoint at (21,23). A transformation that brings a to (415,41) would have to first bring it through the area above y=41 and to the right of x=21, which would increase the size of [a,b].
□
What a shame! I was hoping that it would be possible to smoothly shift shapes to find their best convex hulls. An even bigger issue came when I realized this:
Theorem 6 and three quarters Let A, B, and C be curves. It is not necesarily the case that there exists an element of [A,B,C]− accomodates an element of [A,B]−.
In other words, it doesn’t work to find the minimal shell of two shapes and then find the minimal shell of that with a third shape. You have to consider all three shapes at the same time.
proof
Consider the set of curves consisting of the unit length line segment, the equilateral triangle with sides of length 21, and the square with sides of length 31, or G,E,S. To cause a contradiction, let [s,g] be an instance of [S,G]− and let [g’,e] be an instance of [G,E]−, so that
[s,g,g’,e]∈[S,G,E]−
Immediately, we have that [s,g,e] is not larger than [s,g,g’,e]. Because [s,g,g’,e]∈[S,G,E]−, we have that [s,g,e] cannot be smaller than [s,g,g’,e], and so they must be the same size. By the same reasoning, [s,g’,e] must be the same size as [s,g,g’,e] as well. This means that g or g’ can be removed from [s,g,g’,e] without shrinking it, but not both. Therefore, g and g’ must share at least one endpoint on the boundary of [s,g,g’,e]. Without loss of generality, let this endpoint be the origin.
First, let’s assume that g=g’. Without loss of generality, we can let g lie on the x-axis, with e lying above the x axis. We know that e has a height of 43, and a base length of 21, meaning that [g,e] consists of a triangle between the points (0,0), (1,0), and (a,43), with a∈[41,43].
Without loss of generality, we’ll also assume that the location of s is such that the lines passing through the endpoints of g have positive slope. Then the sides of are defined by the equations:
y=42xy=42(−1)y=−22x+by=−22x+1+b
Where b∈[0,22−1]. This is shown below:
The bottom point of this square is located at the intersection of y=−22x+b and y=221(x−1). This point is located at:
(922b+1,9b−22)
This point forms a triangle with the instance of g on the x axis. That triangle has a size of
18b−22
There is also a triangle formed by the top left point of s, whenever this point is not inside [g,e]. This point is located at
(98(1+b),91+b)
This triangle only exists when the top right point of s is above the top left line of [e,g]. This line is determined by
y=4a−43(x−1)
Therefore, if this triangle exists, we may assume
91+b(1+b)(4a−4)≥4a−43(922(1+b)−1)≥(22(1+b)−9)3
If this is satisfied, there is a triangle with the point of g located at (1,0), and the point of e located at (a,43) with a∈[41,43]. Using the shoelace formula, the area of this triangle is given by
Because we are assuming that this triangle exists, this may be rewritten as
721((22(1+b)−9)(3)−(4a−4)(1+b))
Therefore, it is ideal to maximize a, so let a=43. The equation for area then simplifies to
721((26+1)(1+b)−93)
This is a linear equation in which area grows with b proportionally to \(\frac{2\sqrt{6}+1}{72}\aprox 0.0819\). This is quicker growth than the growth of the bottom triangle, which grows proportianally to \(\frac{1}{18}\aprox 0.055\). We may conclude that b must be such that
As mentioned, one of the big hopes in this project is that we should be able to ignore certain curves because they are accomodated by the unions of other curves. For example, let’s look at what else might be covered by one of the elements of [E,G]−.
Theorem 7 The triangle consisting of points at (2−1,0), (21,0), and (0,43) acommodates Vθ for any value of θ, and Vθ for any value of θ.
proof
Let t be the triangle described in the theorem statement.
For any angle θ, define vθ to contain the points v1=(0,21cos2θ), v2=(21sin2θ,0), and v3=(−21sin2θ,0). Note first that the distance between v1 and v2 is:
(21cos2θ)2+(−21sin2θ)2=21cos22θ+sin22θ=1
By symmetry, the distance from The angle formed by this shape is 21. The angle formed at v1 is θ, confirming that this is an instance of Vθ. Note that 21sin2θ<21 for all values of θ, meaning that v2 lies inside t. By symmetry, v2 also lies inside t.
v1 lies inside t whenever 21cos2θ<43. This is true when θ<6pi. Since Vθ is not taut for θ<6π, we won’t consider these anyway.
For any radius r, let ar be the curve defined with y=r2−x2−rsin(2rπr−1), where y>0. The line that defines the right half of t is y=−23x+43. These two lines intersect when
So far, the previous sections have each had to do with results I have already proven. At the time that I write this, the subject of this section is not yet proven. Therefore, what follows is a hypothesis, rather than a lemma, theorem, or statement.
Question 2 For any Type 2 curve X, does there exists a set of Type 1 curves that proxy accommodates X?
This would be a lovely result to find, although it’s easier stated than proven. Let’s start with a simpler hypothesis. Maybe we can use that as a stepping stone.
Question 2.1 Is the curve Z proxy accommodated by a set of Type 1 curves?
And in particular, I would sharpen this hypothesis even further:
Question 2.2 Is the curve Z proxy accommodated by {L,M,Z’}?
To start exploring this, I’ll place an instance of Z’ within the cartesian plane at the same location as in its definition, called z’. As a reminder, the points used here are labeled as follows:
It is possible, for the purposes of exploring Question 2.2, to expend the effective area of z’
Lemma 8 Let ω be a
If this shape is part of a union that includes certain other points, it would be possible for Z to be included, answering Question 2.2. I’m going to indicate in blue the points which would result in accomodating Z. First, it should be clear that including (1525,15−5)would allow for Z. In addition, there’s an infinite stretch of territory that would include that point by necessity.
It is important to give the precise equations for these lines, as they’ll be built upon moving forward. One boundary of the blue region is the line from P to Z2. This is defined with:
y1≤15px−2515py+5(x−px)+py
The other boundary of the blue region is the line from Z2 to Z4
y2≤31(x−1525)−155
Recall that M includes a circle of radius π+21. Because of this, the center of that circle cannot be located anywhere less than π+21 units away from this blue region. So, what is the line consisting of points π+21 away from y1? The vector with a slope that is the opposite recipricoal of the slope of y1 is:
Then the line that lies π+21 units away from y1 is:
y≤31(x−1525+(π+2)101)−155+(π+2)103
There will also be a circle of radius π+21 around Z2. I’ll illustrate this “forbidden zone” in black. Let f1 be the name of the boundary of this black region.
Next, I’ll notice that Wherever we place this instance of M, it must be fully intersecting with z’. If Z4 is in the interior of M, then M is not fully intersecting with z’. Similarly, if both Z1 and P are in the interior of M, M is not fully intersecting with z’. I’ll illustrate these regions in black as well.
What is the line with the greatest slope passing through both Z1 and M? There’s a whole host of ways to solve this question, but I’ve found that this is the quickest one. Let’s define p,q to be center of the circle inside M, so that our diagram must include all points in the circle defined by
(y−q)2+(x−p)2=(2+π)21
Any line passing through Z1 has the form y=mx where m is the slope. At what locations does this pass through the circle? Substituting this into the previous equation gives:
Because of this, we can use the following equation to give an extra side to z’
y=p2−(2+π)21qp+2+π1p2+q2−(2+π)21x
This is shown here:
By the same token, we can draw a line from Z3 to a point on M that it is tangent to. We can take our previous equation, and replace p with p−55, while replacing q with q−155. This equation would be:
What is the lowest possible slope of the line tangent to M passing through Z1? We may place the center of M at the point where f1 intersects the circle around Z4. This point is about (0.57391,0.0918346). Plugging these points in for p and q gives a particular slope for that line. We will define this with m1. Writing out the precise value of m1 would time a very long time, so sufice it to say that m1≈0.5461546.
Similarly, I would define m2 as the minimal slope of the line tangent to M passing through Z3. Placing the center of M at the point where f1 intersects the circle around P would mean setting p≈0.115614, while q≈−0.004593. If M is placed at this point, then m2≈−0.127902662317.
Now, graph the two lines
y=m1xy−155=m2(x−55)
These two lines intersect at a point that is approximately (0.306014,0.167131). Regardless of where M is located, this point must be included in the convex hull of M and z’. Additionally, I’ve been rounding down, meaning that this point really is included, not just one close to it. This extended version of z’ is shown below:
I’ve been thinking a lot about Z curves and their variants. I would like to build a framework for thinking about simple type 2 curves. The basic Z curve consists of four points:
Z1=(0,0)Z2=(31,0)Z3=(31,31)Z4=(32,31)
How might these points be different for other curves? Let’s consider only the unit length 3-chains with parallel end segments. If the basic Z curve is given a variable height α, its points may be written as:
Z1=(0,0)Z2=(21−α,0)Z3=(21−α,α)Z4=(1−α,α)
It is also possible that the first segment may be lengthened by a distance of β. Due to the ability to rotate the shape so that the first segment is longer, we may assume β>0. Then the points of this curve are:
Finally, the second segment of this curve does not have to be parallel to the other segments. Let’s shift the third point of this curve to the left or right by a distance of γ, while letting the fourth point exist where it has to be to maintain a length of 1. Therefore, the length of the second segment is:
Then, define Z(α,β,γ) to be the curve defined with these points.
I’m going to go on a brief tangent here, and it’ll be clear soon why this is important. Consider the possible elements of [L,M] with M and L intersecting. The curve M has a minimum radus of π+21, but it has a maximum radius of π+22. Let’s locate L on ⟨[0,0],[0,1]⟩. Without loss of generality, let’s assume M is centered above the x-axis, and so must have a center with a y-coordinate less than π+22. Additionally, there must not be a point more than 1 unit away from either endpoint of L. The possible locations for the center point of M is shown here in black:
The convex hull of these two shapes is shown here in red:
This is a nifty little framework here. Let’s consider elements of Z(α,0,0). These are curves defined with:
Z1=(0,0)Z2=(21−α,0)Z3=(21−α,α)Z4=(1−α,α)
An example of these points is shown:
Noteably, this particular element of [L,M] accomodates Z(α,0,0) as shown! What values of α can be accommodated by any element of [L,M]?
We’ll let (a,b) be the center of our instance of M. For a given value of α, which values of a and b accomodate Z4? Assuming Z is located as in the example, Z4 lies on the line y=−x+1, while Z3 lies on the line y=−2x+1. The line defining the top left boundary of the red region is given by:
y=vba+u1x
Where v=(a2−r2) and u1=rb2+v. Let’s assume that the slope of this line is at a minimum, meaning that a=1−r and b=0. In that case, the line defining the top left boundary is:
y=vrvx=vrx=1−2rrx
This means that Z3 is only just accomodated when these lines intersect at
Therefore, Z3 is accomodated whenever α<r+21−2rr. When is Z4 accomodated? The top left boundary of the red zone is given by
y=−pb−ab+u2(x−1)
Where p=v−2a+1 and u2=rb2+p. Because Z4 is located on y=−x+1, Z4 is accomodated whenever:
−x+1<−pb−ab+u2(x−1)
Rather than go through all the effort of solving this equation, I’ll simply point out that the lowest possible location for (a,b) to be while accomodating Z4 is the one where M is tangent to y=−x+1. This equation is:
y=−x+1−2r
The reduced area for (a,b) is shown below:
Next, let’s consider rotating Z so that Z2 is located on the x-axis and Z4 is located at (1,0). The distance between Z2 and Z4 is given by:
Once again, the parallel line that is located a distance of r under the previous one is:
y+m2+1r=m(x−m2+1mr)
where m is the slope from the previous equation. Because the center of M must be located underneath this, the total possible area for (a,b) is reduced even further.
Next, let’s rotate Z to have both end points on the x axis. The distance between Z1 and Z4 is given by:
α2+(1−α)2=α2+1−2α+α2=2α2−2α+1
As before, the distance from Z1 to Z2 is 21−α, while the distance from Z4 to Z2 is 21−2α+5α2. Therefore, if Z1 is located at the origin, then the x and y-coordinates of Z2 are restricted by:
y2+x2=(21−α)2y2+(x−2α2−2α+1)2=(21−2α+5α2)2y<0
Setting y2 equal to each other and solving for x gives: