Edit: material reordered for clarity
The formal definition of the PolyLogorithm is Sum[z^k/k^n, {n, 1, Infinity}]
, which converges for Abs[z] < 1
. Thus, the integrand can be integrated term-wise.
summand = Integrate[-I (x (1 - x))^k/(Sqrt[3] (-(1/2) - (I Sqrt[3])/2 + x)), x]
// FullSimplify
(* ((-1)^(1/6) x^(1 + k) AppellF1[1 + k, -k, 1, 2 + k, x, -(-1)^(2/3) x])/
(Sqrt[3] (1 + k)) *)
The value of summand
at x = 1
is
summand /. x -> 1
(* ((-1)^(1/6) 2^(-1 - 2 k) Sqrt[\[Pi]/3] Gamma[2 + k]
Hypergeometric2F1[1, 1 + k, 2 + 2 k, -(-1)^(2/3)])/((1 + k) Gamma[3/2 + k]) *)
Of course, summand /. x -> 0
is 0
. The first ten terms of the series are adequate to give a good answer.
Sum[(summand /. x -> 1) k^-2, {k, 1, 10}] // N // Chop
(* 0.110503 *)
This same result can be obtained by numerically integrating the integrand from x = 0
to x = 1
.
NIntegrate[-((I PolyLog[2, x - x^2])/(Sqrt[3] (-(1/2) - (I Sqrt[3])/2 + x))), {x, 0, 1}]
// Chop
(* 0.110503 *)
For completeness, note that the integrand is well behaved throughout the range of integration.
Plot[Evaluate[
ReIm[-((I PolyLog[2, x - x^2])/(Sqrt[3] (-(1/2) - (I Sqrt[3])/2 + x)))]], {x, 0, 1}]
(The Real and Imaginary parts are blue and orange, respectively.)
However, it is important to remember that the anti-derivative of any function is determined only up to an arbitrary constant. Thus,
int = Integrate[-((I PolyLog[2, x - x^2])/(Sqrt[3] (-(1/2) - (I Sqrt[3])/2 + x))), x];
int /. x -> .9999
(* 3.03883 + 1.54225 I*)
gives a different answer, because Integrate
has thrown in a different constant in this case. Varying x shows that this numerical solution has converged.
(int /. x -> .99999) - (int /. x -> .9999)
(* 2.47505*10^-9 - 1.42876*10^-9 I *)
Which result is preferable depends on how the OP plans to use it.