OAI/Computability/UniqueGames/Reduction/AddressOutcomeSpecs.lean
28 declarations, 0 contain sorry, 0 declared as axioms
- abbrev
OAI.UniqueGamesTheorem.Reduction.AddressOutcomeSpecs.Specline 14 - abbrev
OAI.UniqueGamesTheorem.Reduction.AddressOutcomeSpecs.Valuesline 15 - abbrev
OAI.UniqueGamesTheorem.Reduction.AddressOutcomeSpecs.Parameterline 16 - def
OAI.UniqueGamesTheorem.Reduction.AddressOutcomeSpecs.bitVectorline 20 - def
OAI.UniqueGamesTheorem.Reduction.AddressOutcomeSpecs.rightMapline 22 - def
OAI.UniqueGamesTheorem.Reduction.AddressOutcomeSpecs.rowline 25 - def
OAI.UniqueGamesTheorem.Reduction.AddressOutcomeSpecs.rowsline 33 - theorem
OAI.UniqueGamesTheorem.Reduction.AddressOutcomeSpecs.row_left_lengthline 37 - theorem
OAI.UniqueGamesTheorem.Reduction.AddressOutcomeSpecs.row_right_lengthline 41 - theorem
OAI.UniqueGamesTheorem.Reduction.AddressOutcomeSpecs.rows_lengthline 45 - theorem
OAI.UniqueGamesTheorem.Reduction.AddressOutcomeSpecs.selected_rowsline 49 - def
OAI.UniqueGamesTheorem.Reduction.AddressOutcomeSpecs.interpretedline 57Source documentation
A total proof-side interpretation. The fallback handles arbitrary malformed static specs; actual canonical rows always take the checked decoding branch.
def interpreted (width : Nat) (bits : List Bool) : {words : List Nat // words.length = width} := … - theorem
OAI.UniqueGamesTheorem.Reduction.AddressOutcomeSpecs.interpreted_encodedline 62 - def
OAI.UniqueGamesTheorem.Reduction.AddressOutcomeSpecs.valuesline 66 - theorem
OAI.UniqueGamesTheorem.Reduction.AddressOutcomeSpecs.row_left_outputline 76 - theorem
OAI.UniqueGamesTheorem.Reduction.AddressOutcomeSpecs.row_right_outputline 82 - theorem
OAI.UniqueGamesTheorem.Reduction.AddressOutcomeSpecs.values_row_leftline 88 - theorem
OAI.UniqueGamesTheorem.Reduction.AddressOutcomeSpecs.values_row_rightline 96 - theorem
OAI.UniqueGamesTheorem.Reduction.AddressOutcomeSpecs.correct_rowsline 104 - theorem
OAI.UniqueGamesTheorem.Reduction.AddressOutcomeSpecs.payload_rowline 120 - def
OAI.UniqueGamesTheorem.Reduction.AddressOutcomeSpecs.rhsBitsline 129 - theorem
OAI.UniqueGamesTheorem.Reduction.AddressOutcomeSpecs.bitVector_rhsBitsline 132 - theorem
OAI.UniqueGamesTheorem.Reduction.AddressOutcomeSpecs.rightMap_actualline 135 - theorem
OAI.UniqueGamesTheorem.Reduction.AddressOutcomeSpecs.payload_row_actualline 141Source documentation
Each static row emits exactly the concrete game's constraint encoding.
theorem payload_row_actual (S : Source) (k : Nat) {s d : Nat} (T : NoiseTables.Table s d) (U : ActualGame.Question S k) (p : Parameter k T) : MachineOutcomeRows.payload (CanonicalAddress.base S.variables S.occurrences s d) (AddressGame.bodyCapacity S k s d) (values (CanonicalBodyTemplate.sourceFields U (ActualGame.names S))) (row T p (rhsBits S U)) = encodeWords (constraintWords (AddressGame.addressEdge S k (TableReduction.tableSkeleton T) (FixedOutcomes.assemble U p))) := by …Mentions: OAI.UniqueGamesTheorem.Reduction.ActualGame.Question, OAI.UniqueGamesTheorem.Reduction.AddressOutcomeSpecs.Parameter, OAI.UniqueGamesTheorem.Reduction.MachineOutcomeRows.payload, OAI.UniqueGamesTheorem.Reduction.CanonicalAddress.base, OAI.UniqueGamesTheorem.Reduction.AddressGame.bodyCapacity, OAI.UniqueGamesTheorem.Reduction.AddressOutcomeSpecs.values, OAI.UniqueGamesTheorem.Reduction.CanonicalBodyTemplate.sourceFields, OAI.UniqueGamesTheorem.Reduction.ActualGame.names, OAI.UniqueGamesTheorem.Reduction.AddressOutcomeSpecs.row, OAI.UniqueGamesTheorem.Reduction.AddressOutcomeSpecs.rhsBits, OAI.UniqueGamesTheorem.Reduction.AddressGame.addressEdge, OAI.UniqueGamesTheorem.Reduction.FixedOutcomes.assemble
- def
OAI.UniqueGamesTheorem.Reduction.AddressOutcomeSpecs.tupleBitsline 153 - theorem
OAI.UniqueGamesTheorem.Reduction.AddressOutcomeSpecs.tuplePayload_actualline 159 - theorem
OAI.UniqueGamesTheorem.Reduction.AddressOutcomeSpecs.encodeWords_flatMapline 170 - theorem
OAI.UniqueGamesTheorem.Reduction.AddressOutcomeSpecs.gameBits_factorline 178Source documentation
Complete output-byte factorization used by the actual outer loop.
theorem gameBits_factor (S : Source) (k : Nat) {s d : Nat} (T : NoiseTables.Table s d) : gameBits (AddressGame.tableOutput S k T) = encodeWords [(AddressGame.tableOutput S k T).vertices, 2^s, (AddressGame.tableOutput S k T).constraints.length] ++ (FixedOutcomes.occurrenceTuples S.occurrences k).flatMap (tupleBits S k T) := by …Mentions: OAI.UniqueGamesTheorem.Reduction.AddressGame.tableOutput, OAI.UniqueGamesTheorem.Reduction.FixedOutcomes.occurrenceTuples, OAI.UniqueGamesTheorem.Reduction.AddressOutcomeSpecs.tupleBits