← Back to article

Equation 20 · Retrieval Is an Evidence System, Not a Memory

What does this equation mean?

P(correct)=P(Zk(x)∩S(x)≠∅)⋅P(grounded∣Zk(x)∩S(x)≠∅)P(\text{correct}) = P\left(\mathcal{Z}_k(x) \cap S(x) \neq \emptyset\right) \cdot P\left(\text{grounded} \mid \mathcal{Z}_k(x) \cap S(x) \neq \emptyset\right)

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

PP

Symbol P

P is part of the quantity the equation computes from the expression on the right.

Understand this part →

Zk\mathcal{Z}_k

Symbol Z_k

ZkZ_k is one factor in the product that computes the quantity on the left.

Understand this part →

xx

Symbol x

x is one factor in the product that computes the quantity on the left.

Understand this part →

SS

Symbol S

S is one factor in the product 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 →
multiplication

multiplication

Multiply the quantities on either side.

Understand this part →

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 →

How to interpret it

Read it with the definitions, units, and assumptions supplied by the article.

What the article says around this equation

Because retrieval and generation are separable, an end-to-end score is nearly uninformative about which one broke. Decompose it. Let Zk(x)\mathcal{Z}_k(x) be the retrieved set and S(x) the set of spans that would suffice to answer x : P(correct)=P(Zk(x)∩S(x)≠∅)⋅P(grounded∣Zk(x)∩S(x)≠∅)P(\text{correct}) = P\left(\mathcal{Z}_k(x) \cap S(x) \neq \emptyset\right) \cdot P\left(\text{grounded} \mid \mathcal{Z}_k(x) \cap S(x) \neq \emptyset\right). The first factor is a pure retrieval quantity: recall at k , measurable against relevance judgements with no generator involved, using the established information-retrieval apparatus that BEIR standardised [ 6 ] . The second is a pure generation quantity: given that sufficient evidence was present, did the model use it faithfully? Es and colleagues built RAGAS to score exactly this separation — retrieval effectiveness, the faithfulness with…
Read the full surrounding passage
Because retrieval and generation are separable, an end-to-end score is nearly uninformative about which one broke. Decompose it. Let Zk(x)\mathcal{Z}_k(x) be the retrieved set and S(x) the set of spans that would suffice to answer x : P(correct)=P(Zk(x)∩S(x)≠∅)⋅P(grounded∣Zk(x)∩S(x)≠∅)P(\text{correct}) = P\left(\mathcal{Z}_k(x) \cap S(x) \neq \emptyset\right) \cdot P\left(\text{grounded} \mid \mathcal{Z}_k(x) \cap S(x) \neq \emptyset\right). The first factor is a pure retrieval quantity: recall at k , measurable against relevance judgements with no generator involved, using the established information-retrieval apparatus that BEIR standardised [ 6 ] . The second is a pure generation quantity: given that sufficient evidence was present, did the model use it faithfully? Es and colleagues built RAGAS to score exactly this separation — retrieval effectiveness, the faithfulness with which the model uses retrieved passages, and generation quality — as a reference-free evaluation that does not require ground-truth answers, enabling faster iteration [ 17 ] .

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 Retrieval Is an Evidence System, Not a Memory

See this formula across 1 published context →

Browse the mathematical compendium →