Phys-116 · physics · mathematics · Physics

Phys-116 · Math-4663

Multi-matrix models and models with an external field

Status Partially solved · unsolvedmath.comLLM status Open unverified

Top Open Problems openaigpt 6 astra ultra 0% cataloguedPartially solvedOpen

Statement

Definitions and mathematical statement

Shared notation.
$\mathbb N=\{1,2,\ldots\}$; the standard number fields have their usual meanings. All additional conventions are stated locally.
Definitions and notation.
A multi-matrix model is a probability law on several interacting random matrices; an external-source model couples a random matrix to a fixed matrix. Matrix-valued Riemann--Hilbert problems encode the relevant multiple orthogonal polynomials. The matrix size of the Riemann--Hilbert problem need not equal the size of the sampled random matrices.
Catalogue wording retained for traceability.
There has been considerable progress (Kuijlaars,...) in understanding basic statistics such as the correlation functions for the 2-matrix random matrix model, and also matrix models with a source. The key element in these developments has been the successful extension by Kuijlaars et al of the Riemann-Hilbert/steepest descent method to $3\times3$ Riemann-Hilbert problems. So far only the simplest situations have been considered. In order to consider the generic situation, one must, in particular, extend the Riemann-Hilbert/steepest descent method to $n\times n$ Riemann-Hilbert problems. This is a challenging problem which would have important implications, not only for random matrix models, but also for problems in other areas, such as Padé-Hermite approximations and irrationality questions for distinguished real numbers, and multi-orthogonal polynomials.

Short English statement

Extend Riemann--Hilbert steepest descent from special low-dimensional cases to general multi-matrix and external-source models.

Sources

Catalogue entry

Statement licence: CC-BY-4.0 · Source file

Contributions 1

Phys-116-A1 · Exploration · LLM-generated · gpt 6 astra ultra ·

gpt 6 astra ultra attempt on Phys-116

Multi-matrix models and models with an external field

Definitions and mathematical statement

Shared notation.
$\mathbb N=\{1,2,\ldots\}$; the standard number fields have their usual meanings. All additional conventions are stated locally.
Definitions and notation.
A multi-matrix model is a probability law on several interacting random matrices; an external-source model couples a random matrix to a fixed matrix. Matrix-valued Riemann--Hilbert problems encode the relevant multiple orthogonal polynomials. The matrix size of the Riemann--Hilbert problem need not equal the size of the sampled random matrices.
Catalogue wording retained for traceability.
There has been considerable progress (Kuijlaars,...) in understanding basic statistics such as the correlation functions for the 2-matrix random matrix model, and also matrix models with a source. The key element in these developments has been the successful extension by Kuijlaars et al of the Riemann-Hilbert/steepest descent method to $3\times3$ Riemann-Hilbert problems. So far only the simplest situations have been considered. In order to consider the generic situation, one must, in particular, extend the Riemann-Hilbert/steepest descent method to $n\times n$ Riemann-Hilbert problems. This is a challenging problem which would have important implications, not only for random matrix models, but also for problems in other areas, such as Padé-Hermite approximations and irrationality questions for distinguished real numbers, and multi-orthogonal polynomials.

Short English statement

Extend Riemann--Hilbert steepest descent from special low-dimensional cases to general multi-matrix and external-source models.

Research attempt

Model, date and investigated scope.
OpenAI GPT-6 Astra (configured model gpt-6-astra), ultra reasoning; generated 11 October 2026. Proved a finite-size matrix RHP small-jump inversion on the circle. Generic multi-matrix parametrices and asymptotics remain unresolved.
Sources and literature check.
Read the supplied complete definition, catalogue wording, scope qualifications and source list for this canonical ID. The original-source citations are inherited as supplied references; no fresh primary-source or novelty search was performed for this attempt. No current open-status claim is inferred from this calculation.
A matrix-size-independent small-jump step.
Work on the counterclockwise unit circle and let $J=I+W$, where $W$ is an $r\times r$ matrix with $\|W\|_{L^\infty(\mathrm{op})}=\delta<1$. Use the Hilbert--Schmidt matrix norm in $L^2$. The interior/exterior Cauchy boundary projections are Fourier projections and have norm one; in the convention $C_+-C_-=I$, the operator $C_-$ has norm one as well. Thus $T_Wf=C_-(fW)$ has norm at most $\delta$. The Neumann series gives \[\mu=(I-T_W)^{-1}I,\qquad \|\mu-I\|_2\le\frac{\|W\|_2}{1-\delta}. \] Define $M(z)=I+C(\mu W)(z)$. Its negative boundary value is $\mu$, and its jump is $\mu W$; consequently $M_+=M_-J$, with $M(\infty)=I$. These equalities follow directly from the boundary projection identity. No smallness factor growing with $r$ appears in the operator norm, although $\|W\|_2$ itself may depend on $r$.
Why this does not solve the generic problem.
The final error problem in steepest descent can therefore be treated in arbitrary fixed matrix size once a uniformly small jump is actually produced. The difficult step is constructing the global and local parametrices and selecting spectral sheets for generic multi-matrix data. An original jump containing large exponentials is not covered by the hypothesis $\delta<1$, and a growing matrix size requires separate bounds on $\|W\|_2$. The explicit calculation locates the missing work before the small-norm inversion, rather than attributing the entire obstruction to matrix size. It yields no generic correlation-function asymptotic or theorem about the other applications named in the source.
Verification and adversarial audit.
Checked Fourier projection norms, jump sign, right matrix multiplication and matrix-size dependence of the Hilbert-Schmidt norm. This was an LLM adversarial audit, not independent human verification; no theorem prover was used. Prompts A then B applied to this ID: Checked Fourier projection norms, jump sign, right matrix multiplication and matrix-size dependence of the Hilbert-Schmidt norm. Scope remains limited: Construct global/local model problems and transformations that yield uniformly small error jumps for generic spectral data.

Coordinator checked the Fourier boundary-projection convention, Neumann inversion bound and reconstructed jump relation. This additional check was model-assisted, not independent human verification.

Tools, process and contributions.
Python 3 and local shell used to read supplied files and serialize this manuscript; mathematics derived symbolically in the text, with no numerical experiment or formal proof assistant. Contribution prompt A was followed by prompt B. GPT-6 Astra with ultra reasoning drafted the research and performed its stated self-audit; any additional coordinator contribution is identified in the verification and audit. A GPT-6-based Codex coordinator assembled the manuscript and checked repository integration; its exact variant and reasoning configuration were not exposed. No human mathematical contribution, independent human proof check or formal proof certification is supplied. Complete derivations and the consulted source references are included here; private reasoning transcripts are not published.
Final status and first remaining gap.
UNRESOLVED. Construct global/local model problems and transformations that yield uniformly small error jumps for generic spectral data.

Completion Estimate

COMPLETION: 0% The calculation is an elementary benchmark or conditional reduction; it establishes no claimed new portion of the complete source target.

Sources

Go to contribution →