Documentation

GQ2.SectionEight.ScalarCount

ยง8: Lemma 8.2 โ€” the common scalar character group #

The exponent-2 abelian ledger collapse and the two character counts it yields: |Hom_cont(ฮ“_A, ๐”ฝโ‚‚)| = 8 (lemma_8_2_gammaA) and |Hom_cont(G_โ„šโ‚‚, ๐”ฝโ‚‚)| = 8 (lemma_8_2_local), via the ฮ -side count card_char_piBd.

Lemma 8.2: the common scalar character group #

The ฮ“_A-side proof runs entirely over the admissible-limit proof/Prop. 2.3 layer: continuous characters of ฮ“_A are Fโ‚„-generator values killing N_A; killing N_A forces c(ฯ„) = 1 (tameRelator_mem_NA), and conversely c(ฯ„) = 1 makes ker c admissible โ€” because in an exponent-2 abelian quotient the whole ฯ‰โ‚‚-word ledger collapses and the wild relation (6) follows from ฯ„ = 1 (wildRel_of_comm2 below, the ยง8 counterpart of the AppendixB ledger evaluations; with the paper's hโ‚€ โ€” eq. (3), including the bare dโ‚€ โ€” the wild value at ฯ„ โ‰  1 is ฯ„, so the relation is not unconditional).

theorem GQ2.SectionEight.powOmega2_eq_self_of_sq {A : Type u_1} [Group A] (h2 : โˆ€ (a : A), a * a = 1) (a : A) :
powOmega2 a = a

powOmega2 is the identity on involutions (orderOf โˆฃ 2 means order 2^0 or 2^1).

theorem GQ2.SectionEight.conjP_of_comm {A : Type u_1} [Group A] (hcomm : โˆ€ (a b : A), a * b = b * a) (x g : A) :
conjP x g = x

In an abelian group, the paper's conjugation is trivial.

theorem GQ2.SectionEight.commP_of_comm {A : Type u_1} [Group A] (hcomm : โˆ€ (a b : A), a * b = b * a) (x y : A) :
commP x y = 1

In an abelian group, the paper's commutator is trivial.

theorem GQ2.SectionEight.Marking.wildRel_of_comm2 {A : Type u_1} [Group A] (hcomm : โˆ€ (a b : A), a * b = b * a) (h2 : โˆ€ (a : A), a * a = 1) (t : Marking A) (hฯ„ : t.ฯ„ = 1) :

The wild relation follows from ฯ„ = 1 in an exponent-2 abelian group (the ฯ‰โ‚‚-ledger collapse at ฯ„ = 1: uแตข = xแตข, dโ‚€ = 1, cโ‚€ = h_c = 1, hโ‚€ = xโ‚€ยฒ = 1, and (6) telescopes to 1). For scalar characters the hypothesis is free โ€” the tame relation already forces ฯ„ = 1 (tameRel_iff_of_comm2), so they see no additional wild obstruction. (Without ฯ„ = 1 the wild value is ฯ„: the paper's hโ‚€ โ€” eq. (3), with the bare dโ‚€ โ€” evaluates to 1, not ฯ„.)

theorem GQ2.SectionEight.Marking.tameRel_iff_of_comm2 {A : Type u_1} [Group A] (hcomm : โˆ€ (a b : A), a * b = b * a) (h2 : โˆ€ (a : A), a * a = 1) (t : Marking A) :
t.TameRel โ†” t.ฯ„ = 1

In an exponent-2 abelian group, the tame relation says exactly ฯ„ = 1.

theorem GQ2.SectionEight.mul_comm_of_exp_two {A : Type u_1} [Group A] (h2 : โˆ€ (a : A), a * a = 1) (a b : A) :
a * b = b * a

Exponent 2 forces commutativity (ab = (ab)โปยน = bโปยนaโปยน = ba).

The ฮ“_A-side character count #

noncomputable def GQ2.SectionEight.charEquiv {G : Type} [Group G] [TopologicalSpace G] [IsTopologicalGroup G] (N : Subgroup G) [N.Normal] :
(G โงธ N โ†’โ‚œ* Multiplicative (ZMod 2)) โ‰ƒ { c : G โ†’โ‚œ* Multiplicative (ZMod 2) // N โ‰ค c.ker }

Characters of a topological quotient group G โงธ N are characters of G killing N (the Prop. 2.3 push/descend mechanics, without surjectivity; instantiated at N_A for the ฮ“_A-count and at the relator subgroup for the ฮ -count).

Equations
  • One or more equations did not get rendered due to their size.
Instances For
    noncomputable def GQ2.SectionEight.cmhEquivFun {X : Type} :
    (โ†‘(FreeProfiniteGroup X).toProfinite.toTop โ†’โ‚œ* Multiplicative (ZMod 2)) โ‰ƒ (X โ†’ Multiplicative (ZMod 2))

    Characters of a free profinite group are their generator values (the universal property, in ContinuousMonoidHom form via the Prop. 2.3 uniqueness lemma).

    Equations
    • One or more equations did not get rendered due to their size.
    Instances For
      theorem GQ2.SectionEight.ker_char_NA_le_iff (c : โ†‘(FreeProfiniteGroup (Fin 4)).toProfinite.toTop โ†’โ‚œ* Multiplicative (ZMod 2)) :
      NA โ‰ค c.ker โ†” c univMarking.ฯ„ = 1

      The kills-N_A criterion: a character of Fโ‚„ kills N_A iff it kills ฯ„. Forward: N_A contains the tame relator (the admissible-limit proof), whose ๐”ฝโ‚‚-image is c(ฯ„). Backward: ker c is then an admissible open normal subgroup (generation is automatic, the tame relation is the ฯ„-kill, and the wild relation and 2-core are unconditional in an exponent-2 abelian quotient), so N_A โ‰ค ker c by the admissible-limit proof characterization.

      def GQ2.SectionEight.vecEquiv :
      { v : Fin 4 โ†’ Multiplicative (ZMod 2) // v 1 = 1 } โ‰ƒ Multiplicative (ZMod 2) ร— Multiplicative (ZMod 2) ร— Multiplicative (ZMod 2)

      Splitting off the ฯ„-coordinate.

      Equations
      • One or more equations did not get rendered due to their size.
      Instances For
        theorem GQ2.SectionEight.lemma_8_2_gammaA :
        Nat.card (โ†‘GammaA.toProfinite.toTop โ†’โ‚œ* Multiplicative (ZMod 2)) = 8

        Lemma 8.2, candidate source: |Hom_cont(ฮ“_A, ๐”ฝโ‚‚)| = 8. Proved over the the admissible-limit proof/Prop. 2.3 layer: characters of ฮ“_A are Fโ‚„-generator values killing N_A (charEquiv/cmhEquivFun), and killing N_A is exactly killing ฯ„ (ker_char_NA_le_iff โ€” the tame relator forces it, and conversely c(ฯ„) = 1 gives both relations in exponent-2 abelian quotients, Marking.wildRel_of_comm2). That leaves the free ๐”ฝโ‚‚ยณ of ฯƒ, xโ‚€, xโ‚-values.

        The ฮ -side count and the local source #

        ๐”ฝโ‚‚-characters kill the pro-2 kernel (the maximal pro-p quotient API), so they factor through the maximal pro-2 quotient; BoundaryMaps.ker_pro2F pins that quotient as ฮ , whose characters are the free ๐”ฝโ‚‚ยณ of ฯƒ, xโ‚€, xโ‚-values (the piRelator-condition is vacuous by the same exponent-2 ledger collapse).

        theorem GQ2.SectionEight.card_char_piBd :
        Nat.card (โ†‘PiBd.toProfinite.toTop โ†’โ‚œ* Multiplicative (ZMod 2)) = 8

        The ฮ -character count: |Hom_cont(ฮ , ๐”ฝโ‚‚)| = 8 โ€” the presentation has three generators and its relator has no mod-2 linear part (paper, proof of Lemma 8.2).

        theorem GQ2.SectionEight.lemma_8_2_local (B : BoundaryMaps) [CompactSpace AbsGalQ2] [TotallyDisconnectedSpace AbsGalQ2] :
        Nat.card (AbsGalQ2 โ†’โ‚œ* Multiplicative (ZMod 2)) = 8

        Lemma 8.2, local source: |Hom_cont(G_โ„šโ‚‚, ๐”ฝโ‚‚)| = 8 (= |โ„šโ‚‚หฃ/(โ„šโ‚‚หฃ)ยฒ|). Proved via the common marked maximal pro-2 quotient: a BoundaryMaps witness pins pro2F as the maximal pro-2 quotient map (ker_pro2F), every ๐”ฝโ‚‚-character kills the pro-2 kernel (the maximal pro-p quotient API proPKernel_le_ker), so precomposition with pro2F bijects characters of ฮ  with characters of G_โ„šโ‚‚, and card_char_piBd finishes. [Statement amendment (F-owner): the BoundaryMaps hypothesis and the CompactSpace/TotallyDisconnectedSpace instance hypotheses on AbsGalQ2 (the main_presentation house pattern) โ€” without the bundle the count is B4/B5-content outside the ยง8 proof layer axiom budget.]