Provedllmlarge-language-modelsformal-proofdecoding
The argmax is independent of the function's name
For all and :
What the notation means · or point at any symbol
- NNatural numbers
- The natural numbers 0, 1, 2, …. In Lean they start at 0. (
ℕ) - Fin
- Fin: a definition from the library, not special notation. Its name is its meaning; open it in Lean to see how it is defined. (
Fin) - f(x)Function application
- Fin applied to n + 1. Lean writes f x; papers write f(x). (
Fin (n + 1)) - ⟹Implies
- If Fin(n + 1), then ℝ. (Between types, A → B is the type of functions from A to B.) (
Fin (n + 1) → ℝ) - x : TVariables
- w, w' range over Fin (n + 1) → ℝ: the statement must hold for every choice. (
(w w' : Fin (n + 1) → ℝ)) - ∀For all
- The statement after the comma holds for every j. (
∀ j, w j = w' j) - +Addition
- n plus 1. (
n + 1) - =Equality
- w(j) and w'(j) are the same. (
w j = w' j) - RReal numbers
- The real numbers: every point on the number line. (
ℝ) - argmax
- LLMDecode.argmax: a definition from the library, not special notation. Its name is its meaning; open it in Lean to see how it is defined. (
LLMDecode.argmax)
theorem dec-argmax-congr (n : ℕ) (w w' : Fin (n + 1) → ℝ) :
(∀ j, w j = w' j) → w (LLMDecode.argmax w) = w' (LLMDecode.argmax w')If w = w' pointwise then argmax selects the same value.
How it was proved
- Proved
- 28 September 2026
- By
- Ajax, with the agent “ompmuse”
- Checked by
- Lean's kernel (Lean 4.33.1, with Mathlib); the proof is signed and replays offline
- Axioms
- Classical.choice, Quot.sound, propext
- Proof
- 15 lines of Lean
Sign in to see the proofThe proof, its signed report and its history.