Transport of Stafford certificates #
The right-ideal certificate is 1 = e * R + F * e * S.
This module supplies the generic conditional reduction from monicization and
an exponent hypothesis, together with transport through algebra automorphisms
and nonzero scalars. These conditional interfaces are retained for current
imports; the unconditional theorem is proved in Stafford38.FoundationClosure.
e is Weyl-monic if some Weyl pair presents it monically with all
coefficients commuting with the partner.
Equations
- Stafford.Reduction.WeylMonic e = ∃ (X : A) (Y : A) (N : ℕ) (β : Fin N → A), Stafford.Reduction.ad Y X = 1 ∧ (∀ (i : Fin N), Commute Y (β i)) ∧ e = Stafford.Reduction.monicElt X N β
Instances For
Transport lemmas #
Stafford 3.8 transports along any ring automorphism.
Stafford 3.8 transports along scalar multiples (no nonvanishing needed: the
scalar is absorbed into the cofactors R and S).
The two hypotheses #
Hypothesis M (monicization). Every nonzero element is, after an algebra automorphism and a nonzero scalar, Weyl-monic.
Equations
- Stafford.Reduction.Monicization k A = ∀ (e : A), e ≠ 0 → ∃ (φ : A ≃ₐ[k] A) (c : k), c ≠ 0 ∧ Stafford.Reduction.WeylMonic (c • φ e)
Instances For
Hypothesis E (exponent). For every Weyl-monic presentation some power of the Weyl partner is a Stafford cofactor.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The reduction #
Hypothesis E gives Stafford 3.8 for every Weyl-monic element.
Stafford 3.8 from the two named hypotheses.
If every nonzero element monicizes (Hypothesis M) and every Weyl-monic element admits a cofactor that is a power of the Weyl partner (Hypothesis E), then
∀ e ≠ 0, ∃ F R S, 1 = e * R + F * e * S.