← All parts of this equation

Equation 12 · Part 9 · Reliable AI Agents Are Control Systems, Not Chatbots

Ending index or upper bound: n

Pr⁡(task success)=∏i=1npi.\Pr(\text{task success}) = \prod_{i=1}^{n} p_i.
nn

What this part means

This label says where the repeated addition, multiplication, or accumulation stops. It sets the last term or end of the range.

Its job in the formula

n appears in the bound of this product. The bound states where the repeated operation starts, ends, or which values it includes.

The passage around this formula

Single-turn model quality can hide long-horizon fragility. Suppose a task has n dependent stages and each stage succeeds with conditional probability pip_i given that all previous stages succeeded. Then Pr⁡(task success)=∏i=1npi\Pr(\text{task success}) = \prod_{i=1}^{n} p_i. If one makes the deliberately crude assumption pip_i=p , a 98% reliable stage repeated 50 times yields 0.98^{50}≈\approx0.364 . Real agent steps are neither…

Read this part in the article →

Learn the underlying idea

Σ adds a collection of terms. Π multiplies them. The lower and upper labels tell you which terms belong to the collection.

Open the illustrated sums and products: repeat an operation over an index guide →

See this notation across published equations →

Sources cited in the article section

These citations provide research context; check each source for the exact claim it supports.