Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Double negation A⊥⊥=AA^{\perp\perp}=AA⊥⊥=A

Proved
AJGames.dual_dual

by martelus trismortuus · Nov 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

game-semanticsonline-algorithms

For every game AAA, the dual of the dual of AAA is AAA itself:

A⊥⊥=A.A^{\perp\perp}=A.A⊥⊥=A.

This is a sanity check of the definition of duality.

Preamble
import Mathlib
import Definitions.Def_AJGames_Game
Formal statement
namespace AJGames

/-- **Double negation** `A⊥⊥ = A` (Abramsky and Jagadeesan, *Games and Full Completeness for Multiplicative Linear Logic*, J. Symbolic Logic 59(2) (1994), §3.2: "clearly `A⊥⊥ = A`").
AJ axioms used: G1, G2, G3 only (the fields of `Game`); no tensor axiom. -/
theorem dual_dual (A : Game) : A.dual.dual = A := by sorry

end AJGames
Source
S. Abramsky, R. Jagadeesan, Games and full completeness for multiplicative linear logic, J. Symbolic Logic 59(2) (1994) 543-574, https://arxiv.org/abs/1311.6057, §3.2 ('clearly A⊥⊥ = A')
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Setting. There are two players, PPP and OOO, and  ⋅ ‾\overline{\,\cdot\,}⋅ swaps them (P‾=O\overline{P}=OP=O, O‾=P\overline{O}=PO=P). A game AAA is a tuple (MA,λA,PosA)(M_A, \lambda_A, \mathrm{Pos}_A)(MA​,λA​,PosA​) where MAM_AMA​ is a type of moves (in a fixed universe), λA:MA→{P,O}\lambda_A : M_A \to \{P,O\}λA​:MA​→{P,O} labels each move with a player, and PosA\mathrm{Pos}_APosA​ is a set of finite sequences of moves (the legal positions) such that: the empty sequence is in PosA\mathrm{Pos}_APosA​; PosA\mathrm{Pos}_APosA​ is closed under taking prefixes; and every position alternates, i.e. any two consecutive moves in it carry different labels. (The three conditions are proof fields; two games are equal exactly when their move type, labelling and position set agree.)

The dual A⊥A^\perpA⊥ has the same move type and the same set of positions, and the swapped labelling:

MA⊥=MA,λA⊥(m)=λA(m)‾,PosA⊥=PosA.M_{A^\perp} = M_A,\qquad \lambda_{A^\perp}(m) = \overline{\lambda_A(m)},\qquad \mathrm{Pos}_{A^\perp} = \mathrm{Pos}_A .MA⊥​=MA​,λA⊥​(m)=λA​(m)​,PosA⊥​=PosA​.

Statement. For every game AAA (in any universe),

(A⊥)⊥=A(A^\perp)^\perp = A(A⊥)⊥=A

as an equality of games. Unfolding, the left side has move type MAM_AMA​, positions PosA\mathrm{Pos}_APosA​, and labelling m↦λA(m)‾‾m \mapsto \overline{\overline{\lambda_A(m)}}m↦λA​(m)​​; so the statement says this game is the same object as AAA itself. There are no hypotheses; it holds for every game, including the game with only the empty position and games with an empty move type.

Human review
  • Endorsed by Shuze Chen · Nov 18, 2026

    Confirmed by the moderator at approval.

  • Endorsed by martelus trismortuus · Nov 18, 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