Documentation

YoungDiagram.Theorem6.MixPiLambda.CaseA2

§16 Case A Branch A: Case 2 bottom-chain + boundary for Mix (Pi, Lambda). #

Parity-mirror of the corresponding pieces in MixLambdaPi/CaseA.lean. For Mix (Pi, Lambda) the minimal nonpolarized gene g₁ has ODD rank 2m'+1, so the bottom-chain b_m < d_m (and the a-version for the g⁻ charge) is anchored at the odd level 2m'+1 and only applies for m' ≥ 1 (the m'=0, i.e. m=1, case is the separate g₃ sub-case). The Case-2 top boundary is prime^[2n'+2] Y ≠ 0.

theorem MixPiLambda.branchA_case2_bm_lt {N : } (X Y : nMixPiLambda N) (hXY : X < Y) (ha : (Sigma.sigma (↑X) 1).1 < (Sigma.sigma (↑Y) 1).1) (m' : ) (hm'pos : 1 m') (hmin : g(↑X).support, 2 * m' + 1 g.rank) :
(Sigma.sigma (↑X) (2 * m' + 1)).2 < (Sigma.sigma (↑Y) (2 * m' + 1)).2

§16 bottom-chain b_m < d_m for Branch A Case 2, Mix (Pi, Lambda), at the odd anchor m = 2m'+1 with m' ≥ 1. Uses the odd branch of cond_15_7_Mix_Pi_Lambda, rank antitonicity, the level-1 gap, and twostep_snd = cells.

theorem MixPiLambda.branchA_case2_am_lt {N : } (X Y : nMixPiLambda N) (hXY : X < Y) (ha : (Sigma.sigma (↑X) 1).1 < (Sigma.sigma (↑Y) 1).1) (m' : ) (hm'pos : 1 m') (hmin : g(↑X).support, 2 * m' + 1 g.rank) :
(Sigma.sigma (↑X) (2 * m' + 1)).1 < (Sigma.sigma (↑Y) (2 * m' + 1)).1

§16 bottom-chain a_m < c_m for Branch A Case 2, Mix (Pi, Lambda) (the g⁻ charge via sign-duality). a-component analogue of branchA_case2_bm_lt.

theorem MixPiLambda.branchA_case2_Ynonzero_top {N : } (X Y : nMixPiLambda N) (hXY : X < Y) (hcommon : ¬∃ (g : Gene), 0 < X g 0 < Y g) (n' : ) (gk : Gene) (hgk_rank : gk.rank = 2 * n' + 2) (hgk_pos : gk.type = GeneType.Positive) (hXgk : 0 < X gk) :
(⇑Chromosome.prime)^[2 * n' + 2] Y 0

Top-boundary nonvanishing for §16 Branch A Case 2 (Mix (Pi, Lambda), gk = g⁺(2n'+2)): prime^[2n'+2] Y ≠ 0. b-mirror style: if it vanished, prime^[2n'+1] Y (which lives in Mix (Lambda, Pi), oddPart ∈ Pi) would consist only of rank-1 polarized genes, none positive (a positive g⁺(1) would trace to Y gk = 0 by disjointness), so its first signature component is 0, contradicting a_X(2n'+1) ≥ 1.

theorem MixPiLambda.exists_mutation_le_caseA_branchA_case1_full {N : } (X Y : nMixPiLambda N) (hXY : X < Y) (hsigeq : ¬∃ (k : ), 0 < k (⇑Chromosome.prime)^[k] Y 0 Sigma.sigma (↑X) k = Sigma.sigma (↑Y) k) (hgap_nat : Chromosome.rank ((⇑Chromosome.prime)^[1] X) < Chromosome.rank ((⇑Chromosome.prime)^[1] Y)) (m' n' : ) (hmn : m' < n') (gm gk : Gene) (hgm_rank : gm.rank = 2 * m' + 1) (hgm_np : gm.type = GeneType.NonPolarized) (hgk_rank : gk.rank = 2 * n' + 1) (hgk_np : gk.type = GeneType.NonPolarized) (hXgm : 0 < X gm) (hXgk : 0 < (X - Finsupp.single gm 1) gk) (hmin : g(↑X).support, 2 * m' + 1 g.rank) (h2nd : g(X - Finsupp.single gm 1).support, 2 * n' + 1 g.rank) (ha_m : (Sigma.sigma (↑X) (2 * m' + 1)).1 < (Sigma.sigma (↑Y) (2 * m' + 1)).1) :
∃ (Z : (Variety.Mix (Variety.Pi, Variety.Lambda))), Step (↑X) Z Z Y

Branch A Case 1 driver (Mix (Pi, Lambda)). Chains the propagation core and the type4 assembly.

theorem MixPiLambda.branchA_case2_full {N : } (X Y : nMixPiLambda N) (hXY : X < Y) (hcommon : ¬∃ (g : Gene), 0 < X g 0 < Y g) (hsigeq : ¬∃ (k : ), 0 < k (⇑Chromosome.prime)^[k] Y 0 Sigma.sigma (↑X) k = Sigma.sigma (↑Y) k) (hgap_nat : Chromosome.rank ((⇑Chromosome.prime)^[1] X) < Chromosome.rank ((⇑Chromosome.prime)^[1] Y)) (m' n' : ) (hmn : m' n') (gm gk : Gene) (hgm_rank : gm.rank = 2 * m' + 1) (hgm_np : gm.type = GeneType.NonPolarized) (hgk_rank : gk.rank = 2 * n' + 2) (hgk_pos : gk.type = GeneType.Positive) (hgm1 : X gm = 1) (hXgm : 0 < X gm) (hXgk : 0 < (X - Finsupp.single gm 1) gk) (hmin : g(↑X).support, 2 * m' + 1 g.rank) (h2nd : g(X - Finsupp.single gm 1).support, 2 * n' + 2 g.rank) (hb_m : (Sigma.sigma (↑X) (2 * m' + 1)).2 < (Sigma.sigma (↑Y) (2 * m' + 1)).2) :
∃ (Z : (Variety.Mix (Variety.Pi, Variety.Lambda))), Step (↑X) Z Z Y

Branch A Case 2 driver (g₂ = g⁺(k), Mix (Pi, Lambda)). Chains the b-propagation, the top boundary, and the type5 assembly.

theorem MixPiLambda.branchA_single_gene (m : ) (X Y : nMixPiLambda (m + 2)) (hXY : X < Y) :
(¬∃ (g : Gene), 0 < X g 0 < Y g) → ∀ (g₁ : Gene), 0 < X g₁∀ (hg₁NP : g₁.type = GeneType.NonPolarized) (m' : ) (hm' : g₁.rank = 2 * m' + 1), X g₁ = 1∀ (hsingle : X = Finsupp.single g₁ 1), ∃ (Z : (Variety.Mix (Variety.Pi, Variety.Lambda))), Step (↑X) Z Z Y

Branch A edge case: X is a single nonpolarized gene g₁ (no second gene). Vacuous: Y of equal rank with X ≤ Y forces Y = X (the unique odd-rank gene shape).

theorem MixPiLambda.branchA_case1_neg (m : ) (X Y : nMixPiLambda (m + 2)) (hXY : X < Y) (hsigeq : ¬∃ (k : ), 0 < k (⇑Chromosome.prime)^[k] Y 0 Sigma.sigma (↑X) k = Sigma.sigma (↑Y) k) (ha : (Sigma.sigma (↑X) 1).1 < (Sigma.sigma (↑Y) 1).1) (g₁ : Gene) (hXg₁ : 0 < X g₁) (hg₁min : g(↑X).support, g₁.rank g.rank) (hg₁NP : g₁.type = GeneType.NonPolarized) (m' : ) (hm' : g₁.rank = 2 * m' + 1) (g₂ : Gene) (n' : ) (hg₂rank : g₂.rank = 2 * n' + 1) (hg₂NP : g₂.type = GeneType.NonPolarized) (hmn : m' < n') (hXg₂ : 0 < (X - Finsupp.single g₁ 1) g₂) (hg₂min : g(X - Finsupp.single g₁ 1).support, 2 * n' + 1 g.rank) (hb_m : (Sigma.sigma (↑X) (2 * m' + 1)).2 < (Sigma.sigma (↑Y) (2 * m' + 1)).2) :
∃ (Z : (Variety.Mix (Variety.Pi, Variety.Lambda))), Step (↑X) Z Z Y

Branch A Case 1, b-component sub-branch (b_m < d_m): the sign-dual of case1_full (apply Case 1 to -X, -Y, then negate). Level-1 asymmetry is sidestepped since case1_full takes the self-dual total-rank gap.

theorem MixPiLambda.branchA_case2_full_neg {N : } (X Y : nMixPiLambda N) (hXY : X < Y) (hcommon : ¬∃ (g : Gene), 0 < X g 0 < Y g) (hsigeq : ¬∃ (k : ), 0 < k (⇑Chromosome.prime)^[k] Y 0 Sigma.sigma (↑X) k = Sigma.sigma (↑Y) k) (ha : (Sigma.sigma (↑X) 1).1 < (Sigma.sigma (↑Y) 1).1) (m' n' : ) (hmn : m' n') (gm gk : Gene) (hgm_rank : gm.rank = 2 * m' + 1) (hgm_np : gm.type = GeneType.NonPolarized) (hgk_rank : gk.rank = 2 * n' + 2) (hgk_neg : gk.type = GeneType.Negative) (hgm1 : X gm = 1) (hXgm : 0 < X gm) (hXgk : 0 < (X - Finsupp.single gm 1) gk) (hmin : g(↑X).support, 2 * m' + 1 g.rank) (h2nd : g(X - Finsupp.single gm 1).support, 2 * n' + 2 g.rank) (ha_anchor : (Sigma.sigma (↑X) (2 * m' + 1)).1 < (Sigma.sigma (↑Y) (2 * m' + 1)).1) :
∃ (Z : (Variety.Mix (Variety.Pi, Variety.Lambda))), Step (↑X) Z Z Y

Branch A Case 2 driver, g₂ = g⁻(k) charge (via sign-duality to the g⁺ driver applied to (-X, -Y)). Takes the anchor a-strict ha_anchor (from am_lt for m'≥1, or directly from ha when m'=0).

theorem MixPiLambda.branchA_case2_g3 (m : ) (X Y : nMixPiLambda (m + 2)) (hXY : X < Y) (hcommon : ¬∃ (g : Gene), 0 < X g 0 < Y g) (hsigeq : ¬∃ (k : ), 0 < k (⇑Chromosome.prime)^[k] Y 0 Sigma.sigma (↑X) k = Sigma.sigma (↑Y) k) (hXpn : ¬∃ (g : Gene) (h : Gene), g.rank = h.rank g.type = GeneType.Positive h.type = GeneType.Negative 0 < X g 0 < X h) (ha : (Sigma.sigma (↑X) 1).1 < (Sigma.sigma (↑Y) 1).1) (g₁ g₂ : Gene) (n' : ) (hg₁NP : g₁.type = GeneType.NonPolarized) (hg₁rank : g₁.rank = 1) :
0 < X g₁∀ (hmult1 : X g₁ = 1) (hg₂pos : g₂.type = GeneType.Positive) (hg₂rank : g₂.rank = 2 * n' + 2) (hXg₂ : 0 < (X - Finsupp.single g₁ 1) g₂) (hg₁min : g(↑X).support, g₁.rank g.rank) (hg₂min : g(X - Finsupp.single g₁ 1).support, g₂.rank g.rank), (Sigma.sigma (↑X) 1).2 = (Sigma.sigma (↑Y) 1).2∃ (Z : (Variety.Mix (Variety.Pi, Variety.Lambda))), Step (↑X) Z Z Y

§16 Case 2 m=1, b₁=d₁ sub-case (the PL-specific g₃ leaf). Here g₁=g(1), g₂=g⁺(k), a₁<c₁ (ha) and b₁=d₁, so X - g₁ - g₂ contains a negative or nonpolarized gene g₃ of minimal rank t; the mutation g₂+g₃ → g(k-1)+g(t+1) (t even) or g₂+g₃ → g(k-1)+g⁺(t+1) (t odd) gives Z ≤ Y. Formalization target.

theorem MixPiLambda.branchA_case2 (m : ) (X Y : nMixPiLambda (m + 2)) (hXY : X < Y) (hcommon : ¬∃ (g : Gene), 0 < X g 0 < Y g) (hsigeq : ¬∃ (k : ), 0 < k (⇑Chromosome.prime)^[k] Y 0 Sigma.sigma (↑X) k = Sigma.sigma (↑Y) k) (hXpn : ¬∃ (g : Gene) (h : Gene), g.rank = h.rank g.type = GeneType.Positive h.type = GeneType.Negative 0 < X g 0 < X h) (ha : (Sigma.sigma (↑X) 1).1 < (Sigma.sigma (↑Y) 1).1) (g₁ : Gene) (hXg₁ : 0 < X g₁) (hg₁min : g(↑X).support, g₁.rank g.rank) (hg₁NP : g₁.type = GeneType.NonPolarized) (m' : ) (hm' : g₁.rank = 2 * m' + 1) (hmult1 : X g₁ = 1) (g₂ : Gene) (hXg₂ : 0 < (X - Finsupp.single g₁ 1) g₂) (hg₂min : g(X - Finsupp.single g₁ 1).support, g₂.rank g.rank) (hg₂pol : g₂.type GeneType.NonPolarized) :
∃ (Z : (Variety.Mix (Variety.Pi, Variety.Lambda))), Step (↑X) Z Z Y

Branch A Case 2: the second gene g₂ is polarized (§16 Case 2). Dispatches on g₂'s charge (g⁺ direct / g⁻ sign-dual) and, at m'=0 (m=1), on b₁ vs d₁.

theorem MixPiLambda.branchA_mult_one (m : ) (X Y : nMixPiLambda (m + 2)) (hXY : X < Y) (hcommon : ¬∃ (g : Gene), 0 < X g 0 < Y g) (hsigeq : ¬∃ (k : ), 0 < k (⇑Chromosome.prime)^[k] Y 0 Sigma.sigma (↑X) k = Sigma.sigma (↑Y) k) (hXpn : ¬∃ (g : Gene) (h : Gene), g.rank = h.rank g.type = GeneType.Positive h.type = GeneType.Negative 0 < X g 0 < X h) (ha : (Sigma.sigma (↑X) 1).1 < (Sigma.sigma (↑Y) 1).1) (g₁ : Gene) (hXg₁ : 0 < X g₁) (hg₁min : g(↑X).support, g₁.rank g.rank) (hg₁NP : g₁.type = GeneType.NonPolarized) (m' : ) (hm' : g₁.rank = 2 * m' + 1) (hmult1 : X g₁ = 1) :
∃ (Z : (Variety.Mix (Variety.Pi, Variety.Lambda))), Step (↑X) Z Z Y

Branch A, multiplicity-one sub-case (X g₁ = 1). Extract g₂ of minimal rank in X - g₁ and split on its polarization (§16 Cases 1–2); no second gene → vacuous edge.

theorem MixPiLambda.exists_mutation_le_caseA_branchA (m : ) (X Y : nMixPiLambda (m + 2)) (hXY : X < Y) (hcommon : ¬∃ (g : Gene), 0 < X g 0 < Y g) (hsigeq : ¬∃ (k : ), 0 < k (⇑Chromosome.prime)^[k] Y 0 Sigma.sigma (↑X) k = Sigma.sigma (↑Y) k) (hXpn : ¬∃ (g : Gene) (h : Gene), g.rank = h.rank g.type = GeneType.Positive h.type = GeneType.Negative 0 < X g 0 < X h) (ha : (Sigma.sigma (↑X) 1).1 < (Sigma.sigma (↑Y) 1).1) (g₁ : Gene) (hXg₁ : 0 < X g₁) (hg₁min : g(↑X).support, g₁.rank g.rank) (hg₁NP : g₁.type = GeneType.NonPolarized) :
∃ (Z : (Variety.Mix (Variety.Pi, Variety.Lambda))), Step (↑X) Z Z Y

Branch A of §16 Case A for Mix (Pi, Lambda): minimal-rank gene g₁ nonpolarized (odd rank). Dispatch on whether X ⊇ 2g(m).