OAI/Computability/UniqueGames/Games/UniformTarget.lean
15 declarations, 0 contain sorry, 0 declared as axioms
- theorem
OAI.UniqueGamesTheorem.Explicit.UniformTarget.copy_lengthline 14 - def
OAI.UniqueGamesTheorem.Explicit.UniformTarget.constructline 22 - theorem
OAI.UniqueGamesTheorem.Explicit.UniformTarget.verticesline 30 - theorem
OAI.UniqueGamesTheorem.Explicit.UniformTarget.edge_countline 33 - theorem
OAI.UniqueGamesTheorem.Explicit.UniformTarget.count_appendline 37 - theorem
OAI.UniqueGamesTheorem.Explicit.UniformTarget.count_copiesline 42 - theorem
OAI.UniqueGamesTheorem.Explicit.UniformTarget.countline 52 - theorem
OAI.UniqueGamesTheorem.Explicit.UniformTarget.maxSatisfiedline 57 - theorem
OAI.UniqueGamesTheorem.Explicit.UniformTarget.valueline 71 - theorem
OAI.UniqueGamesTheorem.Explicit.UniformTarget.mem_originalline 81 - theorem
OAI.UniqueGamesTheorem.Explicit.UniformTarget.translationsline 88 - theorem
OAI.UniqueGamesTheorem.Explicit.UniformTarget.flatMap_copiesline 95 - theorem
OAI.UniqueGamesTheorem.Explicit.UniformTarget.encode_copiesline 103 - theorem
OAI.UniqueGamesTheorem.Explicit.UniformTarget.gameWords_constructline 112Source documentation
The complete output keeps the two first headers and scales the edge count.
theorem gameWords_construct {q : Nat} (C : Nat) (hC : 0 < C) (g : Instance q) : gameWords (construct C hC g) = [g.vertices, q, C * g.constraints.length] ++ copyMajor C (g.constraints.flatMap constraintWords) := by …Mentions: OAI.UniqueGamesTheorem.Explicit.UniformTarget.construct
- theorem
OAI.UniqueGamesTheorem.Explicit.UniformTarget.gameBits_constructline 120