Equation 12 · Reliable AI Agents Are Control Systems, Not Chatbots
What does this equation mean?
Read the formula alongside the article passage below. Each part has a deeper page with its role in the equation, the supporting passage and nearby citations.
This equation states an equality: the expressions on both sides have the same value under the article’s assumptions. Read the equation part by part below; each part has a contextual explanation and a link to its mathematical background.
Read it piece by piece
Symbol i
i appears in the bound of this product. The bound states where the repeated operation starts, ends, or which values it includes.
Symbol p_i
is an input to the expression that computes the quantity on the left.
=
The expressions on both sides represent the same quantity under the stated assumptions.
See an illustrated explanation →subscript
The lower label selects a particular version, component, or indexed member of the quantity. For example, x₀ and xₜ can be values at different positions.
superscript
A raised number can be a power. When it is a label or bound, it selects a case or the upper limit of a sum; the formula’s structure distinguishes these uses.
See an illustrated explanation →Probability operator
The probability operator gives the chance of the event named inside its brackets or parentheses.
Starting index or lower bound: i=1
This label says where the repeated addition, multiplication, or accumulation starts. Read its value or condition together with the article’s description of the index.
Ending index or upper bound: n
This label says where the repeated addition, multiplication, or accumulation stops. It sets the last term or end of the range.
How to interpret it
Read it with the definitions, units, and assumptions supplied by the article.
What the article says around this equation
Single-turn model quality can hide long-horizon fragility. Suppose a task has n dependent stages and each stage succeeds with conditional probability given that all previous stages succeeded. Then . If one makes the deliberately crude assumption =p , a 98% reliable stage repeated 50 times yields 0.98^{50}0.364 . Real agent steps are neither independent nor identically distributed: an early mistake can corrupt later observations, while a test can expose and reverse it. The simple product is useful because it reveals the architecture’s burden. Long tasks require mechanisms that change conditional probabilities after observing evidence , not merely a model with…
Read the full surrounding passage
Single-turn model quality can hide long-horizon fragility. Suppose a task has n dependent stages and each stage succeeds with conditional probability given that all previous stages succeeded. Then . If one makes the deliberately crude assumption =p , a 98% reliable stage repeated 50 times yields 0.98^{50}0.364 . Real agent steps are neither independent nor identically distributed: an early mistake can corrupt later observations, while a test can expose and reverse it. The simple product is useful because it reveals the architecture’s burden. Long tasks require mechanisms that change conditional probabilities after observing evidence , not merely a model with a flattering average.
Sources cited in the article section
- [9] SWE-bench: Can Language Models Resolve Real-World GitHub Issues? ↗
- [10] tau-bench: A Benchmark for Tool-Agent-User Interaction in Real-World Domains ↗
These citations give research context. Read each source to check which claims it supports.
Return to Reliable AI Agents Are Control Systems, Not Chatbots