Ask Your Question

Revision history [back]

click to hide/show revision 1
initial version

How I can evaluate the limit superior of a function?

How I can evaluate the limit superior of a function? I dont found in the documentation something related to this essential tool.

How I can evaluate the limit superior of a function?

How I can evaluate the limit superior of a function? sequence? I dont found in the documentation something related to this essential tool.

How I can evaluate the limit superior of a function?

How I can evaluate the limit superior of a sequence? I dont found in the documentation something related to this essential tool.

How I can evaluate the limit superior of a function?sequence?

How I can evaluate the limit superior of a sequence? I dont found in the documentation something related to this essential tool.

EDIT: the limit superior of a sequence $(x_n)$ is defined as

$$\limsup x_n=\lim_{n\to\infty} \sup \{x_k:k\ge n\} =\inf\{\sup \{x_k:k\ge n\}: n\in \mathbb N \} $$

where the first definition is the more interesting computationally.

How I can evaluate the limit superior of a sequence?

How I can evaluate the limit superior of a sequence? I dont found in the documentation something related to this tool.

EDIT: the limit superior of a sequence $(x_n)$ is defined as

$$\limsup x_n=\lim_{n\to\infty} \sup \{x_k:k\ge n\} =\inf\{\sup \{x_k:k\ge n\}: n\in \mathbb N \} $$

where the first definition is the more interesting computationally.


It seems that, computationally, evaluating the limit superior is hard because it is done via "brute force". Not only ths happen in sage, too in other CAS. It seems that there is a loooong run in the developing of computer algebra systems.

How I can evaluate the limit superior of a sequence?

How I can evaluate the limit superior of a sequence? I dont don't found in the documentation something related to this tool.

EDIT: the limit superior of a sequence $(x_n)$ is defined as

$$\limsup x_n=\lim_{n\to\infty} \sup \{x_k:k\ge n\} =\inf\{\sup \{x_k:k\ge n\}: n\in \mathbb N \} $$

where the first definition is the more interesting computationally.


It seems that, computationally, evaluating the limit superior is hard because it is done via "brute force". Not This doesn't happen only ths happen in sage, too it happen also in other CAS. It seems that there is a loooong long run in the developing of computer algebra systems.