OpenFrontiers
← Back to the index
OP-11350Status unassessedAlgebra

Factors of cocycle twists of Sklyanin algebras · Question 1.1

Noncommutative surfaces and Artin's conjecture · AIMPL workshop record

Editorial mapping of AIMPL list topic: Noncommutative surfaces and Artin's conjecture. http://aimpl.org/ncsurfaceartin/ Not an author-supplied MSC code.

Workshop record · status unassessedAs of 2026-09-10 source snapshot; not a current-status certificationSource & evidence ↓

Problem statement

Let SS be a 4-dimensional Sklyanin algebra, not finite over its centre. Odesskii defines a twist by the Klein four-group K4K_4 acts diagonally on S⊗kM2(k)=M2(S)S \otimes_k M_2(k) = M_2(S). Let A=(M2(S))K4A = (M_2(S))^{K_4}. The central elements of SS, Ω1\Omega_1 and Ω2\Omega_2, remain central in AA. Consider RΩ:=A/(Ω)R_\Omega := A/(\Omega), where Ω:=c1Ω1+c2Ω2\Omega := c_1 \Omega_1 + c_2 \Omega_2 for some constants c1,c2c_1, c_2. Andrew Davies showed that RΩ1R_{\Omega_1} is not a domain; is every RΩR_\Omega not a domain?

Lean 4

Not yet attached

No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.

Progress & source assessment

Dated source record, inspected 2026-09-10. Current status has not been independently reassessed. Source-reported results have not been independently verified.

The source supplies no separate status note for this question.

References
  1. [1]Noncommutative surfaces and Artin's conjecture · Original question link
  2. [2]AIMPL source bibliography link
  3. [3]AIMPL text license · CC BY-SA 3.0 linkAIM Problem Lists (AIMPL), original contributors; CC BY-SA 3.0. Adaptation: structural TeX converted to Markdown, documented source macros expanded, and source bibliography links added. Mathematical wording retained. These adapted source texts remain under CC BY-SA 3.0.
  4. [4]Repeated original formulation · Sklyanin algebras and cocycle twists · Question 12.1 link

Recorded progress

Add yours →

Nothing recorded yet. A pointer to a paper the entry is missing counts.

Machine attempts

0 recorded

Attempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.

No machine attempts recorded.

Sign in to run an attempt. New accounts start with enough credits for ten.

Discussion

0 notes

Notes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.

No notes yet.

Sign in to add a note.