Proof of `Encoding finite projection-game answers as binary words` (3rd statement)
groundedproofs/Lax253009Proofs/ProjectionEncoding.lean · lax-253009
What this proof establishes
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
A winning encoded transcript has two valid encodings. Decoding and filling missing answers arbitrarily gives total original strategies that still win on each such transcript.