sábado, 11 de abril de 2026

USM-style substitutions for radical equations

Introduction 

There is a tempting story one could tell about USM-style substitutions:
\[\text{radical equation} \longrightarrow \text{smart parameter} \longrightarrow \text{easy polynomial}.\]
That story is sometimes true. But when one solves the examples all the way to their actual real roots, a more precise picture emerges.

The Unified Substitution Method (USM) was developed for integration (see arXiv:2505.03754v2), not for equation solving. Still, the same branch-consistent parametrizations behind Transform 2, Transform 3, and Transform 5 give natural substitutions for equations involving
\[\sqrt{(x+b)^2-a^2}, \qquad \sqrt{(x+b)^2+a^2}, \qquad \sqrt{\frac{x+b-a}{x+b+a}}, \qquad \sqrt{a^2-(x+b)^2}, \qquad \sqrt{\frac{a+b+x}{a-b-x}}.\]

The real issue is not simply whether USM lowers the degree of the resulting polynomial. The deeper issue is whether the substitution keeps enough branch information so that, after solving the polynomial, one can still tell which roots correspond to genuine solutions of the original radical equation.

Repeated squaring usually loses sign information and therefore creates extraneous roots. A branchwise algebraic identity may keep more sign information than squaring and can sometimes outperform USM for a specially tailored problem. A USM parameter often encodes the geometry of the radical directly, so the admissible interval for the parameter itself filters out impossible roots.

The examples below make this explicit.

What USM is really good at

A USM-style substitution is strongest when one parameter rationalizes essentially all of the radicals at once.

For the circular difference case, the basic parameter is
\[x=\frac{a}{2}\left(t+\frac{1}{t}\right)-b,\]
which turns expressions of the form
\[\sqrt{(x+b)^2-a^2} \quad\text{and}\quad \sqrt{\frac{x+b-a}{x+b+a}}\]
into rational functions of \(t\). Here the admissible values of \(t\) depend on the real branch of the original equation: on the upper branch \(x\ge a-b\), one has \(0<t\le 1\), while on the lower branch \(x\le -a-b\), one has \(-1\le t<0\). Thus the parameter interval itself records which branch is being used.

For the hyperbolic sum case, the natural parameter is
\[s=\frac{x+b+\sqrt{(x+b)^2+a^2}}{a},\]
so that
\[x=\frac{a}{2}\left(s-\frac{1}{s}\right)-b, \qquad \sqrt{(x+b)^2+a^2}=\frac{a}{2}\left(s+\frac{1}{s}\right).\]
In this case the admissible parameter range is simply
\[s>0,\]
and the map \(s\mapsto x\) carries \((0,\infty)\) bijectively onto the full real line.

For the circular bounded case, one uses
\[x=\frac{2ar}{1+r^2}-b,\]
which turns
\[\sqrt{a^2-(x+b)^2} \quad\text{and}\quad \sqrt{\frac{a+b+x}{a-b-x}}\]
into rational functions of \(r\). Here the admissible parameter range is
\[-1\le r<1,\]
corresponding to the bounded real interval \(-a-b\le x<a-b\).

That is the best-case picture. The parameter respects the radical geometry instead of destroying it by squaring. But that does not mean it always wins.

Example 1 (difference form: USM is strong, but a tailored branch identity is even stronger)

Consider
\[\sqrt{x^2-1}-\sqrt{\frac{x-1}{x+1}}-2=0.\tag{E1}\]

The domain forced by the radicals is
\[x\in(-\infty,-1)\cup[1,\infty).\]
So the equation naturally splits into the two real branches \(x\ge 1\) and \(x < -1\).

Brute-force squaring

If one isolates a radical and squares twice, one reaches the sextic
\[x^6+2x^5-11x^4-20x^3+12x^2+48x+32=0.\]
It factors (and this could be tricky!) as
\[(x^3-x^2-4x-4)(x^3+3x^2-4x-8)=0.\]

Numerically, the real roots of this polynomial are
\[x\approx 2.875129794, \quad x\approx -3.489288572, \quad x\approx -1.289168546, \quad x\approx 1.778457118.\]
But the original radical equation does not accept all four. Direct substitution into \((E1)\) shows that only
\[\sqrt{x^2-1}-\sqrt{\frac{x-1}{x+1}}-2=0\quad\Longrightarrow\quad\left\{-3.489288572,\;2.875129794\right\},\]
are genuine solutions.

This is the basic weakness of repeated squaring: it removes the sign data carried by the radicals, so every real root of the polynomial must be checked back in the original equation.

The branchwise algebraic identity

Set
\[u:=\sqrt{\frac{x-1}{x+1}}\ge 0.\]
Because
\[\sqrt{x^2-1}=|x+1|\sqrt{\frac{x-1}{x+1}}=|x+1|\,u,\]
the original equation becomes branchwise simpler.

For the branch \(x\ge 1\), one has \(|x+1|=x+1\), so
\[(x+1)u-u-2=0 \quad\Longrightarrow\quad xu=2.\]
Since \(u\ge 0\) and \(x\ge 1\), the sign relation is already consistent. Squaring gives
\[x^2\frac{x-1}{x+1}=4 \quad\Longrightarrow\quad x^3-x^2-4x-4=0.\]
This cubic has one real root,
\[x\approx 2.875129794,\]
and it indeed satisfies \((E1)\).

For the branch \(x < -1\), one has \(|x+1|=-(x+1)\), so
\[-(x+1)u-u-2=0 \quad\Longrightarrow\quad (x+2)u=-2.\]
This relation is already informative \emph{before} squaring: since \(u\ge 0\), the left-hand side has the sign of \(x+2\). Therefore any valid solution on this branch must satisfy
\[x+2<0, \qquad\text{that is,}\qquad x<-2.\]
Now square:
\[(x+2)^2\frac{x-1}{x+1}=4 \quad\Longrightarrow\quad x^3+3x^2-4x-8=0.\]
This cubic has three real roots,
\[x\approx -3.489288572, \qquad x\approx -1.289168546, \qquad x\approx 1.778457118.\]
But the branch structure discards two of them immediately. The root \(x\approx 1.778457118\) is impossible because this branch assumes \(x\le -1\). The root \(x\approx -1.289168546\) is also impossible because then \(x+2>0\), so \((x+2)u\) cannot equal \(-2\). Thus the only valid root on the negative branch is
\[x\approx -3.489288572.\]

The USM route

Now use the circular difference-form parameter
\[x=\frac{1}{2}\left(t+\frac{1}{t}\right).\]
This is the Transform 2 geometry in unit radius.

For the branch \(x\ge 1\), take
\[t=x-\sqrt{x^2-1},\]
so that \(0<t\le 1\) and the map \(t\mapsto x=\frac12(t+t^{-1})\) sends \((0,1]\) monotonically onto \([1,\infty)\). The equation becomes
\[t^3+3t^2+5t-1=0.\]
This cubic has one real root,
\[t\approx 0.179509025,\]
which lies in \((0,1]\), so it is admissible. Converting back gives
\[x=\frac12\left(t+\frac1t\right)\approx 2.875129794.\]

For the branch \(x < -1\), take
\[t=x+\sqrt{x^2-1},\]
so that \(-1\le t<0\) and the same formula \(x=\frac12(t+t^{-1})\) maps \((-1,0)\) monotonically onto \((-\infty,-1)\). The equation becomes
\[t^3-t^2-7t-1=0.\]
Its real roots are approximately
\[t\approx -2.102775049, \qquad t\approx -0.146365489, \qquad t\approx 3.249140538.\]
But the parameter interval for this branch is \((-1,0)\), so only
\[t\approx -0.146365489\]
is admissible. Therefore
\[x=\frac12\left(t+\frac1t\right)\approx -3.489288572.\]

What this example proves

The full real solution set of \((E1)\) is therefore
\[\sqrt{x^2-1}-\sqrt{\frac{x-1}{x+1}}-2=0\quad\Longrightarrow\quad\left\{-3.489288572,\;2.875129794\right\}.\]

This example shows three different levels of structural control. Repeated squaring finds a polynomial but gives too many real roots. The special branchwise identity keeps more sign information and filters spurious roots very efficiently. USM keeps the branch information through the admissible interval for \(t\), so root validation is built into the parameter itself.

For this equation the honest ranking is
\[\text{special branchwise trick}\;>\;\text{USM}\;>\;\text{brute-force squaring}.\]

Example 2 (hyperbolic sum form: here the USM structure is genuinely better)

Now consider
\[\frac{1-\sqrt{x^2+1}}{x}=x-2, \qquad x\ne 0.\tag{E2}\]

The hyperbolic USM substitution

Set
\[s=x+\sqrt{x^2+1}.\]
Then \(s>0\) for every real \(x\), and
\[x=\frac{1}{2}\left(s-\frac{1}{s}\right), \qquad \sqrt{x^2+1}=\frac{1}{2}\left(s+\frac{1}{s}\right).\]
Substituting into \((E2)\) yields
\[s^3-s^2-7s-1=0.\]
The real roots of this cubic are
\[s\approx -2.102775049, \qquad s\approx -0.146365489, \qquad s\approx 3.249140538.\]
But the substitution itself imposes the structural condition
\[s>0.\]
So only
\[s\approx 3.249140538\]
can correspond to a real \(x\). Converting back gives
\[x=\frac12\left(s-\frac1s\right)\approx 1.470683420.\]
Direct substitution confirms that this is a genuine solution.

The classical squaring route

Starting from \((E2)\), multiply by \(x\) (allowed because \(x\ne 0\)):
\[1-\sqrt{x^2+1}=x^2-2x.\]
Hence
\[\sqrt{x^2+1}=1+2x-x^2.\]
Now the structure that matters is the sign constraint
\[1+2x-x^2\ge 0,\]
because the left-hand side is a square root. This forces
\[1-\sqrt2\le x\le 1+\sqrt2.\]
Only after recording that condition should one square:
\[(1+2x-x^2)^2=x^2+1.\]
After simplification,
\[x(x^3-4x^2+x+4)=0.\]
Since the original equation excludes \(x=0\), one solves
\[x^3-4x^2+x+4=0.\]
Its real roots are
\[x\approx -0.813606503, \qquad x\approx 1.470683420, \qquad x\approx 3.342923083.\]
Now the sign condition removes two of them immediately. The root \(x\approx -0.813606503\) fails because \(1+2x-x^2<0\). The root \(x\approx 3.342923083\) fails for the same reason. The root \(x\approx 1.470683420\) satisfies the sign condition and the original equation.

So the classical route also leads to the correct real solution set,
\[\frac{1-\sqrt{x^2+1}}{x}=x-2\quad\Longrightarrow\quad\left\{1.470683420\right\}.\]

Why the USM method is better here

In this example there is no special real factorization analogous to
\[x^2-1=(x-1)(x+1)\]
that would make a branchwise trick unusually efficient. The hyperbolic USM substitution keeps the intrinsic geometry of \(\sqrt{x^2+1}\) and provides a parameter with a built-in positivity condition \(s>0\). That single condition discards the two spurious cubic roots at once.

So here the honest ranking is
\[\text{USM}\;>\;\text{classical squaring}.\]
The reason is structural: the map \(s\mapsto x=\frac12(s-s^{-1})\) is a bijection from \((0,\infty)\) onto \(\mathbb{R}\), so an admissible positive root of the cubic corresponds to exactly one real solution of the original equation.

Example 3 (bounded circular form: USM again keeps the right branch data)

Now consider
\[\sqrt{1-x^2}-x^2\sqrt{\frac{1+x}{1-x}}=-1, \qquad -1\le x<1.\tag{E3}\]

This is naturally adapted to the bounded circular substitution.

The USM Transform 5 route

Set
\[r=\frac{x}{1+\sqrt{1-x^2}},\]
so that
\[x=\frac{2r}{1+r^2}, \qquad \sqrt{1-x^2}=\frac{1-r^2}{1+r^2}, \qquad \sqrt{\frac{1+x}{1-x}}=\frac{1+r}{1-r}.\]
For \(-1\le x<1\), this parameter satisfies
\[-1\le r<1.\]
Substituting into \((E3)\) gives
\[3r^3+r^2+r-1=0.\]
This cubic has one real root,
\[r\approx 0.469396425.\]
Since \(r\in[-1,1)\) automatically, the root is admissible. Therefore
\[x=\frac{2r}{1+r^2}\approx 0.769292354.\]
Direct substitution confirms that this solves \((E3)\).

The classical route and its sign filter

On the domain \(x<1\), one may rewrite
\[\sqrt{\frac{1+x}{1-x}}=\frac{\sqrt{1-x^2}}{1-x},\]
because \(1-x>0\). Then \((E3)\) becomes
\[\sqrt{1-x^2}\left(1-\frac{x^2}{1-x}\right)=-1,\]
that is,
\[\frac{1-x-x^2}{1-x}\sqrt{1-x^2}=-1.\]
Since \(1-x>0\) and \(\sqrt{1-x^2}\ge 0\), the left-hand side can be negative only if
\[1-x-x^2<0.\]
So before squaring one already learns that any genuine solution must satisfy
\[x>\frac{\sqrt5-1}{2}\approx 0.618033989,\]
because the other root of \(1-x-x^2=0\) lies below \(-1\) and is outside the domain.

Now square. After simplification one gets
\[x^6+2x^5-2x^4-4x^3+3x^2=0,\]
or equivalently
\[x^2(x-1)(x^3+3x^2+x-3)=0.\]
The real roots of this polynomial are
\[x=0, \qquad x=1, \qquad x\approx 0.769292354,\]
with \(x=0\) having multiplicity two in the factorization above and multiplicity three in the sextic.

Only one of these is a valid solution of \((E3)\). The root \(x=0\) is extraneous, since the original left-hand side becomes \(1\), not \(-1\). The root \(x=1\) is excluded by the domain and in any case makes \(\sqrt{\frac{1+x}{1-x}}\) blow up. The root \(x\approx 0.769292354\) satisfies the sign condition and the original equation.

Therefore the full real solution set is
\[\sqrt{1-x^2}-x^2\sqrt{\frac{1+x}{1-x}}=-1\quad\Longrightarrow\quad\left\{0.769292354\right\}.\]

Why USM helps

This example is exactly the kind of problem for which Transform 5 is designed: the same parameter rationalizes both \(\sqrt{1-x^2}\) and \(\sqrt{\frac{1+x}{1-x}}\). The admissible interval \(-1\le r<1\) keeps the bounded circular geometry visible all the way through the calculation.

By contrast, squaring destroys the sign information and inflates the algebra to a sextic before one can recover the correct solution set. So here the honest ranking is
\[\text{USM / bounded circular substitution}\;>\;\text{brute-force squaring}.\]

Final comparison (what each method tells you about correctness)

The examples above show that the real issue is not only how fast one reaches a polynomial, but how much \emph{admissibility information} survives after that step.

Repeated squaring is the least informative structurally. It often produces the right algebraic factors, but it forgets the sign relations that were originally carried by the radicals. Therefore it typically enlarges the candidate set and forces a final substitution check.

In the three examples above, squaring produced
\[\text{for \((E1)\): a sextic with four real candidates, of which only two are valid;}\]
\[\text{for \((E2)\): a cubic with three real candidates, of which only one is valid;}\]
\[\text{for \((E3)\): a sextic whose obvious real roots \(x=0\) and \(x=1\) are both extraneous.}\]

When a specially adapted identity exists, it can be even better than USM. In Example \((E1)\), the identity
\[\sqrt{x^2-1}=|x+1|\sqrt{\frac{x-1}{x+1}}\]
preserves the branch sign directly. That makes it possible to reject some extraneous roots \emph{before} solving the final cubic completely. But this advantage is highly problem-specific.

A USM parameter usually sits between those two extremes. It is more systematic than a lucky identity, and much more branch-aware than repeated squaring.

In Example \((E1)\), the branch intervals \(0<t\le 1\) and \(-1\le t<0\) immediately identify which cubic roots can represent real solutions. In Example \((E2)\), the condition \(s>0\) built into the hyperbolic substitution removes two extraneous cubic roots at once. In Example \((E3)\), the bounded interval \(-1\le r<1\) keeps the circular geometry visible and prevents the method from wandering into algebraically legal but geometrically impossible candidates.

So the real practical moral is this:
\[\text{A good substitution is not only a degree-lowering device; it is an admissibility-preserving device.}\]