# TEST K10 WEIGHTED LIFTING FOR n >= 2m! # First test (m=2, ...
Prompt
# TEST K10 WEIGHTED LIFTING FOR n >= 2m! # First test (m=2, n=5) with H = x^3 + y^2 (wt(x)=2, wt(y)=3, wt(H)=6): # P_top = H^2 (wt 12), Q_top = H^5 (wt 30). #Wait: can P have a subleading term P_{12-k} NOT divisible by H? # Let's check for k = 1, 2, 3, 4, 5, 6! # Remember: at weight deficit k (k not div by 6), Q_{30-k} = (5/2) H^3 P_{12-k}. # Then at deficit 2k: # [H^2, Q_{30-2k}] + [P_{12-2k}, H^5] + [P_{12-k}, Q_{30-k}] = 0 # => H * [H, 2*Q_{30-2k} - 5*H^3*P_{12-2k}] = -(5/2)*[P_{12-k}, H^3 * P_{12-k}] = -(15/2)*H^2 * P_{12-k} * [P_{12-k}, H]! # Divide by H: # [H, 2*Q_{30-2k} - 5*H^3*P_{12-2k}] = -(15/2) * H * P_{12-k} * [P_{12-k}, H]! # WAIT A SECOND!! # Look at the RHS: -(15/2) * H * P_{12-k} * [P_{12-k}, H] = -(15/4) * H * [P_{12-k}^2, H] = [H, (15/4) * H * P_{12-k}^2]!! # IT IS AN EXACT IMAGE OF [H, .]!! # WHY?! Because [P_{12-k}^2, H] = 2 * P_{12-k} * [P_{12-k}, H]!! # AND [H, H * P_{12-k}^2] = H * [H, P_{12-k}^2] = -H * [P_{12-k}^2, H] = -2 * H * P_{12-k} * [P_{12-k}, H]!! # HOLY SHIT!! # THAT SOLVES AUTOMATICALLY AS: # 2*Q_{30-2k} - 5*H^3*P_{12-2k} = (15/4) * H * P_{12-k}^2 (plus ker([H,.]) if 2k div by 6)!! # Wait: that just says Q ~ (H^2 + P_{12-k})^(5/2)!! # Let's check what happens at deficit 3k, 4k, ..., up to weight 0 in Python! # Wait: look at (H^2 + P_{12-k})^(5/2) = H^5 + 5/2 H^3 P + 15/8 H P^2 + 5/16 P^3 / H - ...!! # AT DEFICIT 3k, THE TERM 5/16 * P^3 / H HAS H IN THE DENOMINATOR!! # Wait: Can H divide P_{12-k}^3? Not unless H divides P_{12-k}! # UNLESS at deficit 3k, 4k, ..., we DON'T just put P_{12-k} at a single weight — we check if [P_{12-k}, Q_{30-2k}] + [P_{12-2k}, Q_{30-k}] can cancel the H^{-1} pole! # WAIT: Let's check for m = 2, n = 5 (and m = 35, n = 75 -> deg 105, 225) in Python! import sympy as sp x, y = sp.symbols('x y') H = x**3 + y**2 def jac(A, B): return sp.expand(sp.diff(A, x)*sp.diff(B, y) - sp.diff(A, y)*sp.diff(B, x)) # Test (m=2, n=5) with P_top = H^2 (wt 12) + P_{12-k}: # Notice: if k = 1, wt(P_{11}) = 11 -> monomials x*y^3, x^4*y. # Let P_{11} = a1*x*y^3 + a2*x^4*y (not divisible by H unless a1 == a2). # Q_{29} = (5/2)*H^3*P_{11}. # Q_{28} = (5/2)*H^3*P_{10} + (15/8)*H*P_{11}^2. # Now check deficit 3k = 3 (weight of J: 12 + 30 - 5 - 3 = 34): # Terms in [P, Q] at weight 34: # [H^2, Q_{27}] + [P_9, H^5] + [P_{11}, Q_{28}] + [P_{10}, Q_{29}]! # Let's compute [P_{11}, (15/8)*H*P_{11}^2] + [P_{11}, (5/2)*H^3*P_{10}] + [P_{10}, (5/2)*H^3*P_{11}]! a1, a2, b1, b2 = sp.symbols('a1 a2 b1 b2') P_11 = a1*x*y**3 + a2*x**4*y # Weight 10 monomials (2a + 3b = 10): (5, 0) -> x^5, (2, 2) -> x^2 y^2 P_10 = b1*x**5 + b2*x**2*y**2 Q_29 = sp.Rational(5, 2) * H**3 * P_11 Q_28 = sp.Rational(5, 2) * H**3 * P_10 + sp.Rational(15, 8) * H * P_11**2 # Compute weight-34 part of J(H^2 + P_11 + P_10, H^5 + Q_29 + Q_28) excluding [H^2, Q_27] + [P_9, H^5]: rem_34 = sp.expand(jac(P_11, Q_28) + jac(P_10, Q_29)) # Notice [H^2, Q_27] + [P_9, H^5] = H * [H, 2*Q_27 - 5*H^3*P_9]! # So H MUST divide rem_34! rem_mod_H = sp.rem(rem_34, H, y) print("For (m=2, n=5) with P_11, P_10: remainder of weight-34 bracket mod H =", sp.factor(rem_mod_H)) # Look! Look at the result: H | rem_34 requires rem_mod_H == 0 => forces a1 == a2 (i.e. H | P_11)!! # WHY? Because at deficit 3k, [P_{11}, (15/8)*H*P_{11}^2] has NO H outside the bracket: # [P_{11}, H * P_{11}^2] = P_{11}^2 * [P_{11}, H]! # Wait: what if k = 2 (P_{11} = 0, first term at P_{10})? # Then at deficit 3k = 6, [P_{10}, H * P_{10}^2] STILL has P_{10}^2 * [P_{10}, H], which STILL requires H | P_{10}! # Wait: WHAT IF P_{11} = 0, P_{10} = 0, ..., and the first non-zero term is at k = 6 (wt 6, i.e. P_6 = c*H)?! # That's divisible by H! # WHAT IF n = 75, m = 35 (deg 105, 225)?? # At deficit 3k, (H^m + P)^((75/35)) = H^75 + (75/35) H^40 P + ... + c * H^5 * P^2 + c' * H^(-30) * P^3! # Look at the exponent of H in the 3rd term of (H^m + P)^(n/m): # Term j of H^n * (1 + P / H^m)^(n/m) is H^(n - j*m) * P^j!! # When j = 3: exponent is n - 3m! # If n >= 3m (e.g. m = 35, n = 105 -> wait: 35 | 105! What about m = 35, n = 112 -> deg 105, 336, gcd = 7, 35 does NOT divide 112!!): # Then n - 3m = 112 - 105 = 7 >= 0! # Wait: for j = 4, n - 4m = 112 - 140 = -28 < 0! # At j = 4, H divides P^4 unless H | P, OR what if k is large enough that 4k > 6m (below wt 0)?! # WAIT A SECOND!! # READ THAT AGAIN!! # If the first non-zero term below H^m is at deficit k such that: # j * k > 6m + 6n - 5 ... NO: the deficit in P is k, so at step j, the weight in P is 6m - j*k? # No, the weight of J(H^m + P_{6m-k}, H^n + ...) at term j is 6m + 6n - 5 - j*k! # If j*k > 6m + 6n - 5, the weight is NEGATIVE (so that term doesn't even exist if 6n - j*k < 0, wait: it only needs to stay positive up to j = floor(n/m)+1)! # Wait: if n/m is between 3 and 4 (say m=35, n=112, so floor(n/m) + 1 = 4): # For 4*k > 6m + 6n - 5: impossible since k <= 6m! # Actually: we ONLY need the pole term H^(n - j*m) in Q to occur at a weight < 0 (so it isn't in the polynomial)! # Weight of the j-th binomial term H^(n - j*m) * P_{6m - k}^j is: # 6*(n - j*m) + j*(6m - k) = 6n - j*k! # For the j-th term (where n - j*m < 0, i.e. j = ceil(n/m)) to have weight < 0: # We need: 6n - j*k < 0 ==> k > 6n / j!! # Let's check: since j = floor(n/m) + 1 > n/m, 6n / j < 6m! # SO THERE EXISTS A DEFICIT k < 6m WHERE THE FIRST NEGATIVE H-POWER HAS WEIGHT < 0!! # WAIT A SECOND!! # STOP AND CHECK THAT NUMBER RIGHT NOW!! # Take m = 35, n = 112 (so deg P = 105 > 100, deg Q = 336, gcd = 7, neither divides the other)! # Here n / m = 112 / 35 = 3.2, so first negative H-power is at j = 4 (H^(112 - 140) = H^(-28))! # What is 6n / j? 6 * 112 / 4 = 168! # Meanwhile wt(H^35) = 6 * 35 = 210!! # SO FOR ANY DEFICIT k BETWEEN 169 AND 209 (i.e. weight of P_lt between 1 and 41): # ALL BINOMIAL TERMS j = 1, 2, 3 HAVE POSITIVE H-POWERS (H^77, H^42, H^7), # AND THE j = 4 TERM HAS WEIGHT 6*112 - 4*k = 672 - 4*k < 0 (IT DROPS BELOW DEGREE 0 COMPLETELY — ZERO POLES)!! # WAIT A SECOND!! # TEST THIS EXACT DISCOVERY WITH SMALLER NUMBERS FIRST (e.g. m = 2, n = 5 -> j = 3, 6n/3 = 10 < 12 = 6m, so k = 11 -> wt(P_lt) = 1!! Wait: wt=1 doesn't exist for (2,3), what about m = 3, n = 7 -> 6m = 18, 6n = 42, j = 3, 6n/3 = 14 < 18, so k = 15, 16, 17 -> wt(P_lt) = 1, 2, 3 -> x (wt 2), y (wt 3)!!)! # WAIT A SECOND!! # TEST m = 3, n = 7 (P_top = H^3 = (x^3+y^2)^3, wt 18, deg 9; Q_top = H^7, wt 42, deg 21) WITH P_lt = c*x (wt 2 -> k = 16 > 14!) OR c*y (wt 3 -> k = 15 > 14!) RIGHT NOW IN PYTHON!! print("\nFor m=2, n=5, rem_mod_H =", sp.factor(rem_mod_H))
Response not available
Response not available
Response not available