Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

MazurTransfer.original_mu19_bialgebra_point_label_normalization

Proved

by Vas · Oct 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraic-geometrymazur-theoremnumber-theory

Normalize the given original cyclic bialgebra equivalence by an automorphism over the same coefficient ring so that its literal field-point root equals the given original arithmetic root label, pointwise. The complete original proposition and helper type, original arithmetic multiplicative label type and whole value, and every original cyclic-point and character context are independently checked. Every original ring, bialgebra, field, characteristic-zero, algebraic-closure, coefficient algebra, given equivalence and label hypothesis is retained. Named downstream consumer: exact same selected-pi quotient restriction identity in the literal mu19 model before norm torsor pushforward.

Preamble
import Definitions.Def_MazurTransfer_OriginalMu19BialgebraPointLabelNormalizationData20261020
import Definitions.Def_MazurTransfer_OriginalBialgebraCyclicMu19PointsData20261020
import Definitions.Def_MazurTransfer_OriginalCyclicCharacterConjugationData20261020
import Theorems.Thm_MazurTransfer_original_cyclic_character_conjugation
noncomputable section
open MazurTransfer.CyclicNineteenGroupAlgebraPoints MazurTransfer.BialgebraCyclicMu19Points MazurTransfer.NineteenRootsGaloisRepresentation MazurTransfer.CyclicCharacterConjugation MazurTransfer.Mu19BialgebraPointLabelNormalization
Formal statement
theorem MazurTransfer.original_mu19_bialgebra_point_label_normalization : ∀ {R H K : Type} [CommRing R] [CommRing H] [Bialgebra R H] [Field K] [CharZero K] [IsAlgClosed K] [Algebra R K] (φ : H ≃ₐc[R] MonoidAlgebra R Cyclic) (e : WithConv (H →ₐ[R] K) ≃ Additive (Roots K)) (he_add : ∀ f g, e (f * g) = e f + e g),
∃ ψ : H ≃ₐc[R] MonoidAlgebra R Cyclic,
      ∀ f : WithConv (H →ₐ[R] K), literalPointEquiv ψ K f = (e f).toMul := by sorry

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me