{"id":"e-6bf151a19679edda","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-97b51734d39ede6c","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":"8d62e08c9b1b64357b79f4e624b82a301c29f92870ddbadd8c33d85085aa3945","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"definition_equality","certificate_raw_size":6561,"certificate_compressed_size":1927,"conclusion_name":"Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n).","claims":[],"premises":[],"cited_by":[]}
