A positive answer to a symmetry conjecture on homogeneous IFS

This paper provides an affirmative resolution to "Open Question 1" posed by Feng and Wang regarding a symmetry conjecture on homogeneous iterated function systems.

The Gist

Imagine you have a magical machine that can shrink and copy shapes. In the world of mathematics, this machine is called an Iterated Function System (IFS). If you run a shape through this machine over and over again, it eventually settles into a specific, intricate pattern called an attractor. Think of this attractor as a fractal snowflake or a jagged coastline.

Now, imagine you have two different machines, Machine A and Machine B.

• Machine A shrinks things by a certain amount and shifts them to the right.
• Machine B shrinks things by the exact same amount but shifts them to the left (it's the "opposite" of Machine A).

For a long time, mathematicians wondered: If both machines create the exact same final snowflake (attractor), does that snowflake have to be perfectly symmetrical? Like a mirror image of itself?

This was a famous puzzle known as "Open Question 1." Some smart mathematicians had solved parts of it under very strict rules, but the general case remained a mystery.

Enter Junda Zhang.

In this paper, Junda says, "Yes! The snowflake is always symmetrical." He proves that if two opposite machines create the same result, the result must be a perfect mirror image.

How did he prove it? (The Analogy)

Junda didn't just guess; he used a clever two-step detective story involving "clues" hidden in the numbers.

Step 1: The "Recipe" Clue (Lemma 0.2)

Imagine the machines have a secret recipe made of numbers. Let's call the recipe for Machine A a list of ingredients $A$, and for Machine B a list $B$.
Junda discovered a mathematical trick: If you mix the ingredients of Machine A with a "scaled-up" version of itself, it looks exactly like mixing Machine B's ingredients with a "scaled-down" version of itself.

He proved that if these two mixed-up recipes are identical, and the ingredients in $B$ are just the ingredients in $A$ shifted by a constant distance, then the list $A$ must be a perfect mirror image of itself (shifted to a new center).

• Simple Analogy: Imagine you have a line of people standing in a row. If you tell everyone to take a step forward and then look at the group, and it looks exactly the same as if you told a different group of people to take a step backward, then the original line of people must have been standing in a perfectly balanced, symmetrical formation.

Step 2: The "Smallest and Largest" Clue (Lemma 0.3)

This was the tricky part. To make the first step work, Junda needed to prove that the "mixing" didn't cause any ingredients to overlap or get lost. He needed to be sure that every single combination of numbers was unique.

He used a logic game:

1. Look at the smallest possible result you can get from mixing Machine A's ingredients.
2. Look at the smallest possible result from mixing Machine B's ingredients.
3. Because the machines create the same snowflake, these two smallest results must be the same number.

By comparing the smallest number with the largest number, and then the second smallest with the second largest, he showed a pattern. It's like matching socks: the smallest sock in the left pile must match the smallest sock in the right pile, the second smallest with the second smallest, and so on.

He proved that this matching happens perfectly for every number in the list, not just the first one. This confirmed that the "mixing" was clean and the symmetry logic held up.

The Grand Conclusion

Once Junda proved that the "ingredients" (the numbers defining the machines) are perfectly symmetrical, the final result follows automatically.

If the instructions for building the snowflake are symmetrical, the snowflake itself must be symmetrical.

In a nutshell:
Junda Zhang solved a decades-old puzzle by showing that if two opposite forces create the same complex pattern, that pattern cannot be lopsided. It must be a perfect reflection of itself. He did this by breaking the problem down into a "recipe check" and a "sock-matching" game, proving that the universe of these mathematical shapes loves symmetry.

Technical Summary

Here is a detailed technical summary of the paper "A Positive Answer to a Symmetry Conjecture on Homogeneous IFS" by Junda Zhang.

1. Problem Statement

The paper addresses Open Question 1 posed by Feng and Wang in their 2009 paper (Adv. Math. 222). The core problem concerns the symmetry of the attractor of a specific class of Iterated Function Systems (IFS).

• Context: Let $\Phi$ and $\Psi$ be two homogeneous IFSs acting on $\mathbb{R}$.
  • They share the same contraction factor magnitude, denoted as $r$ (where $0 < r < 1$).
  • Their contraction factors are opposite to each other (i.e., $\Phi$ uses $+r$ and $\Psi$ uses $-r$).
  • Both systems satisfy the Open Set Condition (OSC).
  • They share the same attractor $K \subset \mathbb{R}$.
• The Question: Does the existence of such a pair of IFSs imply that the common attractor $K$ is symmetric (i.e., symmetric with respect to some point)?

Previous partial results existed:

• Feng and Wang [1] proved the conjecture under the stronger Convex Open Set Condition (COSC).
• Another result [2] proved it under the Strong Separation Condition (SSC).
• The general case under the standard OSC remained open.

2. Methodology

Zhang's approach diverges from previous strategies, which were described as "involved, lengthy but unsatisfying." Instead, the author employs a concise algebraic and combinatorial strategy based on multiset equalities and generating functions.

The proof relies on two main lemmas:

Lemma 0.2: Algebraic Symmetry via Generating Functions

• Setup: Consider two multisets of real numbers $A = \{a_i\}$ and $B = \{b_i\}$ such that $b_i = a_i + C$ for a constant $C$.
• Condition: The multiset sum $A + rA$ equals the multiset difference $B - rB$.
• Mechanism: The author defines generating functions $A(x) = \sum x^{a_i}$ and $B(x) = \sum x^{b_i}$.
  • The condition $A + rA = B - rB$ translates to the functional equation: $A(x)A(x^r) = B(x)B(x^{-r})$.
  • Substituting $B(x) = x^C A(x)$, the equation simplifies to $A(x^r) = x^{C(1-r)} A(x^{-r})$.
• Result: By analyzing the exponents of the resulting Laurent polynomials, the author proves that the set $A$ satisfies the symmetry relation:
  $$A = \frac{C(1-r)}{r} - A$$
  This implies the set of translation vectors is symmetric.

Lemma 0.3: Combinatorial Ordering and Permutations

• Setup: Let $A$ and $B$ be sets of real numbers sorted in increasing order ($a_1 < \dots < a_n$ and $b_1 < \dots < b_n$).
• Conditions:
  1. The set $A + rA$ has cardinality $n^2$ (all elements distinct).
  2. The sets $rB + A$ and $-rA + B$ also have cardinality $n^2$.
• Mechanism: The proof uses an inductive argument on the indices of the sorted sets.
  • It establishes that the smallest element of $A+rA$ must equal the smallest element of $B-rB$.
  • It proves that specific permutations mapping indices between the sets are actually the identity (or specific fixed mappings like $t(i)=1, v(i)=n$).
• Result: For every $i$, the boundary elements satisfy the linear relation:
  $$b_i - r b_n = a_i + r a_1$$
  This establishes a rigid structural relationship between the translation vectors of the two IFSs.

3. Key Contributions and Results

The paper provides a complete solution to the conjecture under the standard OSC.

• Main Theorem (Theorem 0.1): If two homogeneous IFSs $\Phi$ and $\Psi$ with opposite contraction factors ($r$ and $-r$) satisfy the OSC and share the same attractor $K$, then $K$ is symmetric.
• Proof Logic:
  1. By Moran's equation and Theorem 1.3 from Feng and Wang [1], the condition that $\Phi \circ \Psi$ and $\Phi \circ \Phi$ satisfy the OSC implies that the sets of translation vectors $A$ and $B$ satisfy the distinctness conditions required for Lemma 0.3.
  2. Applying Lemma 0.3, the author derives the relation $b_i - r b_n = a_i + r a_1$. This identifies the constant shift $C$ in Lemma 0.2 as $C = r b_n + r a_1$.
  3. Applying Lemma 0.2, the author concludes that the set of translation vectors $A$ is symmetric.
  4. Since the attractor of a homogeneous IFS is symmetric if and only if its set of translation vectors is symmetric (a known result cited from [1]), the attractor $K$ is symmetric.

4. Significance

• Resolution of an Open Problem: The paper definitively answers Open Question 1 from Feng and Wang (2009), closing a gap in the theory of fractal geometry and IFS.
• Generalization: It extends the validity of the symmetry conjecture from the restrictive COSC and SSC cases to the more general Open Set Condition (OSC).
• Methodological Innovation: The proof is notable for its brevity and elegance. By utilizing generating functions and a combinatorial induction on sorted sets, the author avoids the complex, lengthy strategies previously attempted. This suggests that algebraic structures underlying IFS translation sets may be more tractable than previously thought.
• Implications for Fractal Geometry: The result reinforces the deep connection between the algebraic properties of the defining maps (translation vectors) and the geometric properties of the resulting fractal (symmetry), specifically in the context of "opposite" contraction factors.

In summary, Junda Zhang successfully proves that the coexistence of two homogeneous IFSs with opposite contraction factors and a common attractor forces that attractor to be symmetric, utilizing a novel and efficient combination of generating functions and combinatorial set theory.