← Back to article

Equation 7 · Reliable AI Agents Are Control Systems, Not Chatbots

What does this equation mean?

p(y∣x)=∑z∈Zk(x)pη(z∣x) pθ(y∣x,z),p(y \mid x) = \sum_{z \in \mathcal{Z}_k(x)} p_\eta(z \mid x)\,p_\theta(y \mid x,z),

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.

Inputs and operationssum_z in Z_k(x) p_eta(z mid x)p_θ(y mid x,z)
Result or conditionp(y mid x)
How to read the two sides of this formula. Follow the article passage for the meaning of each quantity.

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

pp

Symbol p

p appears in the conditional probability being evaluated. The vertical bar identifies the information or condition supplied to that probability.

Understand this part →

yy

Symbol y

y appears in the conditional probability being evaluated. The vertical bar identifies the information or condition supplied to that probability.

Understand this part →

xx

Symbol x

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

Understand this part →

zz

Symbol z

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

Understand this part →

Zk\mathcal{Z}_k

Symbol Z_k

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

Understand this part →

pηp_\eta

Symbol p_eta

pep_eta is an input to the expression that computes the quantity on the left.

Understand this part →

pθp_\theta

Symbol p_θ

p_θ is an input to the expression that computes the quantity on the left.

Understand this part →

=

=

The expressions on both sides represent the same quantity under the stated assumptions.

Understand this part →

See an illustrated explanation →
subscript

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.

Understand this part →

z∈Zk(x)z \in \mathcal{Z}_k(x)

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.

Understand this part →

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 p(y∣x)=∑z∈Zk(x)pη(z∣x) pθ(y∣x,z)p(y \mid x) = \sum_{z \in \mathcal{Z}_k(x)} p_\eta(z \mid x)\,p_\theta(y \mid x,z). where the retriever assigns probability to documents z and the generator conditions on a selected set Zk(x)\mathcal{Z}_k(x) [ 6 ] . The decomposition matters because retrieval and generation fail differently.

Read the equation in its article →

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

See this formula across 1 published context →

Browse the mathematical compendium →