{"id":"e-836f377f58171f68","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-2ca20f5a0bd85ef7","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":"52c5ca855c7a173e25ee843b4771325d4af5d73ed32c7ba75c9082827e8c0cc9","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"definition_equality","certificate_raw_size":10253,"certificate_compressed_size":2858,"conclusion_name":"shift_x_plus_one of veronese_section_2_0 of Triangle read by rows: T(n,k) is the number of ternary words of length n having k levels (n >= 1, 0 <= k <= n-1). A level is a pair of identical consecutive letters.","claims":[],"premises":[],"cited_by":[]}