Section 3, unnumbered (10)-(13): inverse, recurrence and shifted bases
ProvedQAlgorithms.Papers.Independent.Intake100.P58.companion_inverse_recurrence_basesLet and let be a commutative unital ring. Choose units , coefficients , and . Put and assume . Let be the unital associative algebra on invertible and an element , with relations (1)–(6) of Definition 2.1. In particular, , , , , , and for .
Assume multiplication by on is injective (Assumption 2.2). Neither nor need be units, and the cyclotomic polynomial need not split.
Let with its standard basis . The operators are the specific maps (8)–(17): for , , , when , for , and . Define and for every integer , using the explicit inverse (10)–(11).
The displayed companion map is invertible, and its inverse is
Both compositions with equal the identity. The integer orbit agrees with the given standard vectors for , and for every integer ,
For every integer , the family
is a basis of . Empty sums have value zero. These conclusions justify all negative-index and shifted tensor coordinates used later.
import Definitions.Def_QAlgorithms_Papers_Independent_Intake100_P58
noncomputable section
open scoped BigOperators Classical
namespace QAlgorithms.Papers.Independent.Intake100.P58
open Accepted
variable {R : Type*} [CommRing R] {k : ℕ}
/-- Section 3, equations (10)--(13), PDF p.5. This includes both inverse
identities, the inverse columns, the orbit convention, the signed recurrence,
and the specified shifted bases, without admissibility. -/
theorem companion_inverse_recurrence_bases (P : NonsplitParameters R k) (hdelta : RegularDelta P) :
Yv P * YvInv P = 1 ∧ YvInv P * Yv P = 1 ∧
(∀ i : Fin k, 1 ≤ i.val → YvInv P (vNat P i.val) = vNat P (i.val-1)) ∧
YvInv P (vNat P 0) =
-(↑P.constant⁻¹ : R) • (∑ i : Fin k, qAt P (i.val+1) • vNat P i.val) ∧
(∀ i : Fin k, orbitVector P (i.val : ℤ) = vNat P i.val) ∧
(∀ i : ℤ, (∑ l ∈ Finset.range (k+1), qAt P l • (Yv P ^ l) (orbitVector P i)) = 0) ∧
(∀ l : ℤ, ∃ b : Module.Basis (Fin k) R (CompanionModule P),
∀ i : Fin k, b i = orbitVector P (l + (i.val : ℤ))) := by sorry
end QAlgorithms.Papers.Independent.Intake100.P58
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be any commutative ring, possibly the zero ring, and let . Take units , coefficients , and loop values , satisfying and , where , and assume that multiplication by on is injective. Define for , , and for . Let , with standard basis , and set for natural . Define -linear maps by
For , define when , and when , using nonnegative operator powers in both cases. The declaration asserts all of the following simultaneously:
Here is the identity map of ; when , the assertions indexed by have no instances.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.