Skip to main content

Nowhere Differentiability at the Edge: The Critical Takagi Function(An Overview)

 


Nowhere Differentiability at the Edge: The Critical Takagi Function

When we think of a “pathological function” in analysis, the usual suspects come to mind: Weierstrass’s nowhere differentiable monster, Cantor’s dust of measure zero, or perhaps the Koch snowflake with its infinitely jagged boundary. Each shows us that functions and shapes can behave in ways our geometric intuition never expected.

Among these classics lives the Takagi function, a beautifully simple series that hides fractal complexity. In recent years, mathematicians have generalized it, producing an entire family of functions whose regularity depends on two parameters. And the paper we’re discussing today — “Nowhere Differentiability of the Generalized Takagi Function at the Critical Threshold” — nails down the last missing piece of the puzzle: what happens exactly at the delicate “critical” parameter setting.


The Takagi Function and Its Generalization

The original Takagi function was introduced in 1903 by Teiji Takagi. Its definition looks innocent:

T(x)=n=012nτ(2nx),T(x) = \sum_{n=0}^\infty \frac{1}{2^n} \, \tau(2^n x),

where τ(x)\tau(x) is the sawtooth function measuring the distance of xx to the nearest integer.

What makes it remarkable is that it is continuous everywhere but differentiable nowhere. Imagine a graph that looks like a mountain range that zooms into another mountain range, and another, ad infinitum. Smoothness never appears, no matter how far you zoom.

The generalized Takagi function introduces two parameters, α\alpha and β\beta:

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

where 0<α<10 < \alpha < 1 and β2\beta \geq 2 is an integer.

Here, α\alpha controls how much weight higher-frequency oscillations get, while β\beta controls how fast the oscillations appear. Together, they set the stage for different regimes of regularity.


The Trichotomy: Three Worlds of Behavior

The beauty of this family is that its regularity falls into a trichotomy — three qualitatively distinct worlds depending on the product αβ\alpha \beta:

  1. Subcritical (αβ<1\alpha \beta < 1)

    • The function is tame: it’s Lipschitz continuous, meaning its slopes are bounded.

    • Graphically, it’s jagged but “under control.”

  2. Supercritical (αβ>1\alpha \beta > 1)

    • The function is wild: continuous but nowhere differentiable, with difference quotients growing like a power law as h0h \to 0.

    • In other words, the slopes blow up extremely fast.

  3. Critical (αβ=1\alpha \beta = 1)

    • This was the mysterious middle case.

    • It turns out the function is still continuous and nowhere differentiable — but the blow-up of slopes is subtler: it grows like logh|\log h|.

    • Not as tame as the subcritical world, not as wild as the supercritical one, but sitting precisely on the edge.

This critical regime is the subject of the paper. Think of it like water at its boiling point: the behavior is qualitatively different, balanced right between two extremes.


What Does “Logarithmic Non-Differentiability” Mean?

To test differentiability, we look at 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 Q(x,h)Q(x,h) approaches a finite limit as h0h \to 0, that limit is the derivative.

  • In the subcritical regime, Q(x,h)Q(x,h) stays bounded, so differentiability might exist (but actually it fails everywhere).

  • In the supercritical regime, Q(x,h)Q(x,h) explodes like a power law — very fast divergence.

  • In the critical regime, the paper proves Q(x,h)Q(x,h) behaves like Θ(logh)\Theta(|\log h|).

This means that if you zoom in by a factor of 10, the effective “slopes” get larger by about a constant amount. It’s slower than polynomial growth, but it still diverges without bound. That’s why the function is nowhere differentiable — but in a softer, logarithmic sense.


The Proof Idea (Expository Sketch)

The heart of the proof lies in exploiting the self-similarity of the Takagi function. The key is a recurrence relation:

Q(x,h)=Qτ(x,h)+Q(βx,βh).Q(x,h) = Q_\tau(x,h) + Q(\beta x, \beta h).

This says: the slope at scale hh can be broken down into the slope of the sawtooth piece plus a rescaled slope at a finer scale.

The paper’s strategy is to:

  1. Pick the right scales (“good scales”) — Using properties of base-β\beta expansions, the authors show there are infinitely many scales where the sawtooth terms add up nicely.

  2. Control the signs — By carefully flipping directions, they ensure these contributions don’t cancel out.

  3. Sum it up — At these good scales, the difference quotients grow linearly with the number of terms, which translates into logarithmic growth when expressed in terms of hh.

It’s an elegant telescoping argument, turning the function’s self-similar structure against itself.


Why Is This Important?

The critical Takagi function is more than a curiosity — it’s a test case for phase transitions in analysis.

  • In physics, phase transitions (solid ↔ liquid ↔ gas) are points where behavior changes abruptly.

  • In analysis, the parameter αβ\alpha \beta plays a similar role, dictating whether the function is smooth-ish, moderately rough, or extremely rough.

  • The critical threshold is the knife-edge between stability and chaos.

This mirrors other famous pathological functions: for instance, Weierstrass’s function also has a critical parameter where its regularity changes. But while Weierstrass’s oscillations are trigonometric and lead to power-law growth, Takagi’s linear sawtooth oscillations produce the subtler logarithmic growth. Different mechanisms, different outcomes.


Open Directions

The paper closes with several intriguing questions:

  1. Exact Constants: Can we pin down the precise growth constants that govern the logarithmic blow-up?

  2. Fractal Dimension: What is the Hausdorff dimension of the graph at the critical threshold? Does it differ from sub- and supercritical cases?

  3. Multifractal Spectrum: How do the local Hölder exponents distribute across the function?

  4. Random Versions: What happens if we randomize the coefficients? Does the critical logarithmic behavior persist?

  5. Higher Dimensions: Can similar phenomena be constructed in functions of several variables?

These aren’t just technical details — they connect fractal analysis, probability, dynamical systems, and number theory.


Conclusion

With this result, the regularity trichotomy of the generalized Takagi function is complete:

  • Subcritical: Lipschitz, bounded slopes.

  • Critical: Continuous, nowhere differentiable, with logarithmic slope blow-up.

  • Supercritical: Continuous, nowhere differentiable, with power-law slope blow-up.

The critical case is a perfect example of how mathematics often hides its richest behavior right at the boundary. Just as water is most interesting at 0° and 100°, the Takagi function reveals its most delicate structure at αβ=1\alpha \beta = 1.

For mathematicians fascinated by fractals, pathological functions, and the geometry of roughness, the critical Takagi function stands as a reminder: sometimes the real magic is not in the extremes, but in the threshold between them.



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