{"id":"e-c6c2f44d9f7e209a","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-14e1070ac70ddf5c","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":"60981dba99c7179a7057aa50044459129e6ddd2a1415ae86081dc6e8eb5c74e6","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"definition_equality","certificate_raw_size":27742,"certificate_compressed_size":4964,"conclusion_name":"shift_x_plus_one of basis_map_A007318 of Triangle read by rows: T(n,k) is the number of ternary words of length n having degree of asymmetry equal to k (n>=0; 0<=k<=n/2).","claims":[],"premises":[],"cited_by":[]}