{"id":"e-8f2f1dc6ded97c3f","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-07af2e6e3c9f0c77","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":"b089aca3fd081d8b91c083abfd4e9a2bfa25e698dd5b36fb4b309c4526136e60","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"definition_equality","certificate_raw_size":20540,"certificate_compressed_size":4062,"conclusion_name":"basis_map_A007318 of Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.","claims":[],"premises":[],"cited_by":[]}