OAI/Computability/UniqueGames/PCP/RawInitialTablesLemmas.lean
89 declarations, 0 contain sorry, 0 declared as axioms
Explicit structural numberings of the raw 3SAT incidence graph. Unused declared variable names are retained; their unary input header pays for them. The graph has one dummy vertex and one tautological loop, even for an empty formula. No input-dependent choice of a finite enumeration is made.
- def
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialTables.unitOrderline 27 - def
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialTables.slotOrderline 33 - def
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialTables.binaryOrderline 42 - def
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialTables.labelOrderline 51 - def
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialTables.vertexOrderline 53 - def
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialTables.eventOrderline 57 - def
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialTables.dartOrderline 60 - def
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialTables.raw64line 64 - def
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialTables.tableline 68 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialTables.table_verticesline 71 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialTables.table_dartsline 74 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialTables.table_vertices_positiveline 76 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialTables.table_darts_positiveline 79 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialTables.raw64_satisfiable_iffline 82 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialTables.table_semanticsline 87 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialTables.table_satisfiable_iffline 95 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialTables.initial_rejectionline 101 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialTables.initial_sizeline 107 - def
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialMachineBudget.nameSumline 121 - def
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialMachineBudget.bodyTimeline 124 - def
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialMachineBudget.loopTimeline 128 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialMachineBudget.nameSum_leline 132 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialMachineBudget.bodyTime_leline 139 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialMachineBudget.loopTime_leline 146 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialMachineBudget.input_header_boundline 168 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialMachineBudget.graph_size_boundline 174 - def
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialMachineBudget.fullBudgetline 181 - def
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialMachineBudget.timePolynomialline 185 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialMachineBudget.timePolynomial_evalline 189 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialMachineBudget.fullBudget_leline 193 - abbrev
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialRows.Signsline 218 - abbrev
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialRows.Namesline 219 - def
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialRows.clauseSignsline 221 - def
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialRows.clauseNamesline 224 - def
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialRows.nameWordline 227 - def
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialRows.decodedLabelline 232 - def
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialRows.incidencePredicateline 235 - def
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialRows.relationPredicateline 243 - def
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialRows.relationWordsForline 248 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialRows.relationWordsFor_lengthline 251 - def
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialRows.incidenceWordsline 255 - def
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialRows.clauseWordsline 261 - def
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialRows.dummyWordsline 269 - def
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialRows.orderedListline 276Source documentation
The list induced by an explicit numbering, in increasing numeric order.
def orderedList {α : Type*} {n : Nat} (e : α ≃ Fin n) : List α := … - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialRows.orderedList_castline 279 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialRows.orderedList_prodline 284 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialRows.orderedList_sumline 308 - def
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialRows.clauseDartsline 322 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialRows.orderedList_dartOrderline 327 - def
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialRows.rowForline 340 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialRows.rowList_tableline 346 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialRows.rowWords_incidenceline 352 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialRows.rowWords_dummyline 372 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialRows.clauseDarts_rowWordsline 385 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialRows.tableWords_eqline 392Source documentation
Exact headers and exact clause/slot/orientation order of every emitted word.
theorem tableWords_eq (F : Formula) : tableWords (table F) = [F.variables + F.clauses.length + 1, 6 * F.clauses.length + 1] ++ (List.finRange F.clauses.length).flatMap (fun i => clauseWords F.variables i.val (clauseNames (clauseAt F i)) (clauseSigns (clauseAt F i))) ++ dummyWords F.variables F.clauses.length := by …Mentions: OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialRows.clauseWords, OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialRows.clauseNames, OAI.UniqueGamesTheorem.Foundations.PCP.clauseAt, OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialRows.clauseSigns, OAI.UniqueGamesTheorem.Foundations.PCP.RawInitialRows.dummyWords
- abbrev
OAI.UniqueGamesTheorem.Foundations.PCP.RoundTables.BaseTableline 410 - opaque
OAI.UniqueGamesTheorem.Foundations.PCP.RoundTables.fixedWalkParameterline 414Source documentation
Initialized fixed data keep enormous constant powers symbolic in the kernel. The stored equality proves the exact requested parameter; no value is assumed.
opaque fixedWalkParameter : {n : Nat // n = 2 * FinalConstants.endpointLength} := …Mentions: OAI.UniqueGamesTheorem.Foundations.PCP.FinalConstants.endpointLength
- def
OAI.UniqueGamesTheorem.Foundations.PCP.RoundTables.walkParameterline 417 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RoundTables.walkParameter_eqline 419 - def
OAI.UniqueGamesTheorem.Foundations.PCP.RoundTables.alphabetline 422 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RoundTables.alphabet_positiveline 424 - def
OAI.UniqueGamesTheorem.Foundations.PCP.RoundTables.poweredline 428 - def
OAI.UniqueGamesTheorem.Foundations.PCP.RoundTables.buildline 431 - def
OAI.UniqueGamesTheorem.Foundations.PCP.RoundTables.sizeFactorline 434 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RoundTables.degree_positiveline 437 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RoundTables.dartFactor_positiveline 441 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RoundTables.sizeFactor_positiveline 445 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RoundTables.powered_verticesline 452 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RoundTables.powered_dartsline 455 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RoundTables.build_darts_positiveline 459 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RoundTables.build_size_leline 467 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RoundTables.build_completenessline 494 - abbrev
OAI.UniqueGamesTheorem.Foundations.PCP.RoundTables.Inputline 503 - instance
OAI.UniqueGamesTheorem.Foundations.PCP.RoundTables.(instance at line 505)line 505 - def
OAI.UniqueGamesTheorem.Foundations.PCP.RoundTables.stepline 507 - def
OAI.UniqueGamesTheorem.Foundations.PCP.RoundTables.initialline 510 - def
OAI.UniqueGamesTheorem.Foundations.PCP.RoundTables.sizeline 513 - def
OAI.UniqueGamesTheorem.Foundations.PCP.RoundTables.Satisfiableline 515 - def
OAI.UniqueGamesTheorem.Foundations.PCP.RoundTables.gapline 517 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RoundTables.size_positiveline 519 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RoundTables.gap_nonnegativeline 522 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RoundTables.gap_eq_zero_iffline 525 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RoundTables.one_le_size_mul_gapline 528 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RoundTables.initial_satisfiable_iffline 540 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RoundTables.step_completenessline 543 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RoundTables.step_sizeline 546 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RoundTableGap.powered_count_gapline 564 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RoundTableGap.build_count_gapline 595 - theorem
OAI.UniqueGamesTheorem.Foundations.PCP.RoundTableGap.step_gapline 610