The isometric regular embedding #
The C-equivariant split embedding of a ramified simple faithful quadratic 𝔽₂[C]-module
(V, q) into a regular module W = PermW C N = 𝔽₂[C]^N, carrying the pulled-back form
Q_W := q ∘ r (r the equivariant retraction) together with an equivariant factor-set datum
for it. This upgrades RegularSummand.lemma_6_11 (a pure module embedding) to an isometry
Q_W ∘ ι = q, and supplies an equivariant FactorSet on W — the datum-side input of the §6.2
orbit route to SectionSix.lemma_6_17_vanish.
What regular_isometric_embedding delivers #
From lemma_6_11 we obtain N, the equivariant embedding ι : V →+ W, the equivariant
retraction r : W →+ V, and r ∘ ι = id. Setting Q_W := q ∘ r:
- the isometry
Q_W (ι v) = q vis immediate fromr (ι v) = v; Q_WisC-invariant and𝔽₂-quadratic (radditive + equivariant,qinvariant/quadratic);exists_datum_of_invariant_quadratic(the permutation-module normal form) supplies an equivariant factor-set datumdatWforQ_W.
The two equivariances are re-expressed in the PermW DistribMulAction form
ι (h • v) = h • ι v and r (h • F) = h • r F — the shape RepIndependence.lemma_6_14 consumes.
This mirrors the ramified branch of KappaNormalForm.kappa0_exists_tame, but exposes ι, r,
datW and the isometry instead of immediately collapsing them to ∃ dat, IsEquivariantFactorSet q dat on V. The exposed package is what the §6.3 orbit computation (Lemmas 6.14–6.17) transports
through.
Relation to the full f2b interface / the remaining core #
The full f2b result additionally asks for datW = sumDatum (orbit datums) — the §6.2
orbit decomposition of Q_W into square/free/involution orbit polynomials ((75)/(76)/Lemma
6.2), whose per-orbit equivariance is banked (isEquivariantFactorSet_{square,free,inv}OrbitDatum
in SectionNine/InvolutionDatum). The banked normal form exists_datum_of_invariant_quadratic
deliberately takes the single invariant-biadditive β-refinement route
(docs/orchestration/p17e-kappa0-scoping.md), so it produces datW but not its orbit-sum form; recovering
the latter is the combinatorial core of the orbit route. This file supplies the
datum-independent isometric-embedding infrastructure that either route (the orbit route or the
flagged β-route) consumes.
No axioms; Ax = ∅ (std-3 throughout, inheriting only the axioms of lemma_6_11).
The isometric regular embedding (the Lemma 6.17 vanishing proof, P1 + the β-datum): a ramified simple faithful
2-torsion quadratic 𝔽₂[C]-module (V, q) embeds C-equivariantly as a split summand of a
regular module W = 𝔽₂[C]^N, carrying the pulled-back form Q_W := q ∘ r and an equivariant
factor-set datum for it, so that ι is an isometry Q_W (ι v) = q v.
Everything is extracted from lemma_6_11's module split (equivariance, retraction) plus the
permutation-module normal form exists_datum_of_invariant_quadratic; the isometry is free from
r (ι v) = v.
The orbit-sum isometric embedding #
Reindex the foundation's regular summand 𝔽₂[C] to RegRep N along e : C ≃* G ⧸ N, then
apply the §6.2 orbit decomposition (OrbitDecomp.isEquivariantFactorSet_orbitSumDatum) to the
pulled-back form. The C ≅ AbsGalQ2 ⧸ ker ρ instantiation of e stays with f2c/f2d.
Reindex a single regular summand 𝔽₂[C] to RegRep N along e : C ≃* G ⧸ N.
Equations
- GQ2.reSummand N e = { toFun := fun (f : C → ZMod 2) (h : G ⧸ N) => f (e.symm h), invFun := fun (g : GQ2.RegRep N) (c : C) => g (e c), left_inv := ⋯, right_inv := ⋯, map_add' := ⋯ }
Instances For
The blockwise reindex 𝔽₂[C]^K ≃+ (Fin K → RegRep N).
Equations
- GQ2.reBlock N e K = AddEquiv.piCongrRight fun (x : Fin K) => GQ2.reSummand N e
Instances For
The orbit-sum isometric embedding (the Lemma 6.17 vanishing proof): a ramified simple faithful quadratic
𝔽₂[C]-module (V, q) embeds C-equivariantly (through e : C ≃* G ⧸ N) as a split summand of
Fin K → RegRep N, carrying the pulled-back form Q_W := q ∘ r together with the §6.2
orbit-sum datum sumDatum (orbitIndexSet Q_W) orbitDatum for it, an isometry. This is the full
the Lemma 6.17 vanishing proof interface with datW definitionally the orbit sum — the shape
OrbitVanish.Q0loc_vanish_of_datum_decomp consumes.