Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemmas 1 and 2 — logit selection probabilities if and only if extreme value shocks

Proved
McFadden1974.RandomUtility.logit_iff_extreme_value

by mikedeng1 · Oct 5, 2026 · Mathlib 0df444a (Lean v4.33.1)

conditional-logitextreme-valuep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1random-utility

Fix a universe XXX and a surjective representative utility map u:X→Ru:X\to\mathbb Ru:X→R. Let the taste shocks of the random utility model be independent and identically distributed with a translation complete law μ\muμ on R\mathbb{R}R whose distribution function GGG satisfies the normalization G(0)=e−1G(0) = e^{-1}G(0)=e−1. Then the following are equivalent:

  1. for every finite subset B⊆XB\subseteq XB⊆X and every alternative i∈Bi\in Bi∈B,
Pr⁡[u(j)+εj<u(i)+εi for all j≠i]=eu(i)∑j∈Beu(j);\Pr\big[u(j) + \varepsilon_j < u(i) + \varepsilon_i \ \text{for all } j \ne i\big] = \frac{e^{u(i)}}{\sum_{j\in B} e^{u(j)}};Pr[u(j)+εj​<u(i)+εi​ for all j=i]=∑j∈B​eu(j)eu(i)​;
  1. G(ε)=e−e−εG(\varepsilon) = e^{-e^{-\varepsilon}}G(ε)=e−e−ε for every real ε\varepsilonε.

This is the characterization announced on p. 111 of the paper: "under mild conditions the distribution (13) characterizes the population choice models whose selection probabilities satisfy Equation (12)". It justifies reading a conditional logit model as a model of utility-maximizing individuals with extreme value taste shocks.

Formalization Note Direction 2 ⇒ 1 is Lemma 1 and needs neither translation completeness nor the normalization; 1 ⇒ 2 is Lemma 2. The hypotheses are satisfiable: the extreme value law is translation complete (footnote 5 of the paper) and has G(0)=e−1G(0) = e^{-1}G(0)=e−1. Condition 1 is required for every finite subset of the stated universe; distinct alternatives may have equal utilities.


Retired 2026-10-27: a Lean-vs-paper fidelity audit found this statement weaker than, or narrower than, the cited result. A corrected statement will be resubmitted.

Preamble
import Mathlib
import Definitions.Def_McFadden1974_RandomUtility_Model

open MeasureTheory ProbabilityTheory Finset
Formal statement
namespace McFadden1974.RandomUtility

/-- **Lemmas 1 and 2 — the extreme value law characterizes logit random utility models**
(McFadden, Conditional Logit Analysis of Qualitative Choice Behavior, in Frontiers in Econometrics
(1974), pp. 111–112, Lemmas 1 and 2; PDF pp. 7–8; p. 111: "The next lemma establishes that under
mild conditions the distribution (13) characterizes the population choice models whose selection
probabilities satisfy Equation (12).").

Fix an alternative universe `X` and a representative utility map `u : X → ℝ` that is onto.
Let the shocks be i.i.d. with a translation complete law `μ` normalized by `G(0) = e^{−1}`.
Then the selection probabilities on every finite subset of `X` satisfy (12) if and only if
`G(ε) = e^{−e^{−ε}}` for every `ε`.

Formalization Note: the direction ← is Lemma 1 (which needs neither translation completeness nor
the normalization); → is Lemma 2 with the normalization `G(0) = e^{−1}`. The hypotheses are
satisfiable: the law (13) is translation complete (footnote 5, p. 111) and has `G(0) = e^{−1}`.
The selection probabilities are those of (2), with strict inequalities and no density assumed;
`IsLogitOn` covers finite subsets of `X`, including repeated utility values. -/
theorem logit_iff_extreme_value (μ : Measure ℝ) [IsProbabilityMeasure μ]
    {X : Type*} (u : X → ℝ) (hu : Function.Surjective u)
    (hTC : TranslationComplete μ) (h0 : cdf μ 0 = Real.exp (-1)) :
    IsLogitOn μ u ↔ IsExtremeValue μ := by sorry

end McFadden1974.RandomUtility
Source
McFadden, Conditional Logit Analysis of Qualitative Choice Behavior, in P. Zarembka (ed.), Frontiers in Econometrics, Academic Press (1974), pp. 111-112, Lemmas 1 and 2 (PDF pp. 7-8)
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 5, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me