{"id":"e-1fce019b08957dec","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-9aab3599d0de19d3","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":"8e7ed4bcb54da0a642a9c5c4bf5fed588957d7b597cb58240f0bbdbaa0ba92be","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"definition_equality","certificate_raw_size":10493,"certificate_compressed_size":2925,"conclusion_name":"shift_x_plus_one of veronese_section_2_1 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":[]}