Integrated current route, seventeenth refinement

Route17 keeps route16's assembly shape but swaps in the newest sidecars:

• target K/R through TargetKmodRRoute17BridgeProofs, replacing the two route16 same-tower bridge leaves by narrower projection-semantic leaves;
• candidate scalar/Frattini through CandidateScalarFrattiniRoute17Proofs, replacing the five route16 candidate leaves by two direct exact-image residuals;
• Section 7 kernel/head through MinimalBlockKernelConcreteRoute17Proofs, replacing the monolithic route16 kernel package by narrower same-tower provenance leaves;
• pushout/determinant through MinimalBlockPushoutRoute17Proofs, replacing the two route16 pushout leaves by split actual central-extension packets.

theorem Q2Presentation.Induction.minimalBlock_groupTowerData_from_currentIntegrated17 {p : FramedPair} (chief : NonScalarChiefFactor p) : Nonempty (MinimalBlockGroupTowerData p chief)

Route17 group tower: same-tower kernel/head provenance split.

theorem Q2Presentation.Induction.centralCover_realization_proven_fine_from_selfGroupTowerCurrentIntegrated17 {p : FramedPair} {chief : NonScalarChiefFactor p} (G : MinimalBlockGroupTowerData p chief) (h : ¬ScalarTerminal p) (Fdet : MinimalBlockPreheadExtraspecialEquivariantFamilyData G.preheadTowerData) (A : MinimalBlockPreheadExtraspecialAnnihilationData Fdet) (Rdet : MinimalBlockPreheadExtraspecialRadicalData Fdet) : Nonempty (CoverRealization (G.toMinimalBlock h Fdet A Rdet))

Route17 cover realization: target route17 bridge, candidate route17 direct exact-image split, kernel route17, and route17 pushout data.

theorem Q2Presentation.Induction.boundaryFramed_nonterminal_fourier_branch_currentIntegrated17 (p : FramedPair) : ¬ScalarTerminal p → Nonempty (FourierBranchData p)

Route17 nonterminal branch.

theorem Q2Presentation.Induction.boundaryFramed_recursive_branch_from_fourier_currentIntegrated17 (p : FramedPair) (h : ¬ScalarTerminal p) : ∃ (children : List FramedPair) (combine : List Cardinal.{0} → Cardinal.{0}), (∀ c ∈ children, framedMeasure c < framedMeasure p) ∧ framedCountA p = combine (List.map framedCountA children) ∧ framedCountQ p = combine (List.map framedCountQ children)

theorem Q2Presentation.Induction.boundaryFramed_recursion_step_currentIntegrated17 (p : FramedPair) : framedCountA p = framedCountQ p ∨ ∃ (children : List FramedPair) (combine : List Cardinal.{0} → Cardinal.{0}), (∀ c ∈ children, framedMeasure c < framedMeasure p) ∧ framedCountA p = combine (List.map framedCountA children) ∧ framedCountQ p = combine (List.map framedCountQ children)

theorem Q2Presentation.Induction.boundaryFramed_counts_equal_currentIntegrated17 (p : FramedPair) : framedCountA p = framedCountQ p

theorem Q2Presentation.Induction.finite_surjection_counts_equal_currentIntegrated17 (G : Type) [Group G] [Finite G] [Nonempty G] : Cardinal.mk (Profinite.SurjContHom GammaA (ProfiniteGrp.ofFiniteGrp (FiniteGrp.of G))) = Cardinal.mk (Profinite.SurjContHom GQ2Profinite (ProfiniteGrp.ofFiniteGrp (FiniteGrp.of G)))

Route17 finite-surjection equality.