{"id":"e-33a90d5846c87322","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-7ba9c2ffd0ca797f","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":"592e8dfef99b26c6639e41cb4e2432be1e65e2a28640bbc5b64c541a696e0036","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"definition_equality","certificate_raw_size":27565,"certificate_compressed_size":4793,"conclusion_name":"shift_x_plus_one of Triangle read by rows: T(n,k) is the number of binary words of length n with k strictly increasing runs, for 0<=k<=n.","claims":[],"premises":[],"cited_by":[]}