The tensor cannot beat its components
ProvedAJOnline.tensor_tight_leftLet be costed games, a strategy on and a strategy on , and suppose of the empty play is . If is -competitive on , then is -competitive on .
So the ratio in the tensor law cannot be improved in general.
import Mathlib import Definitions.Def_AJOnline_CostedGame
namespace AJOnline
open AJGames
open scoped ENNReal NNReal
universe u
/-- **Tightness of the tensor bound.** If `σ ⊗ τ` is `(ρ, b)`-competitive on `C ⊗ D` and `D`'s
offline optimum on the empty play is `0`, then `σ` alone is `(ρ, b)`-competitive on `C`: Opponent may
keep every request in the left component. Hence no ratio below `ρ₁` (and, symmetrically, `ρ₂`) works for
the tensor, so `max ρ₁ ρ₂` in `tensor_competitive` is optimal. AJ axioms used: G3 for `C` (the
left-only play satisfies the tensor's alternation), G1 for `D`; no switching occurs, so T2 is not used. -/
theorem tensor_tight_left (C D : CostedGame.{u}) (σ : Strategy C.G) (τ : Strategy D.G) (ρ b : ℝ≥0)
(hD : D.opt [] = 0) (h : Competitive (C.tensor D) (tensorS σ τ) ρ b) :
Competitive C σ ρ b := by sorry
end AJOnlineRead-back
What the Lean code literally says, in plain math · claude-opus-5-5
Read-back of tensor_tight_left (competitiveness of a tensor passes to its left factor).
Games and strategies. A game has a type of moves , a labelling , and a set of finite move sequences containing the empty sequence , prefix-closed, with consecutive moves always differently labelled. A strategy on is a set of sequences with , prefix-closed, nonempty members starting with an -move, deterministic on -moves after a common prefix, and receptive (closed under legal -extensions).
Tensor. has moves with inherited labels; is a position iff its restrictions and (subsequences of moves from each component) are positions of the respective games and every consecutive pair is differently labelled and either in the same component or has -labelled. For strategies , .
Costed games. A costed game is a game with arbitrary functions from finite sequences to . For nonnegative reals , a strategy is -competitive on iff for every (arithmetic in , ). The tensor uses the game and the costs , .
Statement. For all costed games , every strategy on , every strategy on , and all nonnegative reals : if
and is -competitive on , i.e.
then is -competitive on :
Notes on hypotheses. The only condition on is ; nothing is assumed about , about at nonempty sequences, or about beyond its being a strategy. The parameters are the same in hypothesis and conclusion. Costs may be . If , the conclusion concerns only .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.