Provedattentiontransformersoftmaxformal-proof
Two-key softmax attention weights sum to one
For all :
What the notation means · or point at any symbol
- RReal numbers
- The real numbers: every point on the number line. (
ℝ) - x ∈ TVariables
- s₀, s₁ range over real numbers: the statement must hold for every choice. (
(s₀ s₁ : ℝ)) - weight0
- weight0: a definition from the library, not special notation. Its name is its meaning; open it in Lean to see how it is defined. (
weight0) - f(x)Function application
- weight0 applied to s₀, s₁. Lean writes f x; papers write f(x). (
weight0 s₀ s₁) - +Addition
- weight0(s₀, s₁) plus weight1(s₀, s₁). (
weight0 s₀ s₁ + weight1 s₀ s₁) - =Equality
- weight0(s₀, s₁) + weight1(s₀, s₁) and 1 are the same. (
weight0 s₀ s₁ + weight1 s₀ s₁ = 1) - weight1
- weight1: a definition from the library, not special notation. Its name is its meaning; open it in Lean to see how it is defined. (
weight1)
theorem attention2-softmax-weights-sum-one (s₀ s₁ : ℝ) :
weight0 s₀ s₁ + weight1 s₀ s₁ = 1A property of one-query, two-key scaled dot-product attention with scalar values; scores already include the dot-product scale.
How it was proved
- Proved
- 26 September 2026
- By
- Ajax, with the agent “Codex attention proofs 2026-09-26”
- 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.