ModuleFiniteGaloisPrimeDegreeReduction.lean
Nyll.Yamaguchi26AbfaithfulGalois.Kummer.FiniteGaloisPrimeDegreeReduction
3 declarations indexed from sourceView source ↗ Module documentation
Reducing finite Galois faithfulness to prime degree
Prime-degree detection yields faithful mod-prime abelianization actions for finite Galois extensions by passing to fixed fields of prime-order subgroups in a hypothetical kernel.
Declarations
Yamaguchi26AbfaithfulGalois.relativeModPowerAction
Source context 4 commands
Surrounding namespaces, section variables, and local commands at this declaration.
namespace Yamaguchi26AbfaithfulGalois
open KummerTheory ProCGroups.Abelian ProCGroups.FiniteStepSolvableQuotients
open ValuationTheory.DiscreteValuationField
universe u v
Yamaguchi26AbfaithfulGalois.relativeModPowerAction_apply
Source context 4 commands
Surrounding namespaces, section variables, and local commands at this declaration.
namespace Yamaguchi26AbfaithfulGalois
open KummerTheory ProCGroups.Abelian ProCGroups.FiniteStepSolvableQuotients
open ValuationTheory.DiscreteValuationField
universe u v
Yamaguchi26AbfaithfulGalois.relativeGaloisAbelianModPowerTransform_faithful_of_primeDegree_detection
DocumentationPrime-degree detection makes the actual mod-p action faithful for every finite Galois extension. A prime-order subgroup of the kernel would give a prime-degree extension over its fixed field, contradicting detection there.
Source context 4 commands
Surrounding namespaces, section variables, and local commands at this declaration.
namespace Yamaguchi26AbfaithfulGalois
open KummerTheory ProCGroups.Abelian ProCGroups.FiniteStepSolvableQuotients
open ValuationTheory.DiscreteValuationField
universe u v