{"id":"e-426fd541940deab2","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-9d2e609ab19d361f","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":"c3dcc79a5c7a5f1133d16eac262f596eeb6864d7a65ca91a28431f7aa2d37f09","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"definition_equality","certificate_raw_size":21440,"certificate_compressed_size":4274,"conclusion_name":"Triangle read by rows: T(n,k) is the number of k-matchings in the n-sunlet graph (0 <= k <= n).","claims":[],"premises":[],"cited_by":[]}
