Integrated current route, third refinement #
This file combines two independent post-route2 sidecars:
MinimalBlockKernelModuleActualClosersreplaces the aggregateminimalBlock_kernelModuleActualProofspacket by the finer actual kernel-module packets.MinimalBlockExtraspecialActualClosers4replaces the two route2 extraspecial packets by one same-family actual central-pushout route and its lower determinant packets.
The result below is the current strongest finite-surjection-count theorem used by the final presentation theorem.
theorem
Q2Presentation.Induction.boundaryFramed_nonterminal_fourier_branch_currentIntegrated3
(p : FramedPair)
:
¬ScalarTerminal p → Nonempty (FourierBranchData p)
Nonterminal Fourier branch using both the actual kernel-module route and the fourth-pass actual extraspecial central-pushout route.
theorem
Q2Presentation.Induction.boundaryFramed_recursive_branch_from_fourier_currentIntegrated3
(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_currentIntegrated3
(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.finite_surjection_counts_equal_currentIntegrated3
(G : Type)
[Group G]
[Finite G]
[Nonempty G]
:
Current strongest finite-surjection equality route, combining the actual kernel-module and fourth-pass actual extraspecial refinements.