MathGeometry

Sierpinski Gasket: Find Three IFS Maps and an Orbit Distance Bound

Write the three half-scale affine maps, then use invariance and contraction to prove d(xₖ,G) ≤ 2⁻ᵏ for a starting point in the unit triangle.

Question

Begin with an equilateral triangle T0T_0 of side length 11, with vertices AA, BB, and CC. Remove the open central triangle whose vertices are the side midpoints. Repeat this removal in each surviving corner triangle. The remaining limit set is the Sierpinski gasket GG.

(a) Specify three maps f1,f2,f3f_1,f_2,f_3 that produce this construction as an iterated function system.

(b) Starting at x0x_0 inside T0T_0, let xkx_k be the point reached after kk iterations. Give an upper bound for its distance to GG, and state the exponential convergence rate.

(a) Three maps for the gasket

Choose coordinates consistent with the triangle's orientation: A=(1/2,3/2)A=(1/2,\sqrt3/2) at the top, B=(0,0)B=(0,0) at the lower left, and C=(1,0)C=(1,0) at the lower right. This is a coordinate choice for the unit equilateral triangle, not extra measured data.

Each map moves a point halfway toward one vertex:

f1(x,y)=(x2+14,y2+34),f2(x,y)=(x2,y2),f3(x,y)=(x2+12,y2).\begin{aligned} f_1(x,y)&=\left(\frac{x}{2}+\frac14,\frac{y}{2}+\frac{\sqrt3}{4}\right),\\ f_2(x,y)&=\left(\frac{x}{2},\frac{y}{2}\right),\\ f_3(x,y)&=\left(\frac{x}{2}+\frac12,\frac{y}{2}\right). \end{aligned}

Equivalently, f1(z)=(z+A)/2f_1(z)=(z+A)/2, f2(z)=(z+B)/2f_2(z)=(z+B)/2, and f3(z)=(z+C)/2f_3(z)=(z+C)/2. These maps send the whole triangle onto its three corner triangles, each with half the side length. Iterating the union of their images gives the stated removal construction, whose compact limit satisfies

G=f1(G)∪f2(G)∪f3(G).G=f_1(G)\cup f_2(G)\cup f_3(G).

(b) Exponential approach to the set

Let ij∈{1,2,3}i_j\in\{1,2,3\} be the map selected at step jj, so xj=fij(xj−1)x_j=f_{i_j}(x_{j-1}). Let d(z,G)=inf⁡g∈G∥z−g∥d(z,G)=\inf_{g\in G}\|z-g\| denote Euclidean distance to the gasket. Each map has contraction ratio 1/21/2, and fi(G)⊆Gf_i(G)\subseteq G. For any g∈Gg\in G,

d(fi(z),G)≤∥fi(z)−fi(g)∥=12∥z−g∥.d(f_i(z),G)\le\|f_i(z)-f_i(g)\|=\tfrac12\|z-g\|.

Taking the infimum and repeating the estimate yields

d(xk,G)≤2−kd(x0,G)≤2−k.d(x_k,G)\le2^{-k}d(x_0,G)\le2^{-k}.

The last inequality uses the unit triangle's diameter: its vertices belong to GG, and every starting point in the triangle lies within distance 11 of a vertex. Thus 2−k2^{-k} is a valid uniform upper bound, and the guaranteed decay factor is at most 1/21/2 per iteration (equivalently, an O(2−k)O(2^{-k}) distance bound).

The bound holds for every sequence of map choices, so random choices are not required for this estimate. It describes approach to the set; it does not assert that every orbit converges to a single point or visits the whole gasket.

Evidence boundary

This covers both parts of Exercise T4.3 and includes the construction from its referenced Example 4.6. Coordinates are chosen explicitly for calculation. The distance bound is uniform and need not be sharp or attained; no simulated orbit or observed convergence rate is presented as data.

Sources

These references support the concepts and methods used in the explanation above.