Gibbs lemma
Gibbs lemma is a theorem.
All 1 facts, and where they come from
Facts
1 facts · 0 confirmed by two sources · 0 cited · 1 from one source
Where this comes from
Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.
What Wikidata says · copied November 16, 2026 · revision 2435648554
- What it is
- theorem
- Wikipedias with a page
- 1
Wikidata item Q16928506 (wikidata.org/wiki/Q16928506), public domain (CC0). Copied 2026-11-16.
What Wikipedia says · copied November 16, 2026 · revision 1350256688
In game theory and in particular the study of Blotto games and operational research, the Gibbs lemma is a result that is useful in maximization problems. It is named for Josiah Willard Gibbs.
Consider ϕ=∑i=1nfi(xi). Suppose ϕ is maximized, subject to ∑xi=X and xi≥0, at x0=(x10,…,xn0). If the fi are differentiable, then the Gibbs lemma states that there exists a λ such thatf'i(xi0)=λ if xi0>0≤λ if xi0=0.
From the Wikipedia article “Gibbs lemma” (en.wikipedia.org/wiki/Gibbs_lemma), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-16; not changed.
Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.
