No fixed vectors and no first cohomology on , with multiplicities and central images
DefinitionGroupIsoPoly_Supplement_QuotCohVanishesgroup-cohomologygroup-isomorphismgroup-theorymatrix-groupsp2o-gran-per-chapterp2o-plan-bookp2o-v1
For acting on over a field , with pairing submodule , the property asserts, for every multiplicity (the module ):
- ;
- every 1-cocycle , , is a coboundary ; and for every generating set of , is the unique solution of the linear equations , ;
- for every surjective homomorphism with such that acts trivially on (a central-product image acting on ), every 1-cocycle is a coboundary.
This packages the conclusions of Theorem 6.3 so that they can be asserted over the defining field and after prime-field descent.
Formalization Note Elements of are written by representatives in and all identities are congruences modulo ; a map to the quotient always lifts. The fixed vectors of on coincide with those of because is onto.
Definition code
import Mathlib
import Definitions.Def_GroupIsoPoly_Supplement_pairingSubmodule
set_option autoImplicit false
namespace GroupIsoPoly
namespace Supplement
/-- **No fixed vectors and no first cohomology on `T/J(T)`, with multiplicities, generator equations
and central-product images.**
Qiao, Zhang, *Testing isomorphism of finite groups in time polynomial in the group order*, preprint,
Nov. 3, 2026 (held version sha256 eb9a3355…), Theorem 6.3, p.49 (PDF p.53): "(T/J(T))^D = 0,
H1(D, T/J(T)) = 0. The assertions hold after prime-field descent, with fixed multiplicities, and for
a central-product image given with its quotient map. Consequently a cocycle c : D → T/J(T) specified
by its values on the generators has a unique b ∈ T/J(T) with c(g) = (g − 1)b, computable by solving
these linear equations on generators."
Write `T = F^{ι₁} ⊗ F^{ι₂} ⊗ F^{ι₃}` with `D` acting by `g·t = tensorAct ρ₁ ρ₂ ρ₃ g t` and
`J = J(T)`. For every multiplicity `m` (the module `(T/J(T)) ⊗_F F^m`, i.e. `m` copies, a vector being
a family `x : Fin m → T` read modulo `J` in each coordinate) the predicate asserts:
1. **no fixed vectors**: if `g·x_l − x_l ∈ J` for all `g`, `l`, then every `x_l ∈ J`;
2. **`H¹ = 0` and the generator equations**: for every 1-cocycle `c : D → (T/J)^m`, i.e.
`c(gh) ≡ c(g) + g·c(h) (mod J)`, there is `b` with `c(g) ≡ g·b − b (mod J)` for all `g`; and for every
generating set `S` of `D`, every `b'` with `c(s) ≡ s·b' − b' (mod J)` for all `s ∈ S` equals `b`
modulo `J` (so `b` is unique and is the unique solution of the linear equations on generators);
3. **central-product images**: for every surjective homomorphism `φ : D → D̄` with `ker φ ≤ Z(D)`
through which the action on `T/J` factors (every `g ∈ ker φ` acts trivially on `T/J`), every
1-cocycle of `D̄` on `(T/J)^m` is a coboundary. (`D̄` acts on `T/J` by `φ(g)·[t] = [g·t]`.)
**Formalization Note.** Elements of `T/J` are written by representatives in `T`; a function to the
quotient always lifts, so cocycles and coboundaries are stated as congruences modulo `J`. The fixed
vectors of `D̄` on `T/J` are those of `D` (`φ` is onto), so clause 1 also covers `D̄`. -/
def QuotCohVanishes {F : Type} [Field F] {D : Type} [Group D]
{ι₁ ι₂ ι₃ : Type} [Fintype ι₁] [Fintype ι₂] [Fintype ι₃]
(ρ₁ : D → Matrix ι₁ ι₁ F) (ρ₂ : D → Matrix ι₂ ι₂ F) (ρ₃ : D → Matrix ι₃ ι₃ F) : Prop :=
∀ m : ℕ,
(∀ x : Fin m → ι₁ × ι₂ × ι₃ → F,
(∀ g l, tensorAct ρ₁ ρ₂ ρ₃ g (x l) - x l ∈ pairingSubmodule ρ₁ ρ₂ ρ₃) →
∀ l, x l ∈ pairingSubmodule ρ₁ ρ₂ ρ₃) ∧
(∀ c : D → Fin m → ι₁ × ι₂ × ι₃ → F,
(∀ g h l, c (g * h) l - c g l - tensorAct ρ₁ ρ₂ ρ₃ g (c h l) ∈ pairingSubmodule ρ₁ ρ₂ ρ₃) →
∃ b : Fin m → ι₁ × ι₂ × ι₃ → F,
(∀ g l, c g l - (tensorAct ρ₁ ρ₂ ρ₃ g (b l) - b l) ∈ pairingSubmodule ρ₁ ρ₂ ρ₃) ∧
∀ S : Set D, Subgroup.closure S = ⊤ →
∀ b' : Fin m → ι₁ × ι₂ × ι₃ → F,
(∀ s ∈ S, ∀ l, c s l - (tensorAct ρ₁ ρ₂ ρ₃ s (b' l) - b' l) ∈
pairingSubmodule ρ₁ ρ₂ ρ₃) →
∀ l, b' l - b l ∈ pairingSubmodule ρ₁ ρ₂ ρ₃) ∧
(∀ (Dbar : Type) [Group Dbar] (φ : D →* Dbar), Function.Surjective φ →
φ.ker ≤ Subgroup.center D →
(∀ g ∈ φ.ker, ∀ t, tensorAct ρ₁ ρ₂ ρ₃ g t - t ∈ pairingSubmodule ρ₁ ρ₂ ρ₃) →
∀ c : Dbar → Fin m → ι₁ × ι₂ × ι₃ → F,
(∀ g h l, c (φ g * φ h) l - c (φ g) l - tensorAct ρ₁ ρ₂ ρ₃ g (c (φ h) l) ∈
pairingSubmodule ρ₁ ρ₂ ρ₃) →
∃ b : Fin m → ι₁ × ι₂ × ι₃ → F,
∀ g l, c (φ g) l - (tensorAct ρ₁ ρ₂ ρ₃ g (b l) - b l) ∈ pairingSubmodule ρ₁ ρ₂ ρ₃)
end Supplement
end GroupIsoPoly
Source
Qiao, Zhang, Testing isomorphism of finite groups in time polynomial in the group order, preprint, Nov. 3, 2026 (held version sha256 eb9a3355…), Theorem 6.3, p.49 (PDF p.53)