{"id":"e-706a96c1242f8bb9","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-d321ff0d3bb39024","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":"00fe99fd95d38dfca83405203eb80715042ac3738bbef305426d30e50b944d36","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"definition_equality","certificate_raw_size":26520,"certificate_compressed_size":4564,"conclusion_name":"shift_x_plus_one 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":[]}