An iterated function system acts through several maps
A contractive iterated function system uses finitely many maps on a complete metric space, with a common Lipschitz bound . Its nonempty compact attractor satisfies . In particular, each image stays inside .
This set relation is different from requiring every point of to be fixed by every map. Individual maps can have different fixed points.
Derive the distance estimate
For any , invariance and contraction give
Taking the infimum over gives . Applying the same reasoning after every selected map yields . The bound works for any map sequence; no claim about how uniformly the orbit samples the set follows from it.
New example: a one-dimensional Cantor construction
On , use and . These maps keep the left and right thirds and have contraction factor . Their compact invariant set is the middle-third Cantor set . Since and ,
After six steps this bound is , regardless of which map was chosen at each step.
Approach to a set does not mean settling at one point
Alternate then repeatedly. The even subsequence approaches the fixed point of , namely , while the odd subsequence approaches . Both points lie in , but the full orbit does not converge to one point. Its distance to still tends to zero.
Always state what converges: the distance to an invariant set, a sequence of sets, or an individual point sequence. They are distinct assertions.
Related question
Apply this knowledge
Use the concept guide to understand the reasoning, then return to the complete question and worked answer.
Sierpinski Gasket: Find Three IFS Maps and an Orbit Distance BoundSources
These references support the core concepts and interpretation boundaries explained above.