OpenFrontiers
← Back to the index
OP-10461Status unassessedAnalysis

Mapping theorems for numerical range · Question 11.1

Crouzeix's conjecture · AIMPL workshop record

Editorial mapping of AIMPL list topic: Crouzeix's conjecture. http://aimpl.org/crouzeix/ Not an author-supplied MSC code.

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

Problem statement

Is W(C1,C2)W(C_1,C_2) always a convex set?

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.

Background

Question context

{\bf Definition.} Given closed convex subsets C1C_1 and C2C_2 of C\mathbb{C}, define

W(C1,C2):=⋃{W(f(T)):W(T)⊂C1, f(C1)⊂C2}. W(C_1,C_2):=\bigcup\Bigl\{W(f(T)): W(T)\subset C_1,~f(C_1)\subset C_2\Bigr\}.

Here the union is taken over:

  • all operators TT (on any HH) such that W(T)⊂C1W(T)\subset C_1, and

  • all functions ff holomorphic near C1C_1 such that f(C1)⊂C2f(C_1)\subset C_2.

{\bf Examples.} Let DD be a closed disk, let rDrD be the disk with the same centre and radius scaled by a factor rr, and let HH be a closed half-plane. Then:

  • W(D,D)=(5/4)DW(D,D)=(5/4)D (Drury, '08).

  • W(C1,D)⊂2 DW(C_1,D)\subset\sqrt2\,D (Crouzeix--Palencia, '17).

  • W(H,C2)=C2W(H,C_2)=C_2 (Kato, '65).

  • W(D,H)=CW(D,H)=\mathbb{C} (Kato, '65).

{\bf Remark.} The Crouzeix conjecture is equivalent to the statement that W(C1,D)⊂(5/4)DW(C_1,D)\subset (5/4)D for all C1,DC_1,D.

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]Crouzeix'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.

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.