gddlmZddlmZmZmZddlmZddlm Z m Z m Z m Z m Z ddlmZmZddlmZmZddlmZmZdZd d d d Zd S))combinations_with_replacement)symbolsAddDummy)Rational)cancelComputationFailedparallel_poly_from_exprreducedPoly)Monomial monomial_div) DomainErrorPolificationFailed)debugdebugfct|\}} t||gdd\}}n#t$r||z cYSwxYwt |t||z zS)z Put an expression over a common denominator, cancel and reduce. Examples ======== >>> from sympy import ratsimp >>> from sympy.abc import x, y >>> ratsimp(1/x + 1/y) (x + y)/(x*y) TF)fieldexpand)ras_numer_denomr r r)exprfgQrs R/var/www/html/ai-engine/env/lib/python3.11/site-packages/sympy/simplify/ratsimp.pyratsimpr s $<< & & ( (DAqq1#T%88811 s  7VAaC[[  s>AATF)quick polynomialcddlmtd|t|\}} t ||gzg|Ri|\}n#t $r|cYSwxYwj} | jr| _ntd| zfd|ddDtfddfd t|j j d }t|j j d }|r||z St|j j t|j j g\} } } s| rt!d t#| g} | D]S\}}}}||dd}| ||||fTt)| d\} } | jsC| d\}} | d\}} t/||}nt/d }| |jz| |jzz S)a Simplifies a rational expression ``expr`` modulo the prime ideal generated by ``G``. ``G`` should be a Groebner basis of the ideal. Examples ======== >>> from sympy.simplify.ratsimp import ratsimpmodprime >>> from sympy.abc import x, y >>> eq = (x + y**5 + y)/(x - y) >>> ratsimpmodprime(eq, [x*y**5 - x - y], x, y, order='lex') (-x**2 - x*y - x - y)/(-x**2 + x*y) If ``polynomial`` is ``False``, the algorithm computes a rational simplification which minimizes the sum of the total degrees of the numerator and the denominator. If ``polynomial`` is ``True``, this function just brings numerator and denominator into a canonical form. This is much faster, but has potentially worse results. References ========== .. [1] M. Monagan, R. Pearce, Rational Simplification Modulo a Polynomial Ideal, https://dl.acm.org/doi/pdf/10.1145/1145768.1145809 (specifically, the second algorithm) r)solveratsimpmodprimez.Cannot compute rational simplification over %scDg|]}|jS)LMorder).0ropts r z#ratsimpmodprime..Ss%<<z5ratsimpmodprime..staircase..bsB&&C<3''4/&&&&&&r*cHg|]}t|jjSr$)r as_exprgens)r'sr(s rr)z6ratsimpmodprime..staircase..fs,:::1# #SX.:::r*)rrangelenr5allappend)nSmiir1leading_monomialsr( staircases @rr@z"ratsimpmodprime..staircaseVs 663J /c#(mm0D0DaHH  BCMM!A  ! &&&&$&&&&&  :::::::YYq1u=M=MMMr*c|||}}d}||z}r|dz } n|} ||z| kr>||fvrn6||f||td||ftdt zt tdt zt z} t tfdtt Dj | z} t tfdtt Dj | z} t|| z|| zz j | zj d d} t | j  }|zd d }|rtd |DsZ| |}| |}|t!t#t%zdgt t zz}|t!t#t%zdgt t zz}t |j }t |j }|dkrt'd|| | |zf||z|kr |dg}n|dz }|dz }|dz }||z| k>|dkr,||||||z \}}}|||||z |\}}}|||fS)ak Computes a rational simplification of ``a/b`` which minimizes the sum of the total degrees of the numerator and the denominator. Explanation =========== The algorithm proceeds by looking at ``a * d - b * c`` modulo the ideal generated by ``G`` for some ``c`` and ``d`` with degree less than ``a`` and ``b`` respectively. The coefficients of ``c`` and ``d`` are indeterminates and thus the coefficients of the normalform of ``a * d - b * c`` are linear polynomials in these indeterminates. If these linear polynomials, considered as system of equations, have a nontrivial solution, then `\frac{a}{b} \equiv \frac{c}{d}` modulo the ideal generated by ``G``. So, by construction, the degree of ``c`` and ``d`` is less than the degree of ``a`` and ``b``, so a simpler representation has been found. After a simpler representation has been found, the algorithm tries to reduce the degree of the numerator and denominator and returns the result afterwards. As an extension, if quick=False, we look at all possible degrees such that the total degree is less than *or equal to* the best current solution. We retain a list of all solutions of minimal degree, and try to find the best one at the end. rr-z%s / %s: %s, %szc:%d)clszd:%dc3:K|]}||zVdSr/r$)r'r>CsM1s rr2z._ratsimpmodprime../::aBqEBqEM::::::r*c3:K|]}||zVdSr/r$)r'r>DsM2s rr2z._ratsimpmodprime..rFr*T)r&polys)r5 particularrc3"K|] }|dkV dS)rNr$)r'r6s rr2z._ratsimpmodprime..s&<._ratsimpmodprimehs:!1!!ANN$4$44  QJEEE!eunn1v JJ1v   1B1B $q!Rn 5 5 5#b'')u555B#b'')u555BbB:::::5R>>:::::CHrMKKE:::::5R>>:::::CHrMKKEE AI-q#(R-!it555568AQSX&&&--//A%27t4@@@C 3<z!ratsimpmodprime..s3QqTZZ\\):):S1=N=N)Nr*)key)convert)rr)sympy.solvers.solversr!rrrr rrjhas_assoc_Field get_fieldrsetr r5r&r rr8r:rTminis_Field clear_denomsrqp)rrgrrr5argsnumdenomrJrjr^r_r[newsolrdrer<rcrfcndnrrhr?r(r!r@ris `` @@@@@@rr"r"s=<,+++++ T""",,..JC,c5\A-=MMMMMM ss  ZF G%%''   > E5!R%2$e<<rs333333**********''''''YYYYYYYYYYYYYY88888888BBBBBBBB........!!!,+/5r*