Question
Begin with an equilateral triangle of side length , with vertices , , and . 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 .
(a) Specify three maps that produce this construction as an iterated function system.
(b) Starting at inside , let be the point reached after iterations. Give an upper bound for its distance to , and state the exponential convergence rate.
(a) Three maps for the gasket
Choose coordinates consistent with the triangle's orientation: at the top, at the lower left, and 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:
Equivalently, , , and . 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
(b) Exponential approach to the set
Let be the map selected at step , so . Let denote Euclidean distance to the gasket. Each map has contraction ratio , and . For any ,
Taking the infimum and repeating the estimate yields
The last inequality uses the unit triangle's diameter: its vertices belong to , and every starting point in the triangle lies within distance of a vertex. Thus is a valid uniform upper bound, and the guaranteed decay factor is at most per iteration (equivalently, an 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
Các nguồn này hỗ trợ những khái niệm và phương pháp được giải thích ở trên.