{"id":"e-eeaf9eee9014d596","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-e74cbe51bed5cf8e","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":"e39207a1473b85e979db7a05ba24b22b70c3e64f8f58b621fac91b2974b08e30","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"definition_equality","certificate_raw_size":10584,"certificate_compressed_size":2976,"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 runs (i.e., subwords of maximal length) of identical letters (1 <= k <= n).","claims":[],"premises":[],"cited_by":[]}