Provedllmlarge-language-modelsformal-proofperplexity
One-step perplexity is the reciprocal probability
For all :
What the notation means · or point at any symbol
- 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 1. Lean writes f x; papers write f(x). (
Fin 1) - ⟹Implies
- If Fin(1), then ℝ. (Between types, A → B is the type of functions from A to B.) (
Fin 1 → ℝ) - <Less than
- 0 is strictly smaller than p(0). (
0 < p 0) - RReal numbers
- The real numbers: every point on the number line. (
ℝ) - perplex
- LLMLM.perplex: a definition from the library, not special notation. Its name is its meaning; open it in Lean to see how it is defined. (
LLMLM.perplex) - =Equality
- perplex(_ ↦ 1, p) and 1/p(0) are the same. (
LLMLM.perplex (fun _ => (1:ℝ)) p = 1 / …) - x ↦ f(x)Function (λ-abstraction)
- The function sending _ to 1. Lean writes fun x => …; papers write x ↦ …. (
fun _ => (1:ℝ)) - (x : T)As real numbers
- 1 read as an element of real numbers. Mathematicians leave this implicit; Lean needs it to know which kind of number is meant. (
(1:ℝ)) - a/bDivision
- 1 divided by p(0). In Lean, dividing by 0 gives 0. (
1 / p 0)
theorem perplex-single (p : Fin 1 → ℝ) :
0 < p 0 → LLMLM.perplex (fun _ => (1:ℝ)) p = 1 / p 0perplex of a delta at the only index equals 1 / p 0 for 0 < p 0.
How it was proved
- Proved
- 27 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
- 17 lines of Lean
Sign in to see the proofThe proof, its signed report and its history.