Equation 7 · 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 p
p appears in the conditional probability being evaluated. The vertical bar identifies the information or condition supplied to that probability.
Symbol y
y appears in the conditional probability being evaluated. The vertical bar identifies the information or condition supplied to that probability.
Symbol x
x appears in the bound of this sum. The bound states where the repeated operation starts, ends, or which values it includes.
Symbol z
z appears in the bound of this sum. The bound states where the repeated operation starts, ends, or which values it includes.
Symbol Z_k
appears in the bound of this sum. The bound states where the repeated operation starts, ends, or which values it includes.
Symbol p_eta
ta is an input to the expression that computes the quantity on the left.
Symbol p_θ
p_θ 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.
Starting index or lower bound: z in Z_k(x)
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.
How to interpret it
Read it with the definitions, units, and assumptions supplied by the article.
What the article says around this equation
Retrieval-augmented generation is routinely marketed as “giving the model your data.” The original RAG formulation was more precise: combine parametric memory in a sequence model with non-parametric memory in an external index. A simplified sequence-level expression is . where the retriever assigns probability to documents z and the generator conditions on a selected set [ 6 ] . The decomposition matters because retrieval and generation fail differently.
Sources cited in the surrounding passage
These citations give research context. Read each source to check which claims it supports.
Return to Reliable AI Agents Are Control Systems, Not Chatbots