Common fixed point problem

In mathematics, the common fixed point problem is an interesting idea about special rules for numbers. It asks whether two smooth rules, or functions, that work well together on a number line between 0 and 1 must always share a special number that doesn’t change when you apply either rule to it. This special number is called a fixed point.

This problem was first asked in 1954 and puzzled mathematicians for many years. They tried to prove that such a shared fixed point always exists. But in 1967, two mathematicians named William M. Boyce and John P. Huneke showed that this isn’t always true. They found examples where the rules worked together but still didn’t share a common fixed point, solving the problem in a surprising way.

History

In 1951, two mathematicians, H. D. Block and H. P. Thielman, started studying special math rules called fixed points. They looked at how certain math rules work together and found that, in some cases, these rules share a common point where they meet.

This idea made other mathematicians curious. In 1954, Eldon Dyer asked a big question: if two special math rules work together and follow certain rules, must they always share a common point where they meet? More mathematicians asked the same question in the years that followed. Over time, many mathematicians worked on this problem, finding new ways to show that these rules often do share a common point under different conditions.

Boyce's counterexample

William M. Boyce finished his studies in 1967 and found two special math rules that work together but do not share a common point where they both stay the same. This showed that a guess about these kinds of rules was not always true.

In 1963, two mathematicians looked at a special combination of these rules and noticed patterns in how they behave at certain points. Boyce later used a computer to test many possible patterns and found one example where the rules worked together but still did not share a common point. His work was one of the first times computers helped solve a big math question.

Huneke's counterexample

John P. Huneke studied the common fixed point problem for his Ph.D. at Wesleyan University, which he received in 1967. In his work, he showed two pairs of functions that work together but do not share a common point where they both stay the same. One of his examples is very similar to another mathematician's work, but he reached it through a different method.

Huneke's approach used an idea from the mountain climbing problem. This problem shows that two climbers can climb mountains of the same height in a way that they are always at the same height at the same time. Huneke used this idea to build sequences of functions that prove the common fixed point problem is not always true.

Later research

After some researchers found examples that showed the original idea wasn’t always true, others began studying special cases where it might still work. They looked at different rules that could help find a point where both functions meet.

One researcher, Boyce, showed in 1971 that even with simpler rules, the functions could still share a common point. Others built on this work over the years. Later, Jungck added more conditions that could help find this shared point.

Baxter permutations, a type of arrangement, have also become important in studying many problems, not just this one.