This page builds every symbol used in Vanishing gradients in RNNs from nothing. If you have never seen ht, tanh, a derivative, or ∏ before, start at line one and do not skip.
The picture shows a row of boxes left-to-right. Each box is one time step. The topic constantly says things like "many time steps ago" — that just means a box far to the left of the current one. The gap between two positions is written (T−t), the number of steps between step t and the final step T.
Left figure: a single dot on a number line = one number (a scalar). Right figure: an arrow / column of stacked cells = a vector, a bundle of numbers travelling together.
Why the topic needs it: the whole problem is that information in ht (like "the subject was singular") must survive from an early step to a late one. If the memory-to-memory link is weak, that fact is lost.
The figure shows a small arrow being turned into a longer, rotated arrow by "multiply by W". The key thing to feel: multiplying by the sameW over and over either keeps stretching (arrows grow) or keeps shrinking (arrows collapse). That repeated stretch/shrink is the seed of both exploding and vanishing gradients.
Notice the flat tails in the figure. When z is large the curve is nearly flat — moving z barely changes the output. "Flat" is the villain of the next section.
Why this tool and not another? Learning means adjusting knobs to reduce error. To know which way to turn a knob, we need "if I change this input a little, does the error go up or down, and how fast?" — that is the derivative. No other tool answers the sensitivity question.
The figure overlays tanh(z) (top) with its derivative tanh′(z)=1−tanh2(z) (bottom, a hump).
This single fact — the multiplier is between 0 and 1 — is what makes the tanh factor a shrinking factor in the topic.
The picture is a relay race: the baton (the gradient signal) passes ht→ht+1→⋯→hT. Each handoff multiplies by that step's local sensitivity. Multiplying many numbers, each below 1, drives the total toward zero. That is vanishing gradients in one sentence.
Why the topic needs the chain rule: the loss lives at the end (t=T) but the parameters live at every step. The chain rule is the only bridge that carries blame from the end back to the beginning.
That collapse is exactly why plain RNNs fail on long dependencies, and why LSTM Architecture, GRU Architecture, Residual Connections and Attention Mechanisms were invented to give the gradient a shortcut.