Proof of `Standard words into high-multiplicity words` (6th statement)

groundedproofs/Lax434175Proofs/HighMultiplicityTransfer.lean · lax-434175

What this proof establishes

thm✓Lax434175.HighMultiplicity
thm✓Lax434175.Propagation
thm✓Lax496464.WH_A4_MachineFacts
thm✓Lax496464.WH_A5_Bridges
thm✓Lax759944.TuringRamPolytimeEquivalence

thm✓Lax434175.HighMultiplicity (6th statement)

Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.

Read the Lean proof on GitHub

Description

Compose the reduction with the word map, a polynomial-time reduction on the word RAM.