{"id":"e-0c59df4465220d31","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-6bbd968fe5cbbe11","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":"83cb635452a248b5dee6a543c4e5bdc90c502d8ea1236db88cd19ec50cf309d0","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"definition_equality","certificate_raw_size":11637,"certificate_compressed_size":2955,"conclusion_name":"basis_map_A007318 of 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":[]}