Before softmax probabilities appear, the displayed integer logits already have an exact order and exact gaps. This lesson compares a, c, and b on the first row, then leaves the full greedy decode step to the next lesson.
highlighted = computed this step
Order the logits first
The first row of logits is a=3, b=1, c=2. On the number line, the exact order is a > c > b. That ordering is enough for greedy argmax before any probability mass is computed.
a:3>c:2>b:1
Measure the top gaps
The top logit is a=3. Its exact gap a-c is 1, and its exact gap a-b is 2. These are integer differences between displayed logits, not probabilities.
ℓa−ℓc=3−2=1,ℓa−ℓb=3−1=2
The remaining gap
The gap c-b is also exact: c-b = 1. Softmax would preserve this same ordering, but this lesson does not compute probability weights.
ℓc−ℓb=2−1=1
Boundary
Greedy argmax is a from this displayed row. This is one exact logit-row comparison only: no sampling, no probability mass, not model quality, not future behavior, not training, not learning, and not meaning.