Skip to main content

Problem Pit: The Persistent Polynomial Mystery

 

Problem Pit: The Persistent Polynomial Mystery

The Problem

Find all polynomials $P(x)$ such that $P(x^2) = P(x) \cdot P(x+1)$ for all real $x$. When I first saw this functional equation, it looked straightforward. Just find a polynomial satisfying one condition - how hard could it be? Turns out, this innocent equation would drag me through multiple dead ends before revealing its secrets.

First Attempts: Plugging in Values

My instinct was to substitute simple values and see what constraints emerged. Starting with $x = 0$: $$P(0^2) = P(0) \cdot P(0+1)$$ $$P(0) = P(0) \cdot P(1)$$ If $P(0) \neq 0$, then $P(1) = 1$. Next, $x = 1$: $$P(1^2) = P(1) \cdot P(1+1)$$ $$P(1) = P(1) \cdot P(2)$$ Since $P(1) = 1$, we get $P(2) = 1$. With $x = 2$: $$P(4) = P(2) \cdot P(3) = 1 \cdot P(3) = P(3)$$ And $x = -1$: $$P(1) = P(-1) \cdot P(0)$$ $$1 = P(-1) \cdot P(0)$$ So I was getting specific values at integer points, but needed a systematic approach.

Dead End #1: The Degree Matching Disaster

I tried assuming $P(x) = a_n x^n + \cdots + a_0$ has degree $n$. Then: $$P(x^2) = a_n x^{2n} + a_{n-1} x^{2(n-1)} + \cdots + a_1 x^2 + a_0$$ Meanwhile: $$P(x) \cdot P(x+1) = (a_n x^n + \cdots + a_0)(a_n (x+1)^n + \cdots + a_0)$$ Both sides have degree $2n$, so this could work. But expanding $(x+1)^n$ and multiplying created an algebraic nightmare. I tried the specific case $P(x) = ax^2 + bx + c$: $$P(x^2) = ax^4 + bx^2 + c$$ $$P(x) \cdot P(x+1) = (ax^2 + bx + c)(a(x^2 + 2x + 1) + bx + b + c)$$ After expanding and collecting terms, I got a system of equations from matching coefficients. The coefficient of $x^4$ gave $a^2 = a$, so $a = 0$ or $a = 1$. The other conditions created increasingly complex constraints. This approach was becoming unmanageable, and I wasn't even sure quadratic solutions existed.

Dead End #2: The Recursive Attempt

Since $P(1) = 1$ and $P(2) = 1$, I thought maybe I could use the functional equation recursively: $$P(x) = \frac{P(x^2)}{P(x+1)}$$ For instance: $$P(\sqrt{2}) = \frac{P(2)}{P(\sqrt{2}+1)} = \frac{1}{P(\sqrt{2}+1)}$$ This just gave me $P(\sqrt{2}) \cdot P(\sqrt{2}+1) = 1$, which doesn't uniquely determine either value. I also tried the reverse direction. Setting $y = x^2$: $$P(y) = P(\sqrt{y}) \cdot P(\sqrt{y}+1)$$ This expressed values at perfect squares in terms of square roots, but led nowhere concrete.

The Breakthrough: Logarithmic Transformation

The key insight came when I realized that functional equations with products often simplify under logarithms. If $P(x) > 0$ everywhere, let $Q(x) = \ln(P(x))$: $$\ln(P(x^2)) = \ln(P(x)) + \ln(P(x+1))$$ $$Q(x^2) = Q(x) + Q(x+1)$$ This additive form is much more manageable! It's similar to Cauchy's functional equation. Let me test $P(x) = x^c$ for some constant $c$. Then $Q(x) = c \ln(x)$ for $x > 0$: $$c \ln(x^2) = c \ln(x) + c \ln(x+1)$$ $$2c \ln(x) = c \ln(x) + c \ln(x+1)$$ $$c \ln(x) = c \ln(x+1)$$ For this to hold for all $x > 0$, we need $\ln(x) = \ln(x+1)$, which is impossible unless $c = 0$. If $c = 0$, then $P(x) = x^0 = 1$. Let's verify this works: $$P(x^2) = 1$$ $$P(x) \cdot P(x+1) = 1 \cdot 1 = 1$$ ✓ So $P(x) = 1$ is a solution!

Exploring the Zero Case

What if $P$ has zeros? From $P(0) = P(0) \cdot P(1)$, we have two cases: Case 1: $P(0) = 0$ Case 2: $P(0) \neq 0$, forcing $P(1) = 1$ For Case 1, if $P(a) = 0$ for some $a$, then setting $x = a$ in the functional equation: $$P(a^2) = P(a) \cdot P(a+1) = 0 \cdot P(a+1) = 0$$ So zeros propagate: if $P(a) = 0$, then $P(a^2) = 0$. Going backwards, if we set $x = \sqrt{a}$ (for $a > 0$): $$P(a) = P(\sqrt{a}) \cdot P(\sqrt{a}+1)$$ Since $P(a) = 0$, either $P(\sqrt{a}) = 0$ or $P(\sqrt{a}+1) = 0$. This creates a complex web of constraints on where zeros can occur.

The Structure Argument

Here's the crucial insight: any polynomial solution must be extremely well-behaved. If $P$ has no zeros and is positive everywhere, then the logarithmic form $Q(x^2) = Q(x) + Q(x+1)$ must hold where $Q = \ln(P)$ is also a polynomial. But $\ln(P)$ can only be polynomial if $P$ is constant. If $P$ has zeros, the functional equation creates such restrictive constraints on their locations that no non-trivial polynomial can satisfy all of them simultaneously. The detailed analysis involves: - Studying how zeros must be distributed - Examining the polynomial constraint - Considering complex behavior - Analyzing the growth conditions After working through all possibilities systematically, only the constant solution survives.

The Complete Analysis

Let me sketch the full argument. Suppose $P$ is a polynomial solution that's not identically zero. If $P$ never vanishes, then $P > 0$ everywhere (since polynomials are continuous and $P(1) = 1 > 0$). The logarithmic approach then forces $P$ to be constant. If $P$ has zeros, say $P(a) = 0$, then: 1. $P(a^2) = 0$ (zeros propagate forward) 2. Either $P(\sqrt{a}) = 0$ or $P(\sqrt{a}+1) = 0$ (zeros have "predecessors") 3. The polynomial degree puts severe restrictions on the number of zeros 4. The functional equation creates dependencies between zeros that are impossible to satisfy The technical details involve careful case analysis, but the conclusion is that no non-constant polynomial with zeros can work. Therefore, from both the zero-free case and the case with zeros, we conclude that $P(x) = 1$ is the unique polynomial solution.

Conclusion

After this journey through direct substitution, coefficient matching, recursion, logarithmic transformation, and structural analysis, the answer is elegantly simple: The only polynomial solution is $P(x) = 1$. This problem demonstrates several important principles: - Functional equations can be surprisingly restrictive - The right transformation (logarithmic) can reveal hidden structure - Sometimes brute force approaches work, but understanding why they work is more valuable - Edge cases and special structures often hold the key to complete solutions The logarithmic transformation was the crucial insight that converted a multiplicative functional equation into an additive one, making the analysis tractable. This technique is broadly applicable in functional equation theory and shows how changing perspective can illuminate a problem's essential structure.
Labels:

Comments

Post a Comment

Popular posts from this blog

Sharp Extremal Bounds for Angular Occupancy (Behind the Curtains)

you can find the full paper here First Attempts, and the Limits of Energy When I first began thinking about angular occupancy, I wasn’t looking for a brand-new problem. I was chasing a theme that has long fascinated me in discrete geometry: how do we measure the geometric richness of a finite set of points? This fascination is not unique to me. Erdős, way back in 1946, posed the distinct distances problem : given n points in the plane, how many distinct distances can they determine? That question alone gave birth to entire decades of work in combinatorial geometry. Later, Fishburn and Füredi asked about distinct angles , while Pach and Sharir studied repeated angles . Each time, the same underlying itch was being scratched: when you place points in the plane, what kinds of diversity can they generate? Why angles, why bins? It was natural to think of angles — after all, distances and directions had already been well studied. But if you go straight for “distinct angles,” you run in...
Post a Comment
Read more

The Art of Goodbye

  The Art of Goodbye: How Relationships End and Why It Matters The friendship had been slowly dissolving for months. What used to be weekly coffee dates became monthly check-ins, then sporadic text messages, then silence. No fight precipitated the ending, no dramatic confrontation or betrayal. It simply... faded. One day you realized you hadn't spoken to someone who was once central to your life, and you weren't sure when the relationship had officially ended or even if it had. This ambiguous loss left you with a peculiar grief – mourning someone still alive, still accessible, but no longer present in your world. This experience is incredibly common yet rarely discussed. While we have cultural scripts for how relationships begin – meet-cutes, first dates, friendship origin stories – we have few models for how they end. We talk extensively about building connections but rarely about gracefully releasing them. This gap in our social understanding leaves many people unprepared ...
1 comment
Read more

Getting Stuck: When Dijkstra Meets Negative Edges

  Getting Stuck: When Dijkstra Meets Negative Edges One of the joys (and pains) of computer science is when you take a tool you know, confidently apply it, and then watch everything break down in surprising ways. This happened to me recently when I decided to revisit shortest path algorithms — specifically, Dijkstra’s algorithm — only to get stuck in a swamp of negative edges. Setting the Scene The problem was classic: Given a directed, weighted graph and a source vertex, find the shortest path to all other vertices. This is the kind of problem that every CS student learns early, usually with Dijkstra’s algorithm. I already knew Dijkstra like an old friend: Keep a priority queue of distances. Always expand the node with the current smallest distance. Relax its edges. Simple, elegant, efficient ( O((V + E) log V) with a binary heap). So when I started coding a graph utility for my project — a tool to analyze transportation networks — I confidently plugged in D...
Post a Comment
Read more