{"id":"e-5a6bf8de26e7e63f","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-4f0bee64a4148379","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":"bbdddfac345b81b46e7957e29e526f3bcb082fe15474bcfce60edf613ebd28c0","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"definition_equality","certificate_raw_size":27713,"certificate_compressed_size":4970,"conclusion_name":"shift_x_plus_one of basis_map_A013611 of Triangle read by rows: T(n,k) is the number of binary words of length n having degree of asymmetry equal to k (n >= 0; 0 <= k <= n/2).","claims":[],"premises":[],"cited_by":[]}