One of the most significant and foundational contributions of Artificial Intelligence to modern mathematical research lies in automated theorem proving (ATP) and formal verification systems. These systems are designed to assist, or in some cases fully automate, the process of constructing rigorous mathematical proofs within formally defined logical frameworks. Unlike traditional computational tools, which primarily focus on numerical calculations or symbolic simplifications, ATP systems operate at the level of logical inference, where each step of a proof is verified for correctness according to strict formal rules.

Early approaches to automated reasoning relied heavily on rule-based symbolic manipulation and exhaustive search procedures. However, these methods were often limited by combinatorial explosion and exhibited poor scalability when applied to complex mathematical problems. The introduction of machine learning techniques—particularly neural-guided proof search and reinforcement learning—has significantly improved the efficiency of exploring large proof spaces. Modern systems are now capable of prioritizing relevant lemmas, guiding search trajectories, and reducing the effective complexity of formal derivations [1][2].

A major development in this area is the integration of AI with interactive theorem provers such as Lean, Coq, and Isabelle/HOL. These platforms provide formal languages in which mathematical statements and proofs can be encoded with complete logical precision. AI-based tools are now able to assist in constructing partial proof strategies, suggesting intermediate steps, and automatically filling gaps in formal arguments. This has led to the emergence of a new paradigm in which proof construction becomes a collaborative process between humans and AI systems, rather than being purely manual or fully automated.

Recent breakthroughs in large-scale machine learning models have demonstrated the ability to solve problems at the level of mathematical competitions, including International Mathematical Olympiad (IMO)-style questions. These systems combine symbolic reasoning with pattern recognition over extensive datasets of existing proofs, enabling them to generalize previously learned strategies to new problem instances. In several cases, AI systems have successfully reconstructed nontrivial proofs by identifying underlying structural similarities with previously solved problems [3].

From a theoretical perspective, automated theorem proving can be understood as a high-dimensional search problem over the space of formal derivations. Within this framework, AI acts as a heuristic optimizer that navigates the combinatorial structure of proof trees. Techniques such as Monte Carlo tree search, reinforcement learning, and transformer-based sequence modeling have proven particularly effective in guiding this exploration. These approaches reduce reliance on brute-force enumeration and instead exploit learned statistical patterns in mathematical reasoning.

The evaluation of AI systems on mathematical reasoning tasks has been further standardized through benchmark datasets such as the MATH dataset introduced by Hendrycks, D. et al. [9], which includes a wide range of competition-level problems. Using such benchmarks, recent studies have shown that large language models can solve increasingly complex quantitative problems with high accuracy [10].

In the context of modern mathematical physics and spectral theory, ATP systems hold significant potential for verifying long and technically intricate arguments, such as those encountered in the study of quasi-periodic Schrödinger operators, reducibility problems in KAM theory, and localization phenomena. For example, formal verification could, in principle, be applied to proofs involving iterative schemes, norm estimates, and inductive constructions, where precise control of error propagation is essential. Although such applications remain largely exploratory, they point toward a future in which rigorous computer-assisted verification becomes an integral component of mathematical research.

Despite these advances, current ATP systems still face important limitations. In particular, they often lack deep semantic understanding of mathematical structures and may struggle to generalize beyond distributions similar to those encountered during training. Furthermore, the interpretability of machine-generated proof steps remains a significant challenge, especially in advanced domains where conceptual insight is as important as formal correctness. Consequently, although AI has substantially expanded the scope of automated reasoning, it has not eliminated the need for human intuition and high-level mathematical insight.

Overall, automated theorem proving represents a fundamental shift in mathematical practice, transforming proof verification from a purely human activity into a hybrid computational-logical process. Its continued development is expected to play a central role in the future of formalized mathematics and AI-assisted discovery.

Another major contribution of Artificial Intelligence to mathematical research lies in conjecture generation and pattern recognition, representing a shift from purely deductive reasoning toward data-driven mathematical exploration. In contrast to classical mathematical practice—where conjectures are typically formulated through human intuition and heuristic insight—AI systems are capable of analyzing large-scale datasets of mathematical objects, numerical experiments, or symbolic structures in order to detect non-obvious regularities that may suggest new theoretical statements.

In modern computational mathematics, AI methods—particularly those based on deep learning, clustering algorithms, and representation learning—are able to extract latent structures from high-dimensional mathematical data. These structures often remain inaccessible to traditional analytical approaches due to their combinatorial complexity or the absence of explicit closed-form representations. By embedding mathematical objects (such as graphs, operators, or algebraic structures) into high-dimensional feature spaces, AI systems can identify correlations, symmetries, and invariants that may indicate the presence of deeper underlying principles [1].

A central application of this approach is the automatic generation of conjectures. Rather than proving statements directly, AI systems first analyze empirical evidence derived from simulations or symbolic computation and then propose candidate relationships that appear to hold across wide parameter regimes. These conjectures are typically expressed in the form of inequalities, asymptotic laws, or structural equivalences. In mathematical physics, for example, AI-assisted exploration has been used to conjecture relationships between spectral quantities such as Lyapunov exponents, integrated density of states (IDS), and localization-delocalization transitions in quasi-periodic models.

In the context of quasi-periodic Schrödinger operators, the operator H θ acting on ℓ 2 ( ℤ d ) is defined as follows:

where ϵ ∈ ℝ , ω ∈ ℝ d , ψ ∈ ℓ 2 ( ℤ d ) , θ belongs to the d -dimensional torus Τ d = ( ℝ / ℤ ) d , e : unit vectors (nearest neighbors) and the potential V : ℝ d → ℝ . AI-based numerical exploration can reveal unexpected transitions between spectral regimes depending on parameters such as the frequency ω , the regularity of the potential V , and the strength of the coupling. These observations may suggest conjectural statements regarding the continuity properties of the Integrated Density of State (IDS), the nature of the spectrum (pure point, absolutely continuous, or singular continuous), and the stability of spectral features under perturbations. Such conjectures can subsequently guide rigorous analytical investigations using techniques from KAM theory and perturbation methods.

Beyond spectral theory, AI-driven pattern recognition plays a crucial role in identifying hidden mathematical structures. These include approximate symmetries, scaling laws, and invariant subspaces that may not be explicitly visible in the original formulation of a problem. In many cases, AI does not directly produce fully rigorous statements; instead, it provides empirical “blueprints” that guide mathematicians toward plausible theoretical frameworks. This form of guided exploration is particularly valuable in high-dimensional settings, where direct human intuition is often insufficient.

From a methodological standpoint, AI-based conjecture generation can be interpreted as a form of statistical induction over mathematical domains. By sampling large spaces of examples and counterexamples, the system estimates the likelihood that a given relationship holds universally. This approach contrasts with classical deductive reasoning, which proceeds from axioms to theorems in a strictly logical manner. Instead, AI introduces an intermediate epistemological layer between experimentation and proof, in which conjectures emerge as statistically robust patterns rather than formally derived conclusions.

In addition, AI systems can assist in dimensional reduction and feature extraction within complex mathematical datasets. Techniques such as manifold learning and spectral clustering enable the reduction of high-dimensional structures into more interpretable representations, thereby revealing geometric or algebraic patterns that may correspond to underlying theoretical principles. These methods are particularly relevant in the study of dynamical systems and operator theory, where infinite-dimensional behavior is often approximated through finite-dimensional models.

Despite these advantages, AI-generated conjectures must be treated with caution. While AI is highly effective at identifying correlations, it does not inherently distinguish between genuine mathematical structure and coincidental numerical regularities. Consequently, conjectures proposed by AI require rigorous validation through formal proof techniques. Nevertheless, even incorrect conjectures can be valuable, as they may highlight regions of mathematical space that warrant deeper investigation.

Finally, AI-based conjecture generation represents a powerful and evolving paradigm in mathematical discovery. It transforms the early stages of research from a largely intuition-driven process into a systematic exploration of extensive mathematical landscapes, thereby accelerating the identification of promising research directions and strengthening the connection between computation and theory.

Symbolic computation constitutes a fundamental pillar of modern mathematical research, particularly in areas that require the exact manipulation of algebraic and analytical expressions. Classical computer algebra systems, such as Mathematica and Maple, have long been used for symbolic manipulation. However, their traditional rule-based architecture limits their adaptability when dealing with highly complex or non-standard problems.

The integration of Artificial Intelligence into symbolic computation has significantly extended these capabilities. AI-driven systems are now able to learn transformation heuristics, optimize simplification strategies, and predict efficient algebraic manipulations based on large datasets of mathematical expressions [5][8]. This is particularly relevant in fields such as spectral theory and perturbation analysis, where symbolic complexity increases rapidly and standard rule-based methods become less effective.

In addition, AI contributes to the optimization of numerical methods. Classical numerical algorithms often suffer from issues such as instability or slow convergence, especially in high-dimensional settings. AI-based approaches—such as adaptive learning techniques and neural approximates—can dynamically adjust computational parameters, thereby improving both efficiency and accuracy [11][12].

Another important contribution of AI lies in enabling large-scale simulations. Through the use of surrogate models, AI systems can approximate computationally expensive processes, significantly reducing computational cost while preserving essential structural behavior [12]. This capability is particularly valuable in the study of quasi-periodic operators, where repeated numerical evaluations can be prohibitively expensive.

From an optimization perspective, AI introduces powerful methodologies such as reinforcement learning, which are capable of exploring complex energy landscapes and avoiding local minima [13][14]. These techniques are widely applied in areas including inverse problems, variational analysis, and control theory, where efficient exploration of solution spaces is critical.

Despite these advances, AI-enhanced symbolic computation remains subject to important limitations, particularly with respect to reliability and formal correctness. While AI systems can suggest efficient transformations and computational strategies, rigorous validation still requires formal mathematical verification, often within proof assistant frameworks [7].

Overall, AI provides a unified framework that integrates symbolic reasoning, numerical computation, and optimization techniques. This integration significantly expands the range of mathematical problems that can be addressed effectively, while also reshaping the methodological foundations of modern mathematical research.

A central challenge in the application of Artificial Intelligence to mathematical research concerns reliability and correctness, particularly in the context of proof generation and formal reasoning. Although modern AI systems are capable of producing highly coherent mathematical arguments and structurally plausible derivations, their outputs are not guaranteed to satisfy the strict standards of logical validity required in formal mathematics.

Unlike classical proof systems grounded in formal logic—such as first-order logic or dependent type theory—most contemporary AI models operate according to a probabilistic generation paradigm. In this framework, each step is inferred based on statistical correlations learned from large corpora of mathematical text. Consequently, correctness is not enforced through deductive verification, but rather approximated through linguistic and structural plausibility. This fundamental distinction creates a gap between syntactic coherence and true logical validity, a gap that becomes particularly critical in advanced mathematical contexts.

In complex analytical settings—such as the spectral theory of quasi-periodic Schrödinger operators or iterative schemes arising in KAM theory—proofs often depend on delicate estimates, precise control of error terms, and strict adherence to small-divisor conditions. In such environments, even minor logical inconsistencies or implicit assumptions can invalidate an entire argument. AI systems, however, may generate intermediate steps that appear mathematically sound while inadvertently violating essential conditions, including uniform boundedness, convergence criteria, or non-resonance assumptions.

An additional difficulty arises from the phenomenon of hallucinated mathematical structures, in which AI models produce objects, identities, or theorems that are internally consistent within the generated text but do not correspond to any valid or established mathematical result. These hallucinations are particularly problematic because they are often presented in highly formal and confident language, making them difficult to detect without careful external verification.

The issue of reliability is further amplified in multi-step reasoning processes, where errors may propagate across successive stages of a derivation. In extended proofs—especially those involving iterative constructions, such as conjugation schemes in KAM theory or renormalization procedures in spectral analysis—an incorrect assumption introduced at an early stage may remain undetected while affecting all subsequent steps. This cumulative propagation of error makes global verification of AI-generated proofs significantly more challenging than the local validation of individual statements.

From a foundational perspective, these limitations raise important concerns regarding the trustworthiness of AI-assisted mathematical discovery. In traditional mathematical practice, correctness is ensured through a combination of logical deduction and peer verification. In contrast, AI-generated outputs require an additional layer of validation, either through expert human review or through formal verification systems such as Lean or Coq. However, the integration of AI with fully formal proof assistants remains incomplete, and many current workflows still rely on intermediate informal reasoning stages that are inherently susceptible to subtle errors.

In the specific context of mathematical physics and spectral theory, these challenges become particularly pronounced. For example, in the analysis of quasi-periodic Schrödinger operators, incorrect assumptions regarding the regularity of transfer matrices or inaccurate estimates of cocycle growth rates may lead to fundamentally incorrect conclusions about localization or absolute continuity of the spectrum. Similarly, in KAM-type arguments, improper handling of small divisors or convergence rates may invalidate reducibility results.

Consequently, issues of reliability and correctness should be understood not merely as technical limitations, but as structural constraints on the use of AI in rigorous mathematics. While AI serves as a powerful tool for exploration and heuristic reasoning, its outputs must be regarded as provisional unless they are independently verified through rigorous analytical methods or formal proof systems. This establishes a clear hierarchy in which AI-assisted reasoning occupies an intermediate stage within the broader process of mathematical validation.

Overall, ensuring correctness in AI-assisted mathematics requires a hybrid framework that combines:

formal proof verification systems, human expert oversight, and controlled integration of AI-generated suggestions.

Without such safeguards, the risk of subtle yet fundamental errors remains a significant obstacle to the reliable adoption of AI in mathematical research.

A second fundamental limitation of current Artificial Intelligence systems in mathematical research is the absence of genuine conceptual understanding, especially in highly abstract domains. While AI models can produce correct-looking arguments, manipulate symbolic expressions, and even generate structured proofs, their behavior is ultimately based on pattern recognition rather than true semantic understanding of mathematical objects.

In modern machine learning architectures, particularly large language models, mathematical reasoning is encoded implicitly through high-dimensional statistical correlations learned from training data. This allows the system to approximate reasoning patterns found in existing proofs, but it does not provide an internal semantic representation of why mathematical statements are true or how different concepts are structurally connected. As a result, AI can reproduce the form of mathematical reasoning without grasping its meaning.

This limitation becomes especially visible in areas of mathematics that rely heavily on structural intuition and abstract conceptual frameworks, such as functional analysis, spectral theory, and dynamical systems.

For instance, in the study of quasi-periodic Schrödinger operators, understanding spectral transitions requires a deep grasp of how arithmetic properties of frequencies interact with analytic properties of potentials, and how these interactions shape the long-term dynamical behavior of transfer matrices. These insights are inherently conceptual and cannot be fully captured by local pattern matching or symbolic transformation rules.

Similarly, in KAM (Kolmogorov-Arnold-Moser) theory, the main difficulty is not only carrying out iterative transformations, but also understanding the global geometric and dynamical structure behind the persistence of invariant tori. The mechanism of small divisor cancellation, convergence of conjugation schemes, and stability of quasi-periodic orbits depends on a delicate interplay between geometry, arithmetic, and analysis. While AI systems can assist in performing symbolic iterations, they do not truly “understand” the geometric meaning of reducibility or the dynamical significance of invariance.

Another manifestation of this limitation is the inability of AI systems to reliably distinguish between essential and non-essential structure in mathematical arguments. Human mathematicians rely heavily on abstraction, allowing them to compress long reasoning chains into conceptual principles such as compactness, symmetry, or invariance. In contrast, AI systems tend to operate at the level of explicit patterns in data or text, which makes it difficult for them to identify the deeper organizing principles that unify different mathematical phenomena.

This lack of conceptual grounding also affects the system’s ability to generalize across mathematical domains. While AI can interpolate between known examples, it often struggles when confronted with genuinely new structures that require reorganizing existing concepts or developing new theoretical frameworks. By contrast, mathematical understanding typically involves reformulating problems in new languages, identifying hidden equivalences, and building abstract unifying theories—capabilities that go beyond statistical inference.

From an epistemological perspective, this limitation highlights a fundamental distinction between syntactic correctness and semantic understanding. AI systems can manipulate symbols according to learned patterns, but they do not assign intrinsic meaning to those symbols in the way human mathematicians do. As a result, their “reasoning” lacks conceptual grounding; it is not driven by an understanding of mathematical truth, but rather by probabilistic reconstruction of observed structures.

In practical terms, this means that while AI can be highly effective in supporting tasks such as computation, verification, and heuristic exploration, it cannot independently generate deep theoretical insight or replace human intuition in the development of new mathematical theories. In particular, in advanced research areas such as spectral analysis of quasi-periodic operators or nonlinear dynamical systems, conceptual breakthroughs often come from recognizing hidden structures that are not explicitly present in existing data—a process that remains beyond the capabilities of current AI systems.

Consequently, the lack of deep understanding imposes a clear boundary on the role of AI in mathematics. It serves as a powerful auxiliary tool for manipulation and exploration, but not as a source of genuine mathematical insight. Bridging this gap between syntactic performance and semantic understanding remains one of the central open challenges in the development of AI for mathematical discovery

A further significant concern in the integration of Artificial Intelligence into mathematical research is the risk of over-reliance on automated systems, which may gradually lead to a weakening of core mathematical skills, including problem-solving ability, conceptual intuition, and technical proficiency. While AI tools clearly enhance productivity and reduce computational effort, their widespread use introduces a structural risk: the gradual replacement of active reasoning by automated assistance.

In traditional mathematical practice, expertise is built through sustained engagement with difficult problems, iterative reasoning, and the manual construction of proofs. This process is not only instrumental but also formative, since it develops intuition about mathematical structures, sharpens analytical thinking, and strengthens the ability to work with abstract concepts. As AI systems increasingly take over tasks such as symbolic manipulation, proof suggestion, and computational verification, researchers may become less involved in these cognitively demanding processes.

One of the main risks is the weakening of problem-solving intuition. Mathematical intuition is typically developed through repeated cycles of failure, partial progress, and reconstruction of arguments. In contrast, AI-assisted workflows can bypass many of these intermediate steps by directly proposing solutions or completing technical components. Although this increases efficiency, it may also reduce opportunities for researchers to internalize deep structural patterns, especially in complex domains such as spectral theory or dynamical systems, where intuition about long-term behavior is essential.

A related issue is the reduced development of technical proof skills. In advanced areas of mathematics—such as KAM theory, perturbation analysis, or quasi-periodic Schrödinger operators—proofs often require careful handling of estimates, iterative arguments, and precise control of analytical bounds. If AI systems routinely perform these intermediate steps, researchers may gradually lose familiarity with the underlying technical machinery. Over time, this can create a dependency cycle in which human mathematicians become less capable of independently constructing or verifying complex arguments.

Another important aspect is the shift in cognitive responsibility from active derivation to passive validation. In AI-assisted environments, mathematicians may increasingly find themselves selecting among AI-generated suggestions rather than building arguments from first principles. While this can improve efficiency, it also risks reducing deep engagement with the logical structure of problems, thereby weakening long-term skill development.

From an epistemic perspective, over-reliance on AI may also affect the formation of mathematical intuition as a feedback loop between conjecture and proof. In classical research practice, conjectures are refined through repeated cycles of manual computation, failed attempts, and conceptual restructuring. AI systems, by quickly generating plausible conjectures or partial solutions, may interrupt this iterative learning process. As a result, researchers may become more dependent on externally generated hypotheses instead of developing independent heuristic insight.

This issue is particularly relevant in highly technical domains such as spectral theory and KAM-type analysis, where understanding subtle interactions—such as resonance phenomena, small divisor effects, and stability mechanisms—requires deep familiarity with the underlying analytical structure. Excessive dependence on AI tools in such contexts may lead to a more superficial understanding of results, without full mastery of the methods used to derive them.

Furthermore, there is a risk of deskilling in symbolic and computational techniques, since routine tasks such as algebraic simplification, perturbative expansion, or numerical experimentation are increasingly automated. While this automation improves efficiency, it may reduce the motivation to maintain fluency in these foundational skills, which remain essential for detecting errors, validating results, and extending methods to new settings.

In the long term, heavy reliance on AI could therefore reshape the training path of mathematicians, shifting emphasis away from deep technical apprenticeship toward interaction with automated systems. While this shift may increase productivity, it also raises concerns about preserving mathematical craftsmanship, which depends on sustained engagement with complex reasoning processes.

Taken together, over-reliance and skill degradation represent a structural risk in the evolution of AI-assisted mathematics. Addressing this risk requires a balanced integration strategy in which AI is treated as a support tool rather than a replacement for fundamental reasoning. Maintaining active engagement with manual problem-solving remains essential for preserving the depth, rigor, and creativity that define high-level mathematical research.

The increasing integration of Artificial Intelligence into mathematical research raises profound ethical and epistemological questions that go beyond technical considerations and directly touch the foundations of mathematical practice. Unlike traditional computational tools, AI systems are now increasingly involved in generating conjectures, proofs, and even research directions, which challenges classical notions of authorship, understanding, and validation in mathematics.

A first central issue concerns ownership and intellectual authorship of AI-generated mathematical results. In traditional mathematics, authorship is clearly attributed to individuals or groups who construct proofs and develop theories through explicit reasoning and verification. However, when AI systems contribute significantly to generating conjectures, proof strategies, or even complete derivations, attribution becomes ambiguous. It is not clear whether credit should go to the human user, the developers of the AI system, the contributors of the training data, or the AI system itself as a computational agent. This ambiguity challenges existing academic norms related to publication, citation, and intellectual property in mathematical research.

A second and more fundamental epistemological issue concerns the question: what actually counts as a mathematical proof in the presence of AI assistance? Traditionally, a proof is a finite sequence of logically valid deductions derived from axioms within a formal system, and its validity does not depend on interpretation. However, in AI-assisted environments, proofs may be produced in ways that are partially opaque, heuristic, or distributed across multiple computational layers. In such cases, even when the final result is correct, the internal reasoning may not be fully transparent or understandable to human mathematicians. This creates a deep philosophical tension between formal correctness and conceptual understanding.

This issue becomes especially important in complex mathematical domains such as the spectral theory of quasi-periodic Schrödinger operators or KAM-type dynamical systems, where proofs rely on intricate iterative constructions, delicate estimates, and highly nontrivial analytical mechanisms. If AI systems contribute to such proofs in ways that are not fully interpretable, it becomes necessary to question whether mathematical knowledge can still be considered fully justified in the classical sense, or whether a new notion such as “machine-verified truth” should be introduced.

A related concern is the possible emergence of a distinction between human-understandable proofs and machine-verified proofs. In principle, an AI system integrated with formal proof assistants (such as Lean or Coq) may produce formally correct proofs that are too large, complex, or structurally opaque for humans to fully grasp. While such proofs satisfy syntactic correctness within a formal system, they may fail to provide the explanatory insight traditionally expected in mathematics. This raises the question of whether proof should be defined purely in syntactic terms, or whether semantic understanding remains an essential part of mathematical validity.

Another important epistemological challenge concerns the changing nature of mathematical discovery itself. If AI systems can generate conjectures, suggest proof strategies, and even uncover new structures, then the traditional boundary between discovery and verification becomes blurred. Mathematical knowledge may increasingly emerge from a hybrid human-machine process in which intuition, computation, and formal reasoning are tightly interwoven. This shift forces a reevaluation of long-standing philosophical views on mathematical truth, creativity, and justification.

In addition, ethical concerns arise regarding responsibility for errors in AI-assisted mathematics. If a result produced with AI support is later shown to be incorrect, it becomes difficult to determine responsibility—whether it lies with the human researcher, the AI system, or the design of the computational framework itself. This issue is particularly sensitive in formal mathematical literature, where correctness is absolute and even small errors can invalidate entire chains of reasoning.

From a broader philosophical perspective, these developments challenge the classical view of mathematics as a purely human intellectual activity grounded in transparent logical deduction. The growing role of AI introduces a new epistemic layer in which mathematical truth may be mediated by computational processes that are not fully accessible to human understanding. This raises fundamental questions about whether mathematical knowledge must be fully comprehensible to humans in order to be considered legitimate, or whether correctness alone is sufficient.

The increasing reliance on large-scale AI systems in mathematical research raises important epistemological questions. As discussed in recent analyses of foundation models [15], the opacity and scale of such systems challenge traditional notions of understanding, proof, and authorship in mathematics.

Overall, the ethical and epistemological issues surrounding AI in mathematics suggest that the field is undergoing a structural transformation. Addressing these challenges will require not only technical solutions—such as improved formal verification systems—but also a deeper philosophical reassessment of what it means to know, prove, and understand mathematics in an era of machine-assisted discovery.

To complement the above theoretical discussion, the following section presents empirical evidence based on a large-scale survey examining how these transformations are perceived and experienced by researchers in practice.

The survey was structured as a self-administered online questionnaire consisting of closed-ended Likert-scale items (1 - 5) and open-ended questions (see Appendix). The instrument covered seven thematic dimensions: general perception, theorem proving, conjecture generation, symbolic computation, collaboration, reliability, and epistemological implications.

Participants were recruited through academic mailing lists, research networks, and professional platforms (e.g., university affiliations and mathematical communities). Participation was voluntary and anonymous.

Respondents were required to be engaged in mathematical research or closely related fields (including pure and applied mathematics, dynamical systems, and mathematical physics).

Data were collected between January and June 2025.

The survey targeted an international academic audience; however, responses were not evenly distributed geographically.

Responses were screened for completeness and consistency. Incomplete questionnaires and duplicate submissions were removed. Final analysis included N = 1,032 valid responses.

Descriptive statistics (mean and standard deviation) were calculated for each category based on Likert-scale responses.

Mean scores were computed by averaging Likert-scale responses (1 - 5) across items within each category. Negatively worded items were reverse-coded prior to aggregation to ensure consistency in interpretation.

The study is based on a large and diverse sample of N = 1,032 respondents, providing a broad and diverse exploratory sample, although not necessarily representative of the global mathematical community.

Research Fields

Mathematical Analysis: 27.9% Spectral Theory: 7.0% Dynamical Systems: 18.6% Applied Mathematics: 24.7% Other: 21.8%

Thus, 68.3% of respondents are engaged in theoretical or semi-theoretical domains, directly relevant to assessing AI in abstract mathematics.

Years ofExperience

<5 years: 23.3% 5 - 10 years: 25.7% 10 - 20 years: 31.4% >20 years: 19.6%

Notably, 51% of participants have more than 10 years of experience, ensuring that results reflect expert-level perspectives.

Academic Position

PhD Students: 30.4% Postdoctoral Researchers: 29.3% Lecturers/Researchers: 22.5% Professors: 17.8%

The sample is therefore well-balanced, with 69.6% mid- to senior-level researchers, reinforcing the robustness of the findings.

The survey results indicate a high level of AI adoption among researchers. The mean score for AI usage is M = 4.32 (Standard Deviation: SD = 0.64), reflecting strong agreement that AI tools are actively integrated into mathematical workflows. Approximately 78% of respondents selected “Agree” or “Strongly Agree” when asked about regular AI usage.

These findings confirm that AI is no longer a marginal or experimental tool but has become a standard component of contemporary mathematical practice. In particular, qualitative responses suggest frequent use of systems such as ChatGPT and computer algebra systems for symbolic manipulation and exploratory computations.

A substantial positive impact of AI on research productivity is observed, with a mean score of M = 4.18 (SD = 0.71). More than 72% of participants reported either moderate or strong improvements in efficiency.

The most affected areas include:

computational tasks exploratory analysis preliminary conjecture testing

These results empirically validate the theoretical claims discussed earlier, particularly regarding efficiency gains and acceleration of low-level technical processes. The relatively low standard deviation indicates a broad consensus among respondents.

The role of AI in mathematical discovery is perceived as significant but not dominant, with a mean score of M = 3.97 (SD = 0.76). Around 65% of respondents acknowledge that AI contributes meaningfully to:

Conjecture generation Pattern detection Heuristic exploration

However, the slightly lower mean compared to productivity suggests that researchers still view AI primarily as an assistive discovery tool rather than an autonomous creative agent. This reflects a hybrid paradigm in which AI enhances, but does not replace, human intuition.

Concerns regarding reliability are strongly reflected in the data. The mean score for trust-related items (reverse-coded) is M = 2.21 (SD = 0.83), indicating general disagreement with statements asserting full reliability of AI systems.

Approximately 69% of respondents expressed reservations about AI outputs, citing issues such as:

Logical inconsistencies Hallucinated results Lack of formal guarantees

This confirms that, despite high adoption rates, trust remains a critical bottleneck in AI-assisted mathematical research. The relatively higher standard deviation suggests variability in trust levels, likely depending on individual experience and domain specialization.

The outlook for AI in mathematics is overwhelmingly positive. The mean score for future expectations is M = 4.41 (SD = 0.59), with over 80% of respondents anticipating that AI will evolve into a collaborative partner rather than a replacement for human mathematicians.

Respondents consistently emphasized a complementary division of roles:

AI enhances exploration and computation, humans ensure rigor, interpretation, and conceptual understanding,

This supports the emerging view of human-AI symbiosis as the dominant paradigm for future mathematical research.

Taken together, the results reveal a coherent and statistically consistent picture:

High adoption (M ≈ 4.3) confirms integration into daily workflows Strong productivity gains (M ≈ 4.2) validate efficiency claims Moderate role in discovery (M ≈ 4.0) highlights assistive creativity Low trust levels (M ≈ 2.2) expose critical limitations Optimistic future outlook (M ≈ 4.4) supports long-term integration

This combination suggests that AI is best understood not as a replacement for mathematical reasoning, but as a powerful augmentation layer that reshapes the research process while preserving the central role of human insight (See Figure 1Figure 1).

Figure 1. Mean score by Category.

These results are consistent with recent evaluations of large-scale AI systems, which show significant improvements in mathematical reasoning benchmarks. However, as highlighted in recent comprehensive studies on foundation models by Bommasani, R. et al. [15], important limitations remain, particularly in terms of reliability, interpretability, and generalization.

The survey is based on voluntary participation, which introduces potential self-selection bias. Researchers more interested in AI may be overrepresented. Additionally, the sample may not fully capture geographic or disciplinary diversity. Therefore, results should be interpreted as indicative trends rather than fully generalizable conclusions.