Positions of alternate
ProvedAJGames.imp_altFor all games , every position of alternates between Player and Opponent moves.
It follows from the tensor's alternation clause alone, without using that the positions of and alternate.
import Mathlib import Definitions.Def_AJGames_Game import Definitions.Def_AJGames_Tensor
namespace AJGames
/-- **Positions of `A ⊸ B` alternate by T1 alone** (Abramsky and Jagadeesan, *Games and Full Completeness for Multiplicative Linear Logic*, J. Symbolic Logic 59(2) (1994), §3.2: `A ⊸ B := (A ⊗ B⊥)⊥`). No alternation of `A` or `B` is used.
AJ axioms used: T1 only. -/
theorem imp_alt (A B : Game) {s : List (Game.imp A B).M} (h : s ∈ (Game.imp A B).pos) :
Alt (Game.imp A B).lab s := by sorry
end AJGamesRead-back
What the Lean code literally says, in plain math · claude-opus-5-5
Setting. Players are and , with swapping them. A game has a move type , a labelling , and a set of finite move sequences that contains the empty sequence, is prefix-closed, and in which every position alternates: consecutive moves have different labels. A sequence alternates for a labelling , written , when for all (vacuous for ).
The dual keeps moves and positions and swaps every label. For labellings on and on , write for the combined labelling on the disjoint union , and define the relation on by
For a sequence in , and are the subsequences of left and right moves. The tensor has moves , labelling , and positions the sequences such that every consecutive pair satisfies (for ), and . The linear implication is
Concretely, has moves ; its labelling sends a left move to and a right move to (i.e. ); its positions are the sequences whose consecutive pairs satisfy computed with and , with and .
Statement. For all games and every finite sequence of moves of : if is a position of , then alternates for the labelling of ,
The alternation is with respect to the outer labelling of (left labels flipped, right labels as in ), not the labelling used inside . Sequences of length or alternate trivially. Note that alternation of every position is one of the conditions in the definition of a game, and is itself constructed as a game.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.