claimroutineinferred_dep
Output is simple bipartite translation game
Output is a simple bipartite translation game over
checks the structural requirements of the output
Statement (paper)
The output is a simple bipartite graph, with vertex sets the -fold products of the two sides of , and uniform edge sampling on is independent uniform edge sampling in the coordinates. Every constraint of is a translation of , with fixed by the prescribed errors, the translation having offset built from the translation offsets of .
In plain English
The output game is a simple bipartite graph on -fold products of the sides of , where sampling a uniform edge of amounts to sampling independent uniform edges of in each of the coordinates. Each constraint of is a translation on with fixed by the target errors, and the offset is built from the offsets of .
Why it's here
This claim checks that the tensor power keeps the structural requirements of the theorem: simplicity, bipartiteness, unweighted uniform edge sampling, and translation constraints over . It works because is already an unweighted simple bipartite translation game by the subdivision lemma, and products of such edges and constraints act coordinatewise, so the properties carry over to .
Classified routine:
Direct bookkeeping consequence of the subdivision lemma (lem-unweighted-subdivision): tensor powers of an unweighted simple bipartite translation game act coordinatewise on edges and constraints, so simplicity, bipartiteness, uniform sampling and translation form carry over.
Uses
Used by
Nothing in the paper
Sources
PaperOpen
- Section
- §7.2 The final reduction
- Page
- —
- Label
—- Line
sections/06-finish.tex:204
Leannot aligned
Phase 2 aligns this node to a Lean declaration.
Friction
- infoinferred_depoutline: "Output is simple bipartite translation game" rests on lem:unweighted-subdivision