{"id":"e-efb682efd7da7c4c","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-07e5356ad37f61ea","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":"c5c88649a23b6255c64854c404bba041a5f1abae1592d8af240a351a78609eef","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"definition_equality","certificate_raw_size":16963,"certificate_compressed_size":3772,"conclusion_name":"Triangle read by rows: T(n,k) is the number of k-matchings of the corona K'(n) of the complete graph K(n) and the complete graph K(1); in other words, K'(n) is the graph constructed from K(n) by adding for each vertex v a new vertex v' and the edge vv'.","claims":[],"premises":[],"cited_by":[]}