LaTeX to CAS translator

This mockup demonstrates the concept of TeX to Computer Algebra System (CAS) conversion.

The demo-application converts LaTeX functions which directly translate to CAS counterparts.

Functions without explicit CAS support are available for translation via a DRMF package (under development).

The following LaTeX input ...

{\displaystyle {z \choose n} = \begin{cases} \frac{\Gamma(z+1)}{\Gamma(n+1)\Gamma(z-n+1)} & n \geq 0 \\ 0 & n < 0 \end{cases}}

${\displaystyle {z \choose n}={\begin{cases}{\frac {\Gamma (z+1)}{\Gamma (n+1)\Gamma (z-n+1)}}&n\geq 0\\0&n<0\end{cases}}}$

... is translated to the CAS output ...

Semantic latex: {z \choose n} = \begin{cases}\frac{\EulerGamma@{z + 1}}{\EulerGamma@{n + 1} \EulerGamma@{z - n + 1}} n \geq 0 0 & n < 0\end{cases}

Confidence: 0.83533037035188

Mathematica

Translation: Binomial[z,n] ==

Information

Free variables

n

z

Tests

Symbolic

Test expression: Binomial[z,n]

ERROR:

{
    "result": "ERROR",
    "testTitle": "Simple",
    "testExpression": null,
    "resultExpression": null,
    "wasAborted": false,
    "conditionallySuccessful": false
}

Numeric

SymPy

Translation: binomial(z,n) ==

Information

Free variables

n

z

Tests

Symbolic

Numeric

Maple

Translation: binomial(z,n) =

Information

Free variables

n

z

Tests

Symbolic

Numeric

Dependency Graph Information

Includes

$n$

$\Gamma (z)$

$z$

Description

integer

Gamma function

Jacobi polynomial

Complete translation information:

{
  "id" : "FORMULA_b1e4493881f1c47423915d9999dd9459",
  "formula" : "{z \\choose n} = \\begin{cases} \\frac{\\Gamma(z+1)}{\\Gamma(n+1)\\Gamma(z-n+1)} & n \\geq 0 \\\\ 0 & n < 0 \\end{cases}",
  "semanticFormula" : "{z \\choose n} = \\begin{cases}\\frac{\\EulerGamma@{z + 1}}{\\EulerGamma@{n + 1} \\EulerGamma@{z - n + 1}} n \\geq 0 0 & n < 0\\end{cases}",
  "confidence" : 0.8353303703518778,
  "translations" : {
    "Mathematica" : {
      "translation" : "Binomial[z,n] == ",
      "translationInformation" : {
        "freeVariables" : [ "n", "z" ]
      },
      "numericResults" : {
        "overallResult" : "SKIPPED",
        "numberOfTests" : 0,
        "numberOfFailedTests" : 0,
        "numberOfSuccessfulTests" : 0,
        "numberOfSkippedTests" : 0,
        "numberOfErrorTests" : 0,
        "wasAborted" : false,
        "crashed" : false,
        "testCalculationsGroups" : [ ]
      },
      "symbolicResults" : {
        "overallResult" : "ERROR",
        "numberOfTests" : 1,
        "numberOfFailedTests" : 0,
        "numberOfSuccessfulTests" : 0,
        "numberOfSkippedTests" : 0,
        "numberOfErrorTests" : 1,
        "crashed" : false,
        "testCalculationsGroup" : [ {
          "lhs" : "Binomial[z,n]",
          "rhs" : "",
          "testExpression" : "Binomial[z,n]",
          "testCalculations" : [ {
            "result" : "ERROR",
            "testTitle" : "Simple",
            "testExpression" : null,
            "resultExpression" : null,
            "wasAborted" : false,
            "conditionallySuccessful" : false
          } ]
        } ]
      }
    },
    "SymPy" : {
      "translation" : "binomial(z,n) == ",
      "translationInformation" : {
        "freeVariables" : [ "n", "z" ]
      }
    },
    "Maple" : {
      "translation" : "binomial(z,n) = ",
      "translationInformation" : {
        "freeVariables" : [ "n", "z" ]
      }
    }
  },
  "positions" : [ {
    "section" : 3,
    "sentence" : 0,
    "word" : 16
  } ],
  "includes" : [ "n", "\\Gamma(z)", "z" ],
  "isPartOf" : [ ],
  "definiens" : [ {
    "definition" : "integer",
    "score" : 0.722
  }, {
    "definition" : "Gamma function",
    "score" : 0.7125985104912714
  }, {
    "definition" : "Jacobi polynomial",
    "score" : 0.6460746792928004
  } ]
}

Specify your own input

Formula input
Wikitext context	{{Use American English\|date = March 2019}} {{Short description\|Polynomial sequence}} {{for\|Jacobi polynomials of several variables\|Heckman–Opdam polynomials}} In [[mathematics]], '''Jacobi polynomials''' (occasionally called '''hypergeometric polynomials''') {{math\|''P''{{su\|b=''n''\|p=(''α'', ''β'')}}(''x'')}} are a class of [[Classical orthogonal polynomials\|classical]] [[orthogonal polynomials]]. They are orthogonal with respect to the weight {{math\|(1 − ''x'')<sup>''α''</sup>(1 + ''x'')<sup>''β''</sup>}} on the interval {{math\|[−1, 1]}}. The [[Gegenbauer polynomials]], and thus also the [[Legendre polynomials\|Legendre]], [[Zernike polynomials\|Zernike]] and [[Chebyshev polynomials]], are special cases of the Jacobi polynomials.<ref name=sz>{{cite book \| last1=Szegő \| first1=Gábor \| title=Orthogonal Polynomials \| url=https://books.google.com/books?id=3hcW8HBh7gsC \| publisher= American Mathematical Society \| series=Colloquium Publications \| isbn=978-0-8218-1023-1 \| mr=0372517 \| year=1939 \| volume=XXIII\|chapter=IV. Jacobi polynomials.}} The definition is in IV.1; the differential equation – in IV.2; Rodrigues' formula is in IV.3; the generating function is in IV.4; the recurrent relation is in IV.5.</ref> The Jacobi polynomials were introduced by [[Carl Gustav Jacob Jacobi]]. ==Definitions== ===Via the hypergeometric function=== The Jacobi polynomials are defined via the [[hypergeometric function]] as follows:<ref>{{Abramowitz_Stegun_ref\|22\|561}}</ref> :<math>P_n^{(\alpha,\beta)}(z)=\frac{(\alpha+1)_n}{n!}\,{}_2F_1\left(-n,1+\alpha+\beta+n;\alpha+1;\tfrac{1}{2}(1-z)\right),</math> where <math>(\alpha+1)_n</math> is [[Pochhammer symbol\|Pochhammer's symbol]] (for the rising factorial). In this case, the series for the hypergeometric function is finite, therefore one obtains the following equivalent expression: :<math>P_n^{(\alpha,\beta)} (z) = \frac{\Gamma (\alpha+n+1)}{n!\,\Gamma (\alpha+\beta+n+1)} \sum_{m=0}^n {n\choose m} \frac{\Gamma (\alpha + \beta + n + m + 1)}{\Gamma (\alpha + m + 1)} \left(\frac{z-1}{2}\right)^m.</math> ===Rodrigues' formula=== An equivalent definition is given by [[Rodrigues' formula]]:<ref name=sz/><ref>{{SpringerEOM\|id=Jacobi_polynomials\|author=P.K. Suetin}}</ref> :<math>P_n^{(\alpha,\beta)}(z) = \frac{(-1)^n}{2^n n!} (1-z)^{-\alpha} (1+z)^{-\beta} \frac{d^n}{dz^n} \left\{ (1-z)^\alpha (1+z)^\beta \left (1 - z^2 \right )^n \right\}.</math> If <math> \alpha = \beta = 0 </math>, then it reduces to the [[Legendre polynomials]]: :<math> P_{n}(z) = \frac{1 }{2^n n! } \frac{d^n }{ d z^n } ( z^2 - 1 )^n \; . </math> ===Alternate expression for real argument=== For real ''x'' the Jacobi polynomial can alternatively be written as :<math>P_n^{(\alpha,\beta)}(x)= \sum_{s=0}^n {n+\alpha\choose n-s}{n+\beta \choose s} \left(\frac{x-1}{2}\right)^{s} \left(\frac{x+1}{2}\right)^{n-s}</math> and for integer ''n'' :<math>{z \choose n} = \begin{cases} \frac{\Gamma(z+1)}{\Gamma(n+1)\Gamma(z-n+1)} & n \geq 0 \\ 0 & n < 0 \end{cases}</math> where {{math\|Γ(''z'')}} is the [[Gamma function]]. In the special case that the four quantities {{math\|''n'', ''n'' + ''α'', ''n'' + ''β''}}, and {{math\|''n'' + ''α'' + ''β''}} are nonnegative integers, the Jacobi polynomial can be written as {{NumBlk\|:\|<math>P_n^{(\alpha,\beta)}(x)=(n+\alpha)! (n+\beta)! \sum_{s=0}^n \frac{1}{s! (n+\alpha-s)!(\beta+s)!(n-s)!} \left(\frac{x-1}{2}\right)^{n-s} \left(\frac{x+1}{2}\right)^{s}.</math>\|{{EquationRef\|1}}}} The sum extends over all integer values of ''s'' for which the arguments of the factorials are nonnegative. ===Special cases=== :<math>P_0^{(\alpha,\beta)}(z)= 1,</math> :<math>P_1^{(\alpha,\beta)}(z)= (\alpha+1) + (\alpha+\beta+2)\frac{z-1}{2},</math> :<math>P_2^{(\alpha,\beta)}(z)= \frac{(\alpha+1)(\alpha+2)}{2} + (\alpha+2)(\alpha+\beta+3)\frac{z-1}{2} + \frac{(\alpha+\beta+3)(\alpha+\beta+4)}{2}\left(\frac{z-1}{2}\right)^2,...</math> ==Basic properties== ===Orthogonality=== The Jacobi polynomials satisfy the orthogonality condition :<math>\int_{-1}^1 (1-x)^{\alpha} (1+x)^{\beta} P_m^{(\alpha,\beta)} (x)P_n^{(\alpha,\beta)} (x)\,dx =\frac{2^{\alpha+\beta+1}}{2n+\alpha+\beta+1} \frac{\Gamma(n+\alpha+1)\Gamma(n+\beta+1)}{\Gamma(n+\alpha+\beta+1)n!} \delta_{nm}, \qquad \alpha,\ \beta > -1.</math> As defined, they do not have unit norm with respect to the weight. This can be corrected by dividing by the square root of the right hand side of the equation above, when <math>n=m</math>. Although it does not yield an orthonormal basis, an alternative normalization is sometimes preferred due to its simplicity: :<math>P_n^{(\alpha, \beta)} (1) = {n+\alpha\choose n}.</math> ===Symmetry relation=== The polynomials have the symmetry relation :<math>P_n^{(\alpha, \beta)} (-z) = (-1)^n P_n^{(\beta, \alpha)} (z);</math> thus the other terminal value is :<math>P_n^{(\alpha, \beta)} (-1) = (-1)^n { n+\beta\choose n}.</math> ===Derivatives=== The ''k''th derivative of the explicit expression leads to :<math>\frac{d^k}{dz^k} P_n^{(\alpha,\beta)} (z) = \frac{\Gamma (\alpha+\beta+n+1+k)}{2^k \Gamma (\alpha+\beta+n+1)} P_{n-k}^{(\alpha+k, \beta+k)} (z).</math> ===Differential equation=== The Jacobi polynomial {{math\|''P''{{su\|b=''n''\|p=(''α'', ''β'')}}}} is a solution of the second order [[linear homogeneous differential equation]]<ref name=sz/> :<math> \left (1-x^2 \right )y'' + ( \beta-\alpha - (\alpha + \beta + 2)x )y' + n(n+\alpha+\beta+1) y = 0.</math> ===Recurrence relations=== The [[Orthogonal polynomials#Recurrence relation\|recurrence relation]] for the Jacobi polynomials of fixed ''α'',''β'' is:<ref name=sz/> :<math>\begin{align} &2n (n + \alpha + \beta) (2n + \alpha + \beta - 2) P_n^{(\alpha,\beta)}(z) \\ &\qquad= (2n+\alpha + \beta-1) \Big\{ (2n+\alpha + \beta)(2n+\alpha+\beta-2) z + \alpha^2 - \beta^2 \Big\} P_{n-1}^{(\alpha,\beta)}(z) - 2 (n+\alpha - 1) (n + \beta-1) (2n+\alpha + \beta) P_{n-2}^{(\alpha, \beta)}(z), \end{align}</math> for ''n'' = 2, 3, .... Since the Jacobi polynomials can be described in terms of the hypergeometric function, recurrences of the hypergeometric function give equivalent recurrences of the Jacobi polynomials. In particular, Gauss' contiguous relations correspond to the identities :<math>\begin{align} (z-1) \frac{d}{dz} P_n^{(\alpha,\beta)}(z) &= \frac{1}{2} (z-1)(1+\alpha+\beta+n)P_{n-1}^{(\alpha+1,\beta+1)} \\ &= n P_n^{(\alpha,\beta)} - (\alpha+n) P_{n-1}^{(\alpha,\beta+1)} \\ &=(1+\alpha+\beta+n) \left( P_n^{(\alpha,\beta+1)} - P_{n}^{(\alpha,\beta)} \right) \\ &=(\alpha+n) P_n^{(\alpha-1,\beta+1)} - \alpha P_n^{(\alpha,\beta)} \\ &=\frac{2(n+1) P_{n+1}^{(\alpha,\beta-1)} - \left(z(1+\alpha+\beta+n)+\alpha+1+n-\beta \right) P_n^{(\alpha,\beta)}}{1+z} \\ &=\frac{(2\beta+n+nz) P_n^{(\alpha,\beta)} - 2(\beta+n) P_n^{(\alpha,\beta-1)}}{1+z} \\ &=\frac{1-z}{1+z} \left( \beta P_n^{(\alpha,\beta)} - (\beta+n) P_{n}^{(\alpha+1,\beta-1)} \right) \, . \end{align}</math> ===Generating function=== The [[generating function]] of the Jacobi polynomials is given by :<math> \sum_{n=0}^\infty P_n^{(\alpha,\beta)}(z) t^n = 2^{\alpha + \beta} R^{-1} (1 - t + R)^{-\alpha} (1 + t + R)^{-\beta}, </math> where :<math> R = R(z, t) = \left(1 - 2zt + t^2\right)^{\frac{1}{2}}~, </math> and the [[principal branch\|branch]] of square root is chosen so that ''R''(''z'', 0) = 1.<ref name=sz/> ==Asymptotics of Jacobi polynomials== For ''x'' in the interior of {{math\|[−1, 1]}}, the asymptotics of {{math\|''P''{{su\|b=''n''\|p=(''α'', ''β'')}}}} for large ''n'' is given by the Darboux formula<ref name=sz/> :<math>P_n^{(\alpha,\beta)}(\cos \theta) = n^{-\frac{1}{2}}k(\theta)\cos (N\theta + \gamma) + O \left (n^{-\frac{3}{2}} \right ),</math> where :<math>\begin{align} k(\theta) &= \pi^{-\frac{1}{2}} \sin^{-\alpha-\frac{1}{2}} \tfrac{\theta}{2} \cos^{-\beta-\frac{1}{2}} \tfrac{\theta}{2},\\ N &= n + \tfrac{1}{2} (\alpha+\beta+1),\\ \gamma &= - \tfrac{\pi}{2} \left (\alpha + \tfrac{1}{2} \right ), \end{align} </math> and the "''O''" term is uniform on the interval [ε, {{pi}}-ε] for every ε > 0. The asymptotics of the Jacobi polynomials near the points ±1 is given by the [[Mehler–Heine formula]] :<math>\begin{align} \lim_{n \to \infty} n^{-\alpha}P_n^{(\alpha,\beta)}\left(\cos \left ( \tfrac{z}{n} \right ) \right) &= \left(\tfrac{z}{2}\right)^{-\alpha} J_\alpha(z)\\ \lim_{n \to \infty} n^{-\beta}P_n^{(\alpha,\beta)}\left(\cos \left (\pi - \tfrac{z}{n} \right) \right) &= \left(\tfrac{z}{2}\right)^{-\beta} J_\beta(z) \end{align}</math> where the limits are uniform for ''z'' in a bounded [[Domain (mathematical analysis)\|domain]]. The asymptotics outside {{math\|[−1, 1]}} is less explicit. ==Applications== ===Wigner d-matrix=== The expression ({{EquationNote\|1}}) allows the expression of the [[Wigner D-matrix#Wigner (small) d-matrix\|Wigner d-matrix]] ''d''<sup>''j''</sup><sub>''m''’,''m''</sub>(φ) (for 0 ≤ φ ≤ 4{{pi}}) in terms of Jacobi polynomials:<ref>{{cite book\| last=Biedenharn\| first=L.C.\| last2=Louck\| first2=J.D.\|title=Angular Momentum in Quantum Physics\|publisher=Addison-Wesley \|location=Reading \|year=1981}}</ref> :<math>d^j_{m'm}(\phi) =\left[ \frac{(j+m)!(j-m)!}{(j+m')!(j-m')!}\right]^{\frac{1}{2}} \left(\sin\tfrac{\phi}{2}\right)^{m-m'} \left(\cos\tfrac{\phi}{2}\right)^{m+m'} P_{j-m}^{(m-m',m+m')}(\cos \phi).</math> ==See also== [[Askey–Gasper inequality]] [[Big q-Jacobi polynomials]] [[Continuous q-Jacobi polynomials]] [[Little q-Jacobi polynomials]] [[Pseudo Jacobi polynomials]] [[Jacobi process]] [[Gegenbauer polynomials]] [[Romanovski polynomials]] ==Notes== <div class="references"> <references /> ==Further reading== {{Citation \| last1=Andrews \| first1=George E. \| last2=Askey \| first2=Richard \| last3=Roy \| first3=Ranjan \| title=Special functions \| publisher=[[Cambridge University Press]] \| series=Encyclopedia of Mathematics and its Applications \| isbn=978-0-521-62321-6 \|id={{ISBN\|978-0-521-78988-2}} \| mr=1688958 \| year=1999 \| volume=71}} {{dlmf\|id=18\|title=Orthogonal Polynomials\|first=Tom H. \|last=Koornwinder\|first2=Roderick S. C.\|last2= Wong\|first3=Roelof \|last3=Koekoek\|\|first4=René F. \|last4=Swarttouw}} ==External links== *{{MathWorld\|title=Jacobi Polynomial\|urlname=JacobiPolynomial}} </div> [[Category:Special hypergeometric functions]] [[Category:Orthogonal polynomials]]
	Purge cached results.

LaTeX to CAS translator

Mathematica

Information

Tests

Symbolic

Numeric

SymPy

Information

Tests

Symbolic

Numeric

Maple

Information

Tests

Symbolic

Numeric

Dependency Graph Information

Specify your own input

Navigation menu

Search