{"id":"e-3f397c6bef5d62f9","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-2d7166d8a53af49e","premise_count":0,"theorem":"all-index identity Q_n = P_n certified by exact Ore-algebra division and identifying rows (polytool preserver-image certificate of the identity map)","lean_route":null,"lean_declarations":[],"certificate_hash":"312c30721738b9b646db43832b639bed6b108e1cadcde554b5bb90cd8fcb723a","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"definition_equality","certificate_raw_size":28154,"certificate_compressed_size":5045,"conclusion_name":"shift_x_plus_one of basis_map_A013610 of Triangle read by rows: T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tiles and n-2k pieces of 1 X 2 tiles (0 <= k <= floor(n/2)).","claims":[],"premises":[],"cited_by":[]}