Bounded square-class width and sign-symmetric factorization in C(Z)
Statement
Question 24 (Pheidas). If x ∈ C(Z), then
ord Z=0
( 1 + Zx 2
1 − Zx 2
)
= ord Z=∞
( 1 + Zx 2
1 − Zx 2
)
= 0
Can every f ∈ C(Z) with ord Z=0 (f ) = ord Z=∞(f ) even be written as (obviously, the number 1000 can be changed to any other integer)
f = u21000 ∏
i=1
1 + Zx 2
i
1 − Zx 2
i
Weaker version: is this true at least for f ∈ Q(Z), with u, x i ∈ C(Z)?This would imply that the existential theory of C(Z) is undecidable.
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.