petRUShka's profile - activity

It's no use I think. Good to have pdb when you run file like sage file.sage. But I tried and it is standard pdb without

AttributeError when load object (ideal and groebner basis) with numpy.load I've calculated Groebner Basis with sage and

AttributeError when load object (ideal and groebner basis) with numpy.load I've calculated Groebner Basis with sage and

AttributeError when load object (ideal and groebner basis) with numpy.load I've calculated Groebner Basis with sage and

set_trace() analog for Sage In sage one can use import pdb;pdb.set_trace() or in case of tests: import pytest; pytest.s

Suppose I have field FF:

sage: FF
Number Field in z with defining polynomial t^2+1

How to programmatically check that this field is Number Field? Something like FF.is_number_field()...

How to check that field is Number Field Suppose I have field FF: sage: FF Number Field in z with defining polynomial t^

How to check that field is Number Field Suppose I have field `FF``: sage: FF Number Field in z with defining polynomial

How to check that field is Number Field Suppose I have field `FF``: ``` sage: FF Number Field in z with defining polyn

@tmonteil, I've added P.S. with details

Suppose I have equation of curve C:

curve 
# => y^2 + (x^2 + x)*y + x
curve.parent()
# => Univariate Polynomial Ring in y over Rational function field in x over Rational Field

and I know that there is a point with x value is a root of another equation (i.e. element of corresponding Number Field):

equation
# => x^3 + x^2 - 2*x - 9/2
equation.parent()
# => Univariate Polynomial Ring in x over Rational Field

is x-coordinate of some point of C.

How to properly get y-coordinate of C in x?

It is not as easy as it seems because of conversion problems.

My workaround is as following:

FF.<z> = NumberField(equation)
P.<x,y> = QQ[]

u = P(curve).subs(x=z)

P.<y> = FF[]
return z, P(u).roots()[0][0]

and it doesn't seem right.

Are there more elegant way of doing it?

P.S. curve is constructed as follows:

  F = FunctionField(QQ, 'x')
  x = F.gen()
  R.<y> = F[]

  curve = y^2 + (x^2 + x)*y + x;

But it was done in another place so I have no direct access to x and y from above code.

I want to make jedi (autocompletion, static analysis and refactoring library for python) to understand Sage code. I want to integrate it with vim via jedi-vim but there are plenty of other editors\IDEs with support of jedi

There is a discussion with some evidence of possibility of that combo:

Well, I wound up figuring this out. I just had to turn the problem around and include the sage path in the normal python path (export PYTHONPATH=/usr/lib/sagemath/src) - not switch the Jedi interpreter to be the sage interpreter. Seems to work well now. Thanks for the response!

But I cannot figure out what should I do to make it work.

P.S. It seems that there are some successes on the subject with different approaches: PyCharm (windows) and Vscode.

There are plenty kind of language servers for Python: LSP (palantir, sourcegraph, microsoft), jedi, rope and etc.

The Language Server protocol is used between a tool (the client) and a language smartness provider (the server) to integrate features like auto complete, go to definition, find all references and alike into the tool

There are a lot of editors (almost any) and IDE with support of that kind of language servers.

Question is: are there some adaptations of that solutions to SageMath (which is heavily based on Python and translated to Python)? Or may be some standalone solution for SageMath?

P.S. It is looked as there is evidence of some success with jedi-vim, but I cannot reproduce it at the moment.

Are there some documentation on diamond bracket notation:

R.<w> = PolynomialRing(QQ)

and square bracket notation:

R.<y> = QQ['y'];

There is some documentation in Constructors for polynomial rings docs but it looks superficial on this topic.

Are there some complete explanation with all the details behind the scene?

Is it only for polynomial rings or for some other objects? Is it SageMath addition?

I want to run sage with python3. I know that it isn't fully ported, but I want to use already ported functionality and hope it cover my needs.

One particular reason is my necessity to use multiprocessing.pool with lambda function which doesn't work with python 2 and both workarounds seem to not work also.

P.S. I found third workaround which seems to be working.