{"id":"e-e434336350f0ed59","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-d56689d39d4a3bd8","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":"351494ef242a73a203ff78dd5b777db2eeb2baa867e532422bf37989b4ee1c46","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"definition_equality","certificate_raw_size":28075,"certificate_compressed_size":4998,"conclusion_name":"shift_x_plus_one of Triangle read by rows: T(n,k) is the number of words over alphabet {0,1,2,3} having exactly k occurrences of the string 01, where n>=0 and k>=0.","claims":[],"premises":[],"cited_by":[]}