OAI/Computability/UniqueGames/Machines/MachineExpanderTableRows.lean
16 declarations, 0 contain sorry, 0 declared as axioms
Actual execution of all expander-table positions for one vertex
The inner loop calls the complete row machine once per fixed cloud/port position. The returned state and the successful machine execution are constructed together. Neither a row execution nor an inner-loop execution is a caller premise.
- def
OAI.UniqueGamesTheorem.Foundations.Complexity.MachineExpanderTable.singleStepline 21 - def
OAI.UniqueGamesTheorem.Foundations.Complexity.MachineExpanderTable.sequenceline 27 - def
OAI.UniqueGamesTheorem.Foundations.Complexity.MachineExpanderTable.widenline 34 - def
OAI.UniqueGamesTheorem.Foundations.Complexity.MachineExpanderTable.tableRowDataline 40 - theorem
OAI.UniqueGamesTheorem.Foundations.Complexity.MachineExpanderTable.tableRowData_finalValueline 44 - theorem
OAI.UniqueGamesTheorem.Foundations.Complexity.MachineExpanderTable.tableRowData_frame0line 48 - theorem
OAI.UniqueGamesTheorem.Foundations.Complexity.MachineExpanderTable.tableRowData_finalFrameline 55 - def
OAI.UniqueGamesTheorem.Foundations.Complexity.MachineExpanderTable.rowAfterStateline 68 - theorem
OAI.UniqueGamesTheorem.Foundations.Complexity.MachineExpanderTable.rowAfterState_positionline 74 - theorem
OAI.UniqueGamesTheorem.Foundations.Complexity.MachineExpanderTable.caller_rowAfterStateline 79 - def
OAI.UniqueGamesTheorem.Foundations.Complexity.MachineExpanderTable.preparedRowInTimeline 85Source documentation
Preparation and one actual embedded row call, with the two extra tapes retained. The row value is computed from the actual old and small tables.
def preparedRowInTime (positive : 0 < d) (G : Table v (degree d)) (H : Table (cloudSize d) d) (vertex : Fin v) (state : State ρ d) (remaining : Nat) (output countSuffix result : List Bool) : StateTransition.EvalsToInTime (TM2.step (program positive H)) ⟨some (.inr .prepareRow), state, boundaryTapes vertex.val remaining (encodeWords (rotationWords G)) output countSuffix result⟩ (some ⟨some (.inr .afterRow), rowAfterState positive G H vertex state, boundaryTapes vertex.val remaining (encodeWords (rotationWords G)) ((encodeWord (rowValue G H vertex state.2)).reverse ++ output) countSuffix result⟩) (1 + 80 * ((encodeWords (rotationWords G)).length + 1)) := by …Mentions: OAI.UniqueGamesTheorem.Foundations.Complexity.MachineExpanderTable.State, OAI.UniqueGamesTheorem.Foundations.Complexity.MachineExpanderTable.program, OAI.UniqueGamesTheorem.Foundations.Complexity.MachineExpanderTable.boundaryTapes, OAI.UniqueGamesTheorem.Foundations.Complexity.encodeWords, OAI.UniqueGamesTheorem.Foundations.Complexity.MachineExpanderTable.rowAfterState, OAI.UniqueGamesTheorem.Foundations.Complexity.encodeWord
- structure
OAI.UniqueGamesTheorem.Foundations.Complexity.MachineExpanderTable.VertexSuffixRunline 116Source documentation
A successful suffix of the finite position loop, returning actual finite state together with the execution certificate and its preserved caller.
structure VertexSuffixRun (positive : 0 < d) (G : Table v (degree d)) (H : Table (cloudSize d) d) (vertex : Fin v) (state : State ρ d) (remaining : Nat) (output countSuffix result : List Bool) where …Mentions: OAI.UniqueGamesTheorem.Foundations.Complexity.MachineExpanderTable.State
- def
OAI.UniqueGamesTheorem.Foundations.Complexity.MachineExpanderTable.suffixRun_auxline 130 - def
OAI.UniqueGamesTheorem.Foundations.Complexity.MachineExpanderTable.suffixInTimeline 184 - structure
OAI.UniqueGamesTheorem.Foundations.Complexity.MachineExpanderTable.VertexRunline 192Source documentation
The complete inner loop for one vertex, starting at position zero.
structure VertexRun (positive : 0 < d) (G : Table v (degree d)) (H : Table (cloudSize d) d) (vertex : Fin v) (state : State ρ d) (remaining : Nat) (output countSuffix result : List Bool) where …Mentions: OAI.UniqueGamesTheorem.Foundations.Complexity.MachineExpanderTable.State
- def
OAI.UniqueGamesTheorem.Foundations.Complexity.MachineExpanderTable.vertexInTimeline 206