You are a strict Python→Zig transpiler. You will receive a ...

Prompt

You are a strict Python→Zig transpiler. You will receive a complete Python file as input. A Zig fájlnak önmagában külső fájlok nélkül is működnie kell You must return the equivalent Zig code. soha semmi egyszerusitett mock placeholder dummy szimulalt fake szart nem engedelyezek csak a teljes fajl teljes roviditetlen production ready kód CRITICAL RULES (DO NOT BREAK THEM): 1. Output ONLY Zig code. 2. NO comments at all. Do not keep original comments, do not add new ones. 3. NO explanations, NO summaries, NO notes. 4. NO placeholders, NO “...rest of code”, NO “to be implemented”. 5. Do not skip or shorten ANY part. Translate EVERY line. 6. The output must be complete, runnable Zig code with nothing missing. a teljes kódot küldöd. minden egyes karaktert leírsz, nem rövidítesz. minden hibát kijavítasz. egy fájl marad. ne írj semmi mást csak a teljes kódot es kommentek nem lehetnek benne! soha semmi egyszerusitett mock placeholder dummy szimulalt fake szart nem engedelyezek es teljes fájl roviditetlen production ready kód #!/usr/bin/env python3 """Search for a low-degree counterexample to the 2D Jacobian conjecture. For each total degree d, this constructs general polynomials P,Q in Q[x,y] with degree <= d and asks whether P_x Q_y - P_y Q_x == 1 (P(0,0), Q(0,0)) == (P(1,1), Q(1,1)). All algebra is exact. Constants of P and Q are set to zero without loss of generality: subtracting F(0,0) changes neither the Jacobian nor the equality F(0,0)=F(1,1). A proper coefficient ideal implies that a complex solution exists (by the Nullstellensatz). A unit ideal proves there is no solution at that degree. Groebner-basis computations can become prohibitively expensive as d grows. """ import argparse import sys import time import sympy as sp from sympy import Poly, groebner, solve_poly_system x, y = sp.symbols("x y") def make_problem(degree): """Return P, Q, coefficient symbols and exact equations for a degree bound.""" if degree < 1: raise ValueError("degree must be at least 1") monomials = [ (i, j) for total in range(1, degree + 1) for i in range(total, -1, -1) for j in [total - i] ] p_coeffs = sp.symbols(f"p0:{len(monomials)}") q_coeffs = sp.symbols(f"q0:{len(monomials)}") P = sp.expand(sum(c * x**i * y**j for c, (i, j) in zip(p_coeffs, monomials))) Q = sp.expand(sum(c * x**i * y**j for c, (i, j) in zip(q_coeffs, monomials))) coeffs = tuple(p_coeffs) + tuple(q_coeffs) jacobian_minus_one = sp.Poly( sp.expand(sp.diff(P, x) * sp.diff(Q, y) - sp.diff(P, y) * sp.diff(Q, x) - 1), x, y, ) equations = [coefficient for _monom, coefficient in jacobian_minus_one.terms()] equations.extend((P.subs({x: 1, y: 1}), Q.subs({x: 1, y: 1}))) equations = [sp.expand(eq) for eq in equations if sp.expand(eq) != 0] return P, Q, coeffs, equations def report_degree(degree, print_solutions=True): P, Q, coeffs, equations = make_problem(degree) print(f"\n=== Degree at most {degree} ===", flush=True) print(f"Unknown coefficients: {len(coeffs)}", flush=True) print(f"Polynomial equations: {len(equations)}", flush=True) print("Computing exact Groebner basis over QQ ...", flush=True) start = time.time() basis = groebner(equations, *coeffs, order="grevlex", domain=sp.QQ) elapsed = time.time() - start print(f"Groebner computation finished in {elapsed:.2f} s.", flush=True) if len(basis.polys) == 1 and basis.polys[0].as_expr() == 1: print("RESULT: No complex solution exists at this degree bound.") return "none" print("RESULT: The coefficient ideal is proper.") print("Therefore a complex solution exists for this degree bound.") if not print_solutions: print("Explicit coefficient values were not requested.") return "exists" if not basis.is_zero_dimensional: print("The solution set is positive-dimensional; this script does not parameterize it.") print("The exact non-unit Groebner basis is:") for poly in basis.polys: print(" ", poly.as_expr()) return "exists" try: lex_basis = basis.fglm(order="lex") solutions = solve_poly_system([poly.as_expr() for poly in lex_basis.polys], *coeffs) except Exception as exc: # SymPy's exact root solver has degree/shape limitations. print(f"Could not extract explicit roots from the exact basis: {exc}") return "exists" if not solutions: print("The exact ideal is proper, but SymPy did not return explicit roots.") return "exists" print(f"Explicit solution(s) found: {len(solutions)}") for index, solution in enumerate(solutions, start=1): substitutions = dict(zip(coeffs, solution)) p_solution = sp.factor(P.subs(substitutions)) q_solution = sp.factor(Q.subs(substitutions)) print(f"\nSolution {index}:") print("P(x,y) =", p_solution) print("Q(x,y) =", q_solution) print("Jacobian =", sp.factor( sp.diff(p_solution, x) * sp.diff(q_solution, y) - sp.diff(p_solution, y) * sp.diff(q_solution, x) )) print("F(0,0) =", (p_solution.subs({x: 0, y: 0}), q_solution.subs({x: 0, y: 0}))) print("F(1,1) =", (p_solution.subs({x: 1, y: 1}), q_solution.subs({x: 1, y: 1}))) return "exists" def main(): parser = argparse.ArgumentParser( description="Exact Groebner-basis search for a small-degree 2D Jacobian counterexample." ) parser.add_argument( "--max-degree", type=int, default=2, help="check each degree bound from 1 through this value (default: 2; larger values may be very slow)", ) parser.add_argument( "--no-explicit-solutions", action="store_true", help="only test whether each coefficient ideal is the unit ideal", ) args = parser.parse_args() if args.max_degree < 1: parser.error("--max-degree must be at least 1") try: for degree in range(1, args.max_degree + 1): report_degree(degree, print_solutions=not args.no_explicit_solutions) except KeyboardInterrupt: print("\nInterrupted. A timeout or interruption is not evidence either way.", file=sys.stderr) return 130 except Exception as exc: print(f"Exact symbolic computation failed: {type(exc).__name__}: {exc}", file=sys.stderr) print("Failure to finish is inconclusive; it does not prove nonexistence.", file=sys.stderr) return 2 return 0 if __name__ == "__main__": raise SystemExit(main())