Skip to main content

The Problem Pit: The Pit of the Generalized Takagi Function

 

The Pit of the Generalized Takagi Function: Smooth Nowhere

There are monsters in mathematics that don’t roar right away. They don’t shout “I am a fractal.” They start quietly, with innocent definitions, and lure you into believing they are tame. The Takagi function is one of them.

It’s defined by the infinite series

Tα,β(x)=n=0αnτ(βnx),T_{\alpha,\beta}(x) = \sum_{n=0}^\infty \alpha^n \, \tau(\beta^n x),

where τ(x)=dist(x,Z)\tau(x) = \text{dist}(x,\mathbb{Z}) is the “sawtooth” function — the distance to the nearest integer.

The ingredients are harmless: sawteeth, scaling, some coefficients. You can plot the first few partial sums, and what you get looks like a jagged mountain range. But it’s continuous. It seems innocent enough.

I thought: Surely this is just a quirky continuous function. Maybe not smooth everywhere, but nothing too wild.

That’s when the pit opened.


Step 1: The False Sense of Security

At first, I remembered that the classical Takagi function (with α=12,β=2\alpha=\tfrac{1}{2}, \beta=2) is known to be continuous everywhere but differentiable nowhere. That already feels paradoxical: a function that behaves like a “line” with no tangent line anywhere.

But the generalized version adds a parameter dance: α,β\alpha, \beta control how much scaling and shrinking happens. There’s a trichotomy of behavior:

  • Subcritical (αβ<1\alpha\beta < 1): Lipschitz continuous. The graph is jagged but still relatively well-behaved.

  • Supercritical (αβ>1\alpha\beta > 1): wild — continuous but nowhere differentiable, with difference quotients exploding like a power law.

  • Critical (αβ=1\alpha\beta = 1): the cliff edge. What happens right here?

I thought: maybe at the critical point, the function balances. Perhaps it’s differentiable “almost everywhere”? Or maybe it’s “piecewise smooth”?

I was wrong.


Step 2: Naive Differentiation (The Dead End)

I tried to formally differentiate:

Tα,β(x)=n=0αnτ(βnx).T_{\alpha,\beta}(x) = \sum_{n=0}^\infty \alpha^n \tau(\beta^n x).

Differentiate term by term? Disaster. Each τ(βnx)\tau(\beta^n x) is piecewise linear but has kinks at every rational with denominator βn\beta^n. The kinks accumulate densely. The derivative series diverges almost everywhere.

Okay, maybe consider the difference quotient:

Q(x,h)=Tα,β(x+h)Tα,β(x)h.Q(x,h) = \frac{T_{\alpha,\beta}(x+h) - T_{\alpha,\beta}(x)}{h}.

If αβ<1\alpha\beta < 1, this stays bounded — so the function is Lipschitz. If αβ>1\alpha\beta > 1, it blows up like a power of h1|h|^{-1}.

But at αβ=1\alpha\beta=1… my estimates collapsed. Sometimes it looked bounded, sometimes unbounded. I couldn’t tell which way it would tip.

Dead end.


Step 3: Wrong Guesses and Half-Truths

I guessed: maybe the critical case is differentiable almost everywhere. After all, “critical” suggests borderline behavior.

So I tried small experiments: plotting difference quotients for tiny hh. Instead of stabilizing, they oscillated. Sometimes they grew, sometimes they shrank. No clear pattern.

Next guess: maybe it’s differentiable at rationals but not irrationals? Or vice versa? But calculations around rationals with denominator powers of β\beta gave chaotic blowups.

Another wrong turn.


Step 4: The Reveal — Logarithmic Explosion

The actual truth is stranger:

  • At the critical threshold (αβ=1\alpha\beta=1), the function is continuous but nowhere differentiable.

  • The difference quotient grows like

    Q(x,h)Clogh,Q(x,h) \sim C \, |\log h|,

    for some constant C>0C > 0.

That means the function doesn’t explode as violently as in the supercritical case, but it still refuses to have a tangent anywhere. The growth is just slower — logarithmic rather than power-law.

It’s an in-between monster: smoother than chaos, rougher than order.


Step 5: Fractal Features

Here’s where the pit deepens:

  • Self-similarity. The function satisfies a functional equation

    Tα,β(x)=τ(x)+αTα,β(βx),T_{\alpha,\beta}(x) = \tau(x) + \alpha T_{\alpha,\beta}(\beta x),

    which means zooming in reproduces scaled versions of itself. It’s fractal in nature.

  • Combinatorics of digits. Whether the difference quotient explodes at a given scale depends on the base-β\beta expansion of xx. Runs of identical digits correspond to “bad” scales where spikes happen.

  • Nowhere differentiability. No matter where you look, the kinks are too dense, the oscillations too sharp. Smoothness never emerges.

Visually, the graph is like a coastline: zoom in and it never straightens out.


Step 6: The Abyss Below — Open Questions

Even after proving nowhere differentiability at the critical threshold, the pit doesn’t end. Deeper questions remain:

  1. Optimal constants. Exactly how large is the logarithmic growth constant CC? How does it depend on β\beta?

  2. Fractal dimension. What is the Hausdorff dimension of the graph at criticality? Is it different from subcritical and supercritical regimes?

  3. Multifractal spectrum. How are the pointwise Hölder exponents distributed?

  4. Randomized analogues. If we randomize coefficients or phases, does the same logarithmic failure persist?

  5. Higher dimensions. What happens if we define Takagi-like monsters on Rd\mathbb{R}^d?

These are not exercises. They are live research questions.


Step 7: Climbing Out

What started as a playful-looking sawtooth series turned out to be an abyss. The function is continuous — so you can draw its graph without lifting your pen — but nowhere differentiable, so you can’t find a tangent line anywhere. At the critical threshold, the failure is delicate, balanced exactly on a logarithmic edge.

I went in expecting a quirky toy. I came out realizing I had stumbled onto a razor’s edge fractal.

That’s the heart of The Problem Pit: the fall from “I can do this” to “this is stranger than I imagined.”



Comments

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...

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 ...

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...