martes, 14 de julio de 2026

Radical Integrals Made Easier: Five Families That Collapse into Laurent Polynomials

Introduction

The standard objective of a substitution involving a quadratic radical is rationalization. We replace the radical by a rational function of a new parameter and then hope that the resulting rational integral is manageable.

For several important classes of integrals, however, the Unified Substitution Method (USM) does something substantially stronger.

It does not merely produce a rational function. After the radical and the Jacobian interact, the transformed integrand becomes a finite Laurent polynomial:

\[L(p)=\sum_{k=m}^{N}c_kp^k,\]

where \(p\) is one of the USM parameters \(t\), \(r\), or \(s\).

Consequently,

\[\int L(p)\,dp = \sum_{\substack{k=m\\k\neq-1}}^{N} \frac{c_k}{k+1}p^{k+1} +c_{-1}\ln|p|+C.\]

There is no partial-fraction decomposition, no Hermite reduction, and no recursive trigonometric integration. The calculation is reduced to integrating powers of a single parameter.

This “Laurent collapse” can be viewed as the systematic principle already visible in Examples 4 and 6 of the public arXiv preprint A Unified Substitution Method for Integration (see arXiv:2505.03754v3). In those examples, a quotient radical collapses to a Laurent polynomial in \(t\), while a circular-radical integral collapses to one in \(r\). 


The parametrizations behind the collapse

Let

\[X=x+b,\qquad a>0.\]

The five families considered below arise primarily from the difference-radical and circular-radical transformations. A closely related Laurent mechanism also appears under Transform 3 for the sum radical.


The difference-radical parameter

On either exterior component \(X>a\) or \(X<-a\), let

\[R=\sqrt{X^2-a^2},\qquad \varepsilon=\operatorname{sgn}(X),\]

and set

\[t=\frac{X-\varepsilon R}{a}.\]

Then

\[X=\frac{a}{2}\left(t+t^{-1}\right),\]

\[R=-\varepsilon\frac{a}{2}\left(t-t^{-1}\right),\]

and

\[\,dx=\frac{a(t^2-1)}{2t^2}\,dt.\]

Thus \(0<t<1\) on the component \(X>a\), whereas \(-1<t<0\) on the component \(X<-a\). The formulas remain Laurent in \(t\), with the component-dependent sign carried by \(\varepsilon\).


The circular-radical parameter

For \(|X|<a\), set

\[r=\frac{X}{a+\sqrt{a^2-X^2}}.\]

Equivalently,

\[X=\frac{2ar}{1+r^2},\]

\[\sqrt{a^2-X^2} =a\frac{1-r^2}{1+r^2},\]

and

\[\,dx=2a\frac{1-r^2}{(1+r^2)^2}\,dr.\]

If \(X=a\sin\theta\) with the principal choice \(\theta=\sin^{-1}(X/a)\in(-\pi/2,\pi/2)\), then \(r=\tan(\theta/2)\), the classical tangent half-angle parameter.

The arXiv preprint explains how the corresponding USM transformations recover Euler's first and second substitutions, up to explicit sign, scaling, or reciprocal reparametrizations. Thus, the comparison below is not between unrelated methods: USM reorganizes the classical substitutions in a way that makes the cancellations easier to detect.


Transform 3: Laurent polynomials for the sum radical

The Laurent-polynomial phenomenon is not limited to the five families associated with Transforms 2 and 5. Transform 3 produces the same kind of algebraic simplification for integrals containing

\[\sqrt{X^2+a^2}.\]

Define

\[s=\frac{X+\sqrt{X^2+a^2}}{a}>0.\]

Then

\[X=\frac a2\left(s-s^{-1}\right),\]

\[\sqrt{X^2+a^2} =\frac a2\left(s+s^{-1}\right),\]

and

\[\,dx=\frac a2\left(1+s^{-2}\right)\,ds.\]

Each of the three fundamental quantities \(X\), \(\sqrt{X^2+a^2}\), and \(\,dx\) is therefore already a finite Laurent polynomial in \(s\).

It follows immediately that an expression of the form

\[Q\left(X,\sqrt{X^2+a^2}\right)\,dx,\]

where \(Q\) is a polynomial in its two arguments, becomes a finite Laurent polynomial in \(s\).

The same remains true for many integrands containing integer powers of

\[X+\sqrt{X^2+a^2}=as,\]

because multiplication or division by such a power merely introduces a Laurent monomial in \(s\).

For example, Example 3 of the arXiv preprint considers

\[\int_0^\infty \frac{\,dx}{\left(x+\sqrt{1+x^2}\right)^2}.\]

With

\[s=x+\sqrt{1+x^2},\]

we have

\[\,dx=\frac12(1+s^{-2})\,ds\]

and

\[\left(x+\sqrt{1+x^2}\right)^{-2}=s^{-2}.\]

Thus,

\[\int_0^\infty \frac{\,dx}{\left(x+\sqrt{1+x^2}\right)^2} = \frac12\int_1^\infty\left(s^{-2}+s^{-4}\right)\,ds = \frac23.\]

This is another Laurent collapse: the transformed integrand contains only two negative powers of \(s\).


Traditional comparison

The classical hyperbolic substitution

\[x=\sinh u\]

gives

\[x+\sqrt{1+x^2} =\sinh u+\cosh u =e^u.\]

The integral then becomes

\[\int_0^\infty e^{-2u}\cosh u\,du.\]

This is already manageable; a standard next step is to expand \(\cosh u\) into exponentials. Setting \(s=e^u\) then produces the same Laurent integral obtained directly by Transform 3.

Transform 3 therefore packages two classical steps,

\[x=\sinh u, \qquad s=e^u,\]

into the single algebraic parameter

\[s=x+\sqrt{1+x^2}.\]

Its advantage is not that hyperbolic substitution fails, but that the final Laurent structure is exposed from the beginning.


The five Laurent-polynomial families

The cancellation mechanism applies systematically to the following classes. Each statement is understood on a connected real component on which its integrand and substitution are defined.

For every polynomial \(P\), on either component \(X>a\) or \(X<-a\),

\[\int P(x)\sqrt{X^2-a^2}\,dx\]

becomes a finite Laurent polynomial in \(t\).

Indeed,

\[P(x) = P\left(\frac{a}{2}(t+t^{-1})-b\right)\]

is itself a Laurent polynomial, while

\[\sqrt{X^2-a^2}\,dx = -\varepsilon\frac{a^2}{4}t^{-3}(t^2-1)^2\,dt,\]

where

\[\varepsilon=\operatorname{sgn}(X)\]

is constant on the selected component.


Polynomial times a quotient radical

For every polynomial \(P\), on either component \(X>a\) or \(X<-a\),

\[\int P(x)\sqrt{\frac{X-a}{X+a}}\,dx\]

also becomes a finite Laurent polynomial in \(t\).

The decisive cancellation is

\[\sqrt{\frac{X-a}{X+a}}\,dx = -\frac a2(1-t^{-1})^2\,dt.\]

The linear factor \(1+t\) contributed by the denominator of the radical cancels a matching factor in the Jacobian.


Reciprocal powers divided by a circular radical

For every integer \(n\geq1\), on a connected component of \(0<|X|<a\),

\[\int\frac{\,dx}{X^n\sqrt{a^2-X^2}}\]

becomes

\[2^{1-n}a^{-n} \int r^{-n}(1+r^2)^{n-1}\,dr.\]

Because \(n-1\geq0\), the factor \((1+r^2)^{n-1}\) expands finitely.


A circular radical divided by reciprocal powers

For every integer \(n\geq3\), on a connected component of \(0<|X|<a\),

\[\int\frac{\sqrt{a^2-X^2}}{X^n}\,dx\]

becomes

\[2^{1-n}a^{2-n} \int r^{-n}(1-r^2)^2(1+r^2)^{n-3}\,dr.\]

The restriction \(n\geq3\) is exactly what prevents a residual denominator involving \(1+r^2\).


Reciprocal powers multiplied by a root ratio

For every integer \(n\geq2\), on a connected component of \(0<|X|<a\) and with principal square roots,

\[\int \frac1{X^n} \sqrt{\frac{a\pm X}{a\mp X}}\,dx\]

becomes

\[2^{1-n}a^{1-n} \int r^{-n}(1\pm r)^2(1+r^2)^{n-2}\,dr.\]

Once again, the exponent \(n-2\) is nonnegative, so the transformed expression is a finite Laurent polynomial.

These formulas show that the restrictions on \(n\) are structural rather than arbitrary: they are precisely the thresholds at which all remaining powers of \(1+r^2\) move into the numerator.


Five examples: USM versus the traditional routes

Example 1: A polynomial times a difference radical

Consider

\[I_1=\int x^2\sqrt{x^2-1}\,dx, \qquad x>1.\]

Set

\[t=x-\sqrt{x^2-1}.\]

Then

\[x=\frac12(t+t^{-1}),\]

and direct substitution gives

\[I_1 = \int\left( -\frac{t^3}{16} +\frac1{8t} -\frac1{16t^5} \right)\,dt.\]

The transformed integrand contains only three Laurent monomials. Therefore,

\[I_1 = -\frac{t^4}{64} +\frac18\ln t +\frac{t^{-4}}{64} +C.\]

Using

\[t^{-1}=x+\sqrt{x^2-1},\]

we obtain

\[\boxed{ I_1= \frac18\left[ x\sqrt{x^2-1}(2x^2-1) -\ln\left(x+\sqrt{x^2-1}\right) \right]+C }.\]


Traditional comparison

The hyperbolic substitution \(x=\cosh u\) produces

\[\int \cosh^2u\,\sinh^2u\,du,\]

which is commonly handled with multiple-angle identities before back-substitution.

The trigonometric substitution \(x=\sec\theta\) produces an integral involving \(\sec^3\theta\tan^2\theta\), normally handled through identities and reduction formulas.

Both methods are valid. The USM advantage is that the complete algebraic structure is exposed immediately: three powers of \(t\), integrated term by term.


Example 2: The quotient-radical cancellation

Consider the integral appearing as Example 4 in the arXiv preprint:

\[I_2=\int\sqrt{\frac{x+1}{x+3}}\,dx, \qquad x>-1.\]

Here

\[X=x+2, \qquad a=1,\]

so the USM parameter is

\[t=x+2-\sqrt{x^2+4x+3}.\]

The radical and Jacobian combine to give

\[I_2 = -\frac12\int\left(1-2t^{-1}+t^{-2}\right)\,dt.\]

Thus,

\[I_2 = -\frac t2+\ln t+\frac1{2t}+C.\]

Since

\[\frac1{2t}-\frac t2 =\sqrt{x^2+4x+3},\]

the result is

\[\boxed{ I_2= \sqrt{x^2+4x+3} +\ln\left(x+2-\sqrt{x^2+4x+3}\right)+C }.\]

The important feature is not merely that the integral is solvable. It is that the transformed integrand is already a Laurent polynomial.


Traditional comparison

The natural direct rationalization is

\[u=\sqrt{\frac{x+1}{x+3}}.\]

Solving for \(x\) and differentiating gives

\[I_2=\int\frac{4u^2}{(u^2-1)^2}\,du.\]

The radical has disappeared, but the price is a repeated quadratic denominator. A standard continuation uses partial fractions or introduces a second hyperbolic substitution.

The USM parameter packages both steps into one transformation:

\[-\frac12\left(1-2t^{-1}+t^{-2}\right).\]

Moreover, multiplying the original integrand by any polynomial \(P(x)\) preserves the Laurent form, because

\[x=\frac12(t+t^{-1})-2.\]

The direct \(u\)-substitution, by contrast, generally increases the degree of the rational denominator as the polynomial factor becomes more complicated.

This is the first seed of the general Laurent-polynomial phenomenon: Example 4 demonstrates the cancellation in one particular integral, while the corresponding family shows that it persists for every polynomial multiplier.


Example 3: Reciprocal powers and a circular radical

Now consider Example 6 from the arXiv preprint:

\[I_3=\int\frac{\,dx}{x^3\sqrt{4-x^2}}, \qquad 0<x<2.\]

Set

\[r=\frac{2-\sqrt{4-x^2}}{x} =\frac{x}{2+\sqrt{4-x^2}}.\]

Transform 5 gives

\[I_3 = \frac1{32}\int\left(r^{-3}+2r^{-1}+r\right)\,dr.\]

Therefore,

\[I_3 = -\frac1{64r^2} +\frac1{16}\ln r +\frac{r^2}{64} +C.\]

After combining the reciprocal powers,

\[\boxed{ I_3= \frac1{16}\left[ \ln\left(\frac{2-\sqrt{4-x^2}}{x}\right) -\frac{2\sqrt{4-x^2}}{x^2} \right]+C }.\]


Traditional comparison

The usual circular substitution

\[x=2\sin\theta\]

produces

\[I_3=\frac18\int\csc^3\theta\,d\theta.\]

That integral is standard and is commonly evaluated by a reduction formula or an integration-by-parts derivation, followed by the reconstruction of both \(\csc\theta\) and \(\cot\theta\) in terms of \(x\).

The USM route bypasses the reduction formula entirely. The radical and Jacobian cancel before integration, leaving exactly three Laurent monomials.

This is the second worked example in the arXiv preprint from which the general Laurent classification naturally emerges.


Example 4: A circular radical over a high reciprocal power

Consider

\[I_4=\int\frac{\sqrt{1-x^2}}{x^5}\,dx, \qquad 0<x<1.\]

Use

\[r=\frac{x}{1+\sqrt{1-x^2}}.\]

This is the fourth family with \(a=1\) and \(n=5\). The general formula gives

\[I_4 = \frac1{16}\int r^{-5}(1-r^2)^2(1+r^2)^2\,dr.\]

But

\[(1-r^2)^2(1+r^2)^2=(1-r^4)^2,\]

so

\[I_4 = \frac1{16}\int\left(r^{-5}-2r^{-1}+r^3\right)\,dr.\]

Hence

\[I_4 = \frac{r^4-r^{-4}}{64} -\frac18\ln r+C.\]

Returning to \(x\),

\[\boxed{ I_4= \frac18\left[ \ln\left(\frac{1+\sqrt{1-x^2}}{x}\right) -\frac{(2-x^2)\sqrt{1-x^2}}{x^4} \right]+C }.\]


Traditional comparison

With \(x=\sin\theta\), one obtains

\[I_4 = \int\frac{\cos^2\theta}{\sin^5\theta}\,d\theta = \int\left(\csc^5\theta-\csc^3\theta\right)\,d\theta.\]

A standard evaluation uses reduction formulas for two odd powers of \(\csc\theta\). It is entirely feasible, but the method treats the integral as a trigonometric-reduction problem.

USM instead detects the algebraic factorization

\[r^{-5}-2r^{-1}+r^3\]

automatically. The same pattern persists for every \(n\geq3\); increasing \(n\) merely enlarges a finite binomial expansion.


Example 5: Reciprocal powers times a root ratio

Consider

\[I_5= \int\frac1{x^3}\sqrt{\frac{1+x}{1-x}}\,dx, \qquad 0<x<1.\]

Again set

\[r=\frac{x}{1+\sqrt{1-x^2}}.\]

Because

\[\sqrt{\frac{1+x}{1-x}} =\frac{1+r}{1-r},\]

the fifth Laurent family gives

\[I_5 = \frac14\int r^{-3}(1+r)^2(1+r^2)\,dr.\]

Expanding,

\[I_5 = \frac14\int\left(r^{-3}+2r^{-2}+2r^{-1}+2+r\right)\,dr.\]

Thus,

\[I_5 = -\frac1{8r^2} -\frac1{2r} +\frac12\ln r +\frac r2 +\frac{r^2}{8} +C.\]

Combining reciprocal pairs gives

\[\boxed{ I_5= -\frac{\sqrt{1-x^2}}{2x^2} -\frac{\sqrt{1-x^2}}{x} +\frac12\ln\left(\frac{x}{1+\sqrt{1-x^2}}\right)+C }.\]

The conjugate family

\[\frac1{x^n}\sqrt{\frac{1-x}{1+x}}\]

is handled identically, with \((1+r)^2\) replaced by \((1-r)^2\).


Traditional comparison

The substitution \(x=\sin\theta\) gives

\[\sqrt{\frac{1+\sin\theta}{1-\sin\theta}} =\frac{1+\sin\theta}{\cos\theta}\]

on the relevant component. Consequently,

\[I_5 = \int\left(\csc^3\theta+\csc^2\theta\right)\,d\theta.\]

A standard evaluation combines the odd-cosecant reduction formula with a separate elementary integration of \(\csc^2\theta\).

USM reaches the same trigonometric half-angle parameter without first converting the problem into trigonometric notation. More importantly, it reveals immediately that the entire class for \(n\geq2\) is Laurent-polynomial after substitution.

Compressing \(t^n\pm t^{-n}\): the binomial difference and sum formulas

Let \(n\in\mathbb N\) and \(y\in(-\infty,-1]\cup[1,\infty)\). Termwise integration often produces reciprocal pairs such as

\[t^n-t^{-n} \qquad\text{and}\qquad t^n+t^{-n}.\]

Let

\[w=\sqrt{y^2-1}.\]

For \(y\geq1\), one has \(t=y-w\) and \(t^{-1}=y+w\); for \(y\leq-1\), these two reciprocal roots exchange roles. Treating the two roots as an unordered pair avoids unnecessary expression swell.

Indeed,

\[(y-w)(y+w)=1,\]

so

\[\{y-w,y+w\}=\{t,t^{-1}\}.\]

Define

\[D_n(y)=(y-w)^n-(y+w)^n.\]

By the binomial theorem, all even powers of \(w\) cancel, leaving only the odd terms:

\[D_n(y) = -2\sum_{j=0}^{\lfloor(n-1)/2\rfloor} \binom{n}{2j+1} y^{n-2j-1}w^{2j+1}.\]

Since

\[w^{2j+1}=(y^2-1)^jw,\]

this may also be written as

\[D_n(y) = -2\sqrt{y^2-1} \sum_{j=0}^{\lfloor(n-1)/2\rfloor} \binom{n}{2j+1} y^{n-2j-1}(y^2-1)^j.\]

For the USM parameter chosen as the small root on both exterior components,

\[t= \begin{cases} y-\sqrt{y^2-1},&y\geq1,\\[4pt] y+\sqrt{y^2-1},&y\leq-1, \end{cases}\]

the result is

\[t^n-t^{-n}=\sigma D_n(y),\]

where

\[\sigma= \begin{cases} 1,&y\geq1,\\ -1,&y\leq-1. \end{cases}\]

The factor \(\sigma\) is essential: the roles of \(y-w\) and \(y+w\) are interchanged on the negative exterior component.

The first few identities are

\[D_1(y)=-2\sqrt{y^2-1},\]

\[D_2(y)=-4y\sqrt{y^2-1},\]

\[D_3(y)=-2(4y^2-1)\sqrt{y^2-1},\]

and

\[D_4(y)=-8y(2y^2-1)\sqrt{y^2-1}.\]

There is an equally useful companion formula for the sum. Define

\[S_n(y)=(y-w)^n+(y+w)^n.\]

The odd powers now cancel, giving

\[S_n(y) = 2\sum_{j=0}^{\lfloor n/2\rfloor} \binom{n}{2j} y^{n-2j}w^{2j},\]

or

\[S_n(y) = 2\sum_{j=0}^{\lfloor n/2\rfloor} \binom{n}{2j} y^{n-2j}(y^2-1)^j.\]

Unlike the difference, the sum is unchanged when the two reciprocal roots are interchanged. Therefore,

\[t^n+t^{-n}=S_n(y)\]

on both exterior components, with no additional sign factor. Equivalently, in terms of the Chebyshev polynomials \(T_n\) and \(U_{n-1}\),

\[S_n(y)=2T_n(y),\qquad D_n(y)=-2\sqrt{y^2-1}\,U_{n-1}(y).\]

For example,

\[t^2+t^{-2}=4y^2-2,\]

and

\[t^4+t^{-4}=16y^4-16y^2+2.\]

These formulas shorten the final back-substitution substantially. In Example 1, the Laurent primitive contains

\[\frac{t^{-4}-t^4}{64}.\]

For \(x>1\), the difference formula gives

\[t^4-t^{-4} =-8x(2x^2-1)\sqrt{x^2-1}.\]

Hence

\[\frac{t^{-4}-t^4}{64} = \frac18x(2x^2-1)\sqrt{x^2-1},\]

which recovers the algebraic part of the antiderivative in one step.

The arXiv preprint explicitly presents the binomial-difference identity as a device for simplifying terms of the form \(t^n-t^{-n}\) during back-substitution (see arXiv:2505.03754v3).


Why Laurent polynomials are better than general rational functions

The difference is computationally meaningful.

A general rational function

\[\frac{A(p)}{B(p)}\]

may require factorization of \(B\), polynomial division, repeated-factor decomposition, irreducible quadratic terms, or Hermite reduction.

A Laurent polynomial

\[\sum c_kp^k\]

requires none of these operations. Its integration complexity is visible at inspection:

• every exponent except \(-1\) produces another power;

• the exponent \(-1\) produces a logarithm;

• no new algebraic denominator is introduced;

• the number of terms is controlled by finite polynomial or binomial expansions.

There is also an advantage during back-substitution. Positive and negative powers often occur in pairs such as

\[t^m-t^{-m} \qquad\text{or}\qquad t^m+t^{-m}.\]

The binomial difference and sum formulas convert these pairs directly into expressions involving \(y\) and \(\sqrt{y^2-1}\). This avoids separately expanding two large reciprocal powers and then simplifying the result.

That is why the final answers in the examples above can be written using only the original radical and one logarithm, despite passing through several Laurent powers.


What USM is—and is not—claiming

The Laurent-polynomial property is a precise structural statement. For the stated families and domain restrictions, the transformed integrand has a finite Laurent expansion.

It does \emph{not} imply that every individual integral will have a shorter final antiderivative than every classical derivation. For small exponents, a familiar trigonometric substitution may be equally short. Nor does it constitute a universal theorem about computer-algebra performance.

The real advantage is systematic predictability:

1. the appropriate parameter is selected from the radical geometry;

2. the branch and real component are stated explicitly;

3. cancellation occurs before integration;

4. the resulting integral is termwise;

5. reciprocal powers can be recombined before back-substitution;

6. the procedure scales uniformly with \(P(x)\) or \(n\).

Traditional substitutions usually teach these examples as separate categories: Euler substitutions for difference radicals, circular substitutions for \(\sqrt{a^2-x^2}\), hyperbolic substitutions for \(\sqrt{x^2+a^2}\), half-angle identities for root ratios, and reduction formulas for powers of secant or cosecant.

USM shows that they are manifestations of a common algebraic mechanism.


Final perspective

Examples 4 and 6 of the arXiv preprint display two striking simplifications:

\[\sqrt{\frac{x+1}{x+3}}\,dx \quad\longrightarrow\quad -\frac12\left(1-2t^{-1}+t^{-2}\right)\,dt,\]

and

\[\frac{\,dx}{x^3\sqrt{4-x^2}} \quad\longrightarrow\quad \frac1{32}\left(r^{-3}+2r^{-1}+r\right)\,dr.\]

Transform 3 supplies a parallel sum-radical example:

\[\frac{1}{\left(x+\sqrt{1+x^2}\right)^2}\,dx \quad\longrightarrow\quad \frac12\left(s^{-2}+s^{-4}\right)\,ds.\]

The five systematic families explain the deeper pattern behind the first two examples, while Transform 3 shows that the Laurent principle extends naturally beyond those families.

The best substitution does not merely remove the radical. It makes the radical, the powers of the centered variable, and the Jacobian simplify one another before the integration begins.

Once the integration has been performed, the binomial difference and sum formulas complete the process by compressing reciprocal pairs such as

\[t^n\pm t^{-n}\]

directly into the original variable and radical.

For these classes, USM moves the problem beyond rationalization. What initially appears to be a radical integral becomes finite arithmetic with powers—and, at worst, one logarithm.


Reference

Emmanuel Antonio José García, A Unified Substitution Method for Integration, arXiv:2505.03754v3 [math.GM], revised May 23, 2026.

En memoria del Dr. Paolo Lugano Poletti

No llores porque ya se terminó, sonríe porque sucedió. ~ Gabriel García Márquez.

En 2013 acababa de graduarme de ingeniero civil. Como les ocurre a tantos jóvenes que no cuentan con un padrino, contactos profesionales o influencias, el panorama laboral que encontré al salir de la universidad fue profundamente desalentador.

Pasé por grandes decepciones. No conseguía empleo en mi área y muchos de los amigos que ya estaban trabajando comenzaron a mostrarse distantes. Incluso encontrar un puesto como recepcionista en un hotel se había convertido en una proeza. También intenté conseguir trabajo en centros de llamadas en inglés, pero tampoco tuve éxito.

La desesperanza llegó a ser tan grande que, durante aquella época, llegué a pensar en quitarme la vida. El futuro que vislumbraba parecía no ofrecerme ninguna salida.

A mi alrededor escuchaba historias de personas que habían conseguido empleos mediante favores políticos, pagos o influencias. También se hablaba de jóvenes que habían tenido que aceptar situaciones humillantes o indignas para acceder a una oportunidad laboral. Todo aquello hacía que el panorama resultara todavía más frustrante para alguien que había dedicado años a estudiar y que esperaba que su preparación fuera suficiente para abrirse camino.

Sin embargo, mientras buscaba trabajo, encontré refugio en las matemáticas.

Gracias a mi participación en grupos de geometría, muchos de ellos integrados por matemáticos asiáticos, comencé a sentir una verdadera obsesión por esta disciplina. Estudiaba constantemente, resolvía problemas y poco a poco fui adquiriendo experiencia. Llegó un momento en que empecé a producir y publicar mis propios descubrimientos.

En 2014 descubrí mi propia colección de círculos de Arquímedes (mira aquí, aquí, aquí y aquí) . El trabajo llegó a recibir atención de la prensa nacional y fue reseñado por Diario Libre. A pesar de aquello, yo continuaba desempleado.

Entonces decidí enviarle mis investigaciones al Dr. Paolo Lugano Poletti, quien había sido profesor mío. Sabía que tenía un doctorado y pensé que quizá podría comprender y apreciar el valor de lo que estaba haciendo. Tuve que ingeniármelas para hacerle llegar el trabajo, pero finalmente lo conseguí.

Unos días después recibí una llamada suya.

Me dijo que en la Universidad O&M necesitaban personas como yo. Gracias a esa llamada conseguí mi primer empleo como profesor de Cálculo Diferencial e Integral

En aquel momento ganaba muy poco dinero, una cantidad insuficiente para independizarme. Vivía en una habitación en casa de mi madrina y sabía que disponía de un tiempo limitado para encontrar mi propia vivienda. Aunque estaba agradecido por tener trabajo, continuaba preocupado por mi situación económica.

Entonces, una vez más, el Dr. Lugano Poletti intervino en mi vida.

De manera casi milagrosa, consiguió para mí otro trabajo como profesor de secundaria en el CEDI Bilingual School. A partir de ese momento, mi vida comenzó a cambiar. Por primera vez sentí que estaba recogiendo los frutos de todos los años que había dedicado al estudio. Volví a sentir esperanza. Puedo decir que fui feliz y que viví aquellos años con una enorme satisfacción.

Con el paso del tiempo continué investigando. Llegué a publicar trabajos en revistas internacionales como Forum Geometricorum, así como en publicaciones de la Mathematical Association of America, entre ellas The College Mathematics Journal y Mathematics Magazine. Algunos de mis descubrimientos fueron publicados en sus páginas y, en el caso de The College Mathematics Journal, uno de mis trabajos llegó incluso a ocupar la portada de la revista.

En 2022 logré generalizar una fórmula de Newton. Los medios de comunicación se hicieron eco de aquel resultado y, nuevamente, el Dr. Paolo Lugano Poletti encontró la manera de apoyarme. Consiguió para mí una ayuda económica destinada a subvencionar mis investigaciones.

No era una gran cantidad de dinero, pero para mí significaba muchísimo: por primera vez estaban pagándome por hacer aquello que verdaderamente me apasionaba.

Creo que nadie, absolutamente nadie, mostró tanto interés por mis investigaciones y por mi persona como el doctor Paolo Lugano Poletti. Y lo más extraordinario es que me ofreció aquella primera oportunidad cuando todavía no éramos amigos. No tenía ninguna obligación de ayudarme. Simplemente vio algo en mí y decidió tenderme la mano cuando más lo necesitaba.

Ayer, el Dr. Paolo Lugano Poletti falleció.

Al recibir la noticia no pude evitar llorar. Recordé cada una de las oportunidades que me brindó, cada gesto de generosidad y cada ocasión en la que confió en mí cuando mi propio futuro parecía incierto.

Hay personas que transforman nuestra vida mediante grandes discursos. Otras lo hacen con una sola llamada, una recomendación o una oportunidad ofrecida en el momento preciso. El Dr. Lugano Poletti hizo todo eso por mí. Su confianza cambió el rumbo de mi existencia.

Dondequiera que estés, quiero que sepas que reconozco lo grande que fuiste, la inmensa generosidad que demostraste y la extraordinaria persona que siempre fuiste.

Gracias por haber creído en mí.

Gracias por haberme ayudado cuando más lo necesitaba.

Gracias por haber valorado mi trabajo y mis sueños.

Descansa en paz, querido amigo, estimado colega y eterno maestro.

miércoles, 8 de julio de 2026

Benchmarking the USM Against Mathematica Integrate, Part 3

This report compares the Unified Substitution Method (USM) with Mathematica’s native `Integrate` function across five families of integrals involving quadratic radicals, circular and hyperbolic substitutions, and trigonometric half-angle structures. For each transform family, the report includes the Wolfram benchmark code, timing data, expression-size measurements, derivative-based verification tests, and commentary on timeouts, unevaluated outputs, branch behavior, and expression swell.

The strongest result appears in Transform 1, where, on the six cases solved by both methods, Mathematica was about 194× slower in cold timing, 380× slower in warm timing, and produced closed-form outputs roughly 753× larger by byte count. In aggregate, USM produced 95 non-timeout antiderivatives out of 100 examples, with 94 fully verified, while Mathematica produced closed outputs for only 6 of the 10 paired examples; those native closed outputs averaged about 4.45 MB, compared with roughly 4.6 KB for USM. 

The report also highlights several complementary performance patterns. Transform 2 demonstrates coverage and predictability: USM solved and verified 100/100 examples, while Mathematica closed only 4/10 paired examples, with additional timeouts and unevaluated integrals.  Transform 4 gives another strong expression-swell result: USM solved and verified 20/20 examples, while Mathematica closed 6/10, and on the mutually closed subset Mathematica was about 110× slower cold, 129× slower warm, and produced outputs more than 100× larger on average. 

Overall, the benchmarks show that the USM framework is especially effective when direct Mathematica integration leads to timeouts, unevaluated integrals, or very large antiderivative expressions. At the same time, the report documents cases where Mathematica remains competitive, particularly in the simpler hyperbolic radical family of Transform 3 and in some successfully closed Transform 5 examples. This makes the comparison useful as a technical benchmark reference rather than a one-sided performance claim. Across the five families, USM solved and verified all examples in Transforms 2–5, and nearly all of Transform 1, supporting the claim that USM converts the targeted radical and half-angle families into stable rational-in-parameter integrations with improved coverage, predictability, and, in several cases, substantial suppression of expression swell. 

miércoles, 10 de junio de 2026

Un problema de Igor Volzhin

Problema. Sea $\Gamma$ una circunferencia de centro $O$ y radio $R$. Desde un punto exterior $P$ se trazan las dos tangentes a $\Gamma$, que la tocan en los puntos $X$ e $Y$, siendo $X$ el punto de tangencia superior e $Y$ el punto de tangencia inferior. Sea $Q$ el primer punto de intersección de la recta $PO$ con la circunferencia $\Gamma$, al recorrer dicha recta desde $P$ hacia $O$. Se sabe que $QX=a$. La recta $XQ$ corta al segmento $PY$ en un punto $Z$ tal que $QZ=b$. Demuestre que el radio $R$ de la circunferencia puede expresarse en función de $a$ y $b$ mediante la fórmula

$$R=\frac{a\sqrt{b}}{\sqrt{3b-a}}.$$


Demostración. Note que $PQ$ es la bisectriz de $\angle{XPY}$. Por lo tanto, usando la fórmula para la longitud de la bisectriz en el triángulo $XPZ$, tenemos:

$$PQ^2=\frac{PX\cdot{PZ}}{(PX+PZ)^2}\left[(PX+PZ)^2-(a+b)^2\right].\tag{1}$$

Por el teorema de la bisectriz tambien tenemos que 
$$\frac{a}{b}=\frac{PX}{PZ} \Longrightarrow PZ=\frac{b}{a}PX.\tag{2}$$

Consecuentemente, 

$$YZ=PY-PZ=PX-\frac{b}{a}PX=PX\left(\frac{a-b}{a}\right).\tag{3}$$

Por potencia de un punto $YZ^2=ZQ\cdot{ZX}$. Sustituyendo, obtenemos 

$$PX^2\left(\frac{a-b}{a}\right)^2=b(a+b) \Longrightarrow PX^2=\frac{a^2b(a+b)}{(a-b)^2}.\tag{4}$$

Sustituyendo $(2)$ en $(1)$, simplificando y luego sustituyendo $(4)$ en $(1)$, 

$$PQ^2=\frac{ab^2(a+b)}{(a-b)^2}-ab=\frac{a^2b(3b-a)}{(a-b)^2}.\tag{5}$$

Nuevamente, por potencia de un punto, 

$$PX^2=PQ(PQ+2R) \Longrightarrow R=\frac{PX^2-PQ^2}{2PQ}.\tag{6}$$

Sustituyendo $(4)$ y $(5)$ en $(6)$ y simplificando, obtenemos

$$\boxed{R=\frac{a\sqrt{b}}{\sqrt{3b-a}}.}$$

Por la configuración, $b<a$ y necesariamente $3b>a$, de modo que la raíz de $3b−a$ tiene sentido.

martes, 5 de mayo de 2026

Constructing an Equal-Area Triangle from a Quadrilateral

Claim. Let $ABCD$ be a convex quadrilateral, and let $O$ be an arbitrary point in the plane. Let $M$ and $N$ be the midpoints of $BO$ and $CO$, respectively. Let $A'$ be the reflection of $A$ about $N$, and let $D'$ be the reflection of $D$ about $M$. Then

$$[ABCD]=[A'D'O].$$

The area of quadrilateral ABCD is equal to the area of triangle A'D'O.

Proof. Let the diagonals $AC$ and $BD$ meet at $P$. Since $N$ is the midpoint of both $CO$ and $AA'$, the half-turn about $N$ sends $A$ to $A'$ and $C$ to $O$. Hence

$$A'O=AC \qquad \text{and} \qquad A'O \parallel AC.$$

Similarly, since $M$ is the midpoint of both $BO$ and $DD'$, the half-turn about $M$ sends $D$ to $D'$ and $B$ to $O$. Therefore

$$D'O=BD \qquad \text{and} \qquad D'O \parallel BD.$$

Let

$$\theta=\angle BPC,$$

the angle between the diagonals $BD$ and $AC$. Since $A'O \parallel AC$ and $D'O \parallel BD$, we have

$$\sin \angle A'OD'=\sin \theta.$$

Thus

$$[A'D'O]=\frac12 \cdot A'O \cdot D'O \cdot \sin \angle A'OD'=\frac12 \cdot AC \cdot BD \cdot \sin \theta.$$

On the other hand, the area of a convex quadrilateral is equal to one half the product of its diagonals times the sine of the angle between them. Hence

$$[ABCD]=\frac12 \cdot AC \cdot BD \cdot \sin \theta.$$

Therefore,

$$[A'D'O]=[ABCD],$$

as desired.

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.}\]

miércoles, 28 de enero de 2026

Carta abierta al Presidente Abinader: Un método dominicano para el Cálculo Integral

Santo Domingo, 28 de Enero del 2026

Señor

Luis Rodolfo Abinader Corona

Presidente de la República Dominicana

C.c.: Directores y redactores de los principales medios de comunicación nacionales e internacionales

De mi consideración:

Me dirijo a usted y, por su intermedio, a los medios de comunicación del país para comunicar un avance científico que considero de interés nacional y para solicitar el apoyo institucional necesario para que la República Dominicana aproveche y difunda esta aportación.

Soy Emmanuel Antonio José García. He publicado recientemente en arXiv (Cornell) el trabajo “A Unified Substitution Method for Integration” (enlace: https://arxiv.org/abs/2505.03754), en el que presento el Método de Sustitución Unificada (USM), una propuesta matemática y metodológica destinada a simplificar y acelerar la resolución de integrales que aparecen de manera frecuente en matemáticas aplicadas, ingeniería, física y ciencias de datos.

Resumen de la contribución

El USM es un método unificado para integrar expresiones con radicales cuadráticos y composiciones trigonométricas de medio ángulo, fundamentado en identidades algebraicas explícitas para las exponenciales de funciones trigonométricas inversas principales $e^{± i \cos^{-1}(y)}$ y $e^{± i \sec^{-1}(y)}$, lo que permite derivar cinco transformaciones parametrizadas que convierten dichas integrales en formas racionales en un solo parámetro, manejando de manera coherente tanto los casos circulares como hiperbólicos. Este marco no solo subsume y generaliza técnicas clásicas, como las sustituciones de Euler (primera y segunda) y la sustitución de Weierstrass, sino que también simplifica significativamente el manejo de ramas y signos, ofrece ventajas computacionales al reducir la hinchazón de expresiones y mejora la eficiencia en la integración de estructuras mixtas.

Resultados comparativos relevantes

Para ofrecer evidencia empírica, ejecuté un benchmark con 100 integrales representativas y comparé el rendimiento del USM con la función `Integrate` de Mathematica:

  • USM fue más rápido en 82 de 100 casos.
  • USM produjo una antiderivada de menor tamaño (ByteCnt) en 50 de 100 casos.
  • Incidencia de antiderivadas “monstruo” (≥ 10.000 bytes): USM: 5 casos vs Integrate: 24 casos.
  • Máximo tamaño observado: USM: 19,840 bytes; Integrate: 150,360 bytes. En otro mini-benchmark (Ejemplo 19), el recuento de bytes de Integrate superó los 600,000 (¡la antiderivada ocupa 20 páginas!), mientras que para USM no superó los 5,000 (y la antiderivada cabe en media página).

Estos resultados se traducen en dos beneficios prácticos: ahorro de tiempo de cómputo y expresiones simbólicas más legibles y reutilizables, lo que facilita su integración en pipelines de ingeniería y en material educativo avanzado.

Vinculaciones teóricas del USM

El USM está estrechamente relacionado con conceptos matemáticos de gran utilidad. Como señaló el físico alemán Fred Hucht en MathOverflow (foro donde di a conocer la primera versión del USM): 

“The OP's relations are related to the Gudermannian...", 

lo que lo conecta con identidades elípticas y la Transformación Imaginaria de Jacobi”. La Gudermanniana es fundamental en aplicaciones como la proyección cartográfica de Mercator, mientras que la estructura paramétrica del USM se asemeja a la Transformada de Joukowsky (clave en aerodinámica para el diseño de perfiles alares) y a la Transformada de Tustin, usada en control digital para discretizar sistemas dinámicos. 

Reconocimientos y revisiones externas

El trabajo ha suscitado interés y comentarios de especialistas con trayectoria internacional:

Dr. Mohammad Alkousa (Profesor, autor de libros de cálculo e investigador vinculado al Moscow Institute of Physics and Technology - MIPT, institución conocida como el "MIT de Rusia"):

“You have done great work. I will review it and will cite your work as a reference in my calculus books. I will also mention it to my students.” (Has hecho un gran trabajo. Lo revisaré y citaré tu trabajo como referencia en mis libros de cálculo. También se lo mencionaré a mis estudiantes.)

 Relevancia: Esta validación marca un hito. Que un experto de una de las instituciones STEM más prestigiosas del mundo (el MIPT cuenta con 10 premios Nobel entre sus profesores y exalumnos) integre este método en la literatura académica confirma su superioridad pedagógica y su innegable solidez matemática.

Dr. Oleg Marichev (Wolfram Research, figura legendaria de la integración simbólica):

“I was impressed, looking on your files. I saw holes in my work, that you already found and you can fix them (even without understanding many moments). I felt that we can work.” (Quedé impresionado al ver tus archivos. Vi vacíos en mi trabajo que ya encontraste y que puedes arreglar (incluso sin entender muchos momentos). Sentí que podemos trabajar juntos.)

“You made large improvement to collecting formulas for doable Integrate situation because we with you found wide class of cases for MeijerG.” (Hiciste una gran mejora en la recopilación de fórmulas para situaciones de integración realizables, porque junto contigo encontramos una amplia clase de casos para MeijerG.)

“As I wrote, I have built collection with near 4500 cases of MeijerG. If we remove special functions we have subset of such elementary functions. There we have subset of algebraic functions. I am doing re-organization of this collection and see how important and how large subclass Fun[v ArcGun[z]]^n that you found.” (Como escribí, he construido una colección con cerca de 4500 casos de MeijerG. Si eliminamos las funciones especiales, tenemos un subconjunto de dichas funciones elementales. Allí tenemos un subconjunto de funciones algebraicas. Estoy reorganizando esta colección y veo lo importante y grande que es la subclase Fun[v ArcGun[z]]^n que encontraste.)

Dr. Sam Blake (PhD, Univ. Monash, investigador; ex-ingeniero en Wolfram Research y conocido por su participación en el descifrado del célebre Zodiac Cipher):

“That’s a very neat trick… As far as I know this is a new result.” (Ese es un truco muy ingenioso... Por lo que sé, este es un resultado nuevo.)

Daniel Lichtblau (Wolfram Research):

“You are certainly getting nice results, and we'll take a look at it.” (Ciertamente estás obteniendo buenos resultados, y le echaremos un vistazo.)

Ninad Munshi (ex-ingeniero de la NASA):

“Complexification formulas are great and it seems like this simplifies the right away.” (Las fórmulas de complejificación son geniales y parece que esto simplifica de inmediato.)

Kamila Szewczyk (programadora e investigadora matemática polaca especializada en bioinformática y algoritmos de compresión, reconocida principalmente por ser la creadora del compresor de datos de código abierto bzip3):

“One benefit of your method that I see over Rubi is that the process of applying transformation rules in USM is much clearer and more efficient to evaluate (no need to rely on transformation heuristics).” (Un beneficio de tu método que veo sobre Rubi es que el proceso de aplicar reglas de transformación en USM es mucho más claro y eficiente de evaluar (sin necesidad de depender de heurísticas de transformación).)

Dr. Miljenko Lapaine (Profesor emérito de la Universidad de Zagreb, experto en cartografía matemática y proyecciones cartográficas; Honorary Fellow y ex-presidente de la Comisión de Proyecciones Cartográficas de la International Cartographic Association - ICA):

“I think that everything is nicely explained and that your method of substitution is a valuable new contribution to integration.” (Creo que todo está muy bien explicado y que tu método de sustitución es una valiosa nueva contribución a la integración.)

Importancia histórica y cultural de la integración


     


La integración no es solo una técnica matemática: es una herramienta que ha modelado el progreso científico. Lo subrayan objetos culturales oficiales (una moneda conmemorativa vinculada a la técnica de integración de Ostrogradski y una estampa postal que honra a P. L. Chebyshev) que evidencian cómo los estados y las comunidades científicas reconocen la integración como patrimonio intelectual y cultural.



Por qué esto importa para la República Dominicana

1. Innovación descentralizada: que una contribución en un área clásica como el Cálculo Integral provenga de un ingeniero dominicano demuestra que nuestro país puede generar conocimiento original en áreas matemáticas de alto impacto.

2. Aplicaciones tecnológicas: la reducción de tiempos de cómputo y la menor proliferación de expresiones simbólicas gigantescas beneficiarán desarrollos en software.

3. Potencial educativo: incorporar una metodología unificada podría simplificar la enseñanza del Cálculo Integral en bachillerato y universidad, privilegiando la comprensión sobre la memorización.

Solicitudes concretas 

Con respeto, solicito al señor Presidente y a las autoridades competentes las siguientes acciones:

1. Reconocimiento institucional y difusión oficial. Que la Presidencia y el Ministerio correspondiente (MESCYT / instituciones científicas nacionales) respalden la difusión del hallazgo y promuevan su consideración en foros académicos y tecnológicos.

2. Divulgación mediática responsable. Invito a los medios a cubrir el trabajo con rigor, entrevistando a expertos y verificando las cifras y resultados, para que el país conozca y evalúe la importancia del avance.

Ofrezco mi compromiso de colaborar estrechamente con las instituciones que lo soliciten: puedo presentar los datos del benchmark y entregar material didáctico (apuntes, ejemplos resueltos y código). 

Creo firmemente que las matemáticas pueden y deben ser un motor de desarrollo social y económico. El USM es, en mi opinión, una oportunidad para que la República Dominicana demuestre su capacidad de producir conocimiento relevante y para transformar esa producción en ventajas educativas y tecnológicas concretas.

Agradezco su atención, quedo a disposición para una reunión informativa y para coordinar las acciones que sean pertinentes.

Atentamente,

Emmanuel Antonio José García

Ingeniero 

República Dominicana