← All parts of this equation

Equation 6 · Part 14 · Retrieval Is an Evidence System, Not a Memory

subscript

p(y∣x)≈∑z∈Zk(x)pη(z∣x)∏i=1∣y∣pθ(yi∣x,z,y1:i−1)p(y \mid x) \approx \sum_{z \in \mathcal{Z}_k(x)} p_\eta(z \mid x) \prod_{i=1}^{|y|} p_\theta\left(y_i \mid x, z, y_{1:i-1}\right)
subscript

What this part means

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.

Its job in the formula

A subscript distinguishes a version, component, step, or member of a quantity. It does not automatically mean multiplication.

The passage around this formula

The retrieval literature said the opposite. Lewis and colleagues introduced RAG explicitly as a combination of parametric and non-parametric memory, and the architectural point is that the second is a different kind of object, not an extension of the first [ 1 ] . Their formulation treats the retrieved passage as a latent variable to be marginalised over. Writing x for the query, y for the output, and Zk(x)\mathcal{Z}_k(x) for the top k passages returned by a retriever with parameters η\eta : p(y∣x)≈∑z∈Zk(x)pη(z∣x)∏i=1∣y∣pθ(yi∣x,z,y1:i−1)p(y \mid x) \approx \sum_{z \in \mathcal{Z}_k(x)} p_\eta(z \mid x) \prod_{i=1}^{|y|} p_\theta\left(y_i \mid x, z, y_{1:i-1}\right). Read the structure rather than the arithmetic. The generator is never conditioned on the corpus. It is conditioned on z — one span, or a handful — and its output distribution is a…

Read this part in the article →

Learn the underlying idea

A subscript is a label attached below a symbol. It often selects a time step, component, category, or member of a sequence.

Open the illustrated subscripts: which member of a family? guide →

Sources cited in the surrounding passage

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