Draft — mutable and not usable as a dependency; its citation marks the draft state.

Proof of `Rational functions decompose into prime rational functions`

groundedproofs/Lax132576Proofs/Results.lean · lax-132576

What this proof establishes

no assumptions

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

A rational function decomposes into prime rational functions (Theorem B.2.6, ⇒): the bimachine is run as a separator, two Mealy machines (one right to left) and a homomorphism (Transducers.compClosureofisBimachineTransducers.compClosure_of_isBimachine).

Attribution

Theorem B.2.6 of Transducers; Lean proof by Aristotle (PartB/BimachPrime.leanPartB/BimachPrime.lean).