I am solving 3 nonlinear equations for 3 variables: lambda_1, lambda_2, and lambda_3. I would expect these lambdas to be real and positive.
Instead of solving my original equations, which are convoluted and not in polynomial form, I try to solve for their numerators first (since their numerators are polynomials). Broadly speaking, such solutions should also solve the original non-polynomial system. More specifically, the solutions thus obtained may be a nontrivial superset of the solutions of the original system. They need to be verified, which should be a much much easier process than obtaining that superset. In the case at hand, my original system is rational functions, and thus the only thing that really needs to be verified is that the solutions do not make any of the original denominators zero.
1st question: How to actually implement such verification? In other words, how to verify that the polynomial solution that I obtain also solves the original non-polynomial system?
2nd question: As you can see from my attached script, I obtain one polynomial solution. How to analyze it? What can I say about its roots? In case there are an infinite number of roots, how can I pin down a closed-form, real, and positive expression of lambda_1, lambda_2, lambda_3 in terms of the four parameters gamma, p, sigma_e and sigma_v?*
*Please note that in SolveTools:-PolynomialSystem I set backsubstitute=false to favour compactness and computational efficiency (which means that I need to do the backsubstitution myself now - how to do it?).
**Perhaps is useful to know that gamma, sigma_e and sigma_v are all real and positive and that p is a real, positive number between 0 and 1 (it represents a probability).
Thanks a lot!