# Source dependency: weighted finite-algebra elimination This module is retained for exact reproduction of a general elimination theorem. The leading 27- and 29-variable specifications are in [active_elimination](../active_elimination/README.md). This directory specifies two polynomials with the same rational input projections as the verified guarded sources. All variable counts include the input. | Construction | Total variables | Degree bound | Coefficient bound | |:--|--:|:--|:--| | Sufficiently-large-parameter family | 27 | less than `2^151` | The sufficient parameter remains ineffective. | | Fixed exponent `L=137731` | 29 | less than `2^157` | at most `2^(2^168)` | The assertions that the projections equal the integers retain the source arithmetic hypotheses. The elimination theorem and bound calculations are unconditional algebraic statements. The family example in `weighted27` uses `L=137731` only to supply a concrete coefficient specification. That exponent is **not certified** to exceed the ineffective threshold for the 27-variable theorem. The 29-variable source has its own effective proof certifying the same numerical exponent. ## Polynomial specification For each separating element, form `H(V) = det(I - V M_(G lambda)) = sum a_k V^k`. For each `d=1,...,n`, let `H_d(V)=sum_(k=0)^d a_k V^k` and `g_d=Res(H_d,H_d')`, with Sylvester degrees `d,d-1`. The factor is `H_d(g_d U)^2 + sum_(k>d) a_k^2` for `d