Automation Without Understanding
Abstract: Two developments are unfolding at once: artificial intelligence systems have begun to produce genuine research-level mathematics, and the United States is weakening the pipeline that produces humans capable of understanding what such systems are doing. This essay argues that, taken together, these developments amount to a strategic error. Mathematical capacity, which is the trained ability to verify, interpret, and challenge mathematical reasoning, is not a byproduct of theorem production but a form of infrastructure, built over generations by institutions that cannot be reconstituted on demand. Drawing on the May 2026 AI disproof of a longstanding Erdős conjecture on the planar unit distance problem and on recent disruptions to federal support for the mathematical sciences, the essay makes the case for treating mathematical capacity as a strategic asset on a par with semiconductor capability. It further proposes, among other measures, that AI systems performing consequential reasoning be required to expose their decision-critical claims in formal, machine-checkable form, converting part of AI reasoning from opaque persuasion into auditable structure.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Explain it Like I'm 14
What is this paper about?
This paper argues that the United States is risking a big mistake: just as AI systems are starting to do real, creative mathematics, the country is letting its human math talent and training system shrink. The author says math understanding is like hidden infrastructure—like clean water or reliable courts. When you neglect it, lots of important things can fail later, especially when we start trusting powerful AIs we don’t fully understand.
What questions does the paper ask?
- Can AI now do genuine mathematical discovery, not just fast calculation? The author says yes.
- If AI can do math, do we still need lots of human mathematicians? The author says yes—maybe more than ever.
- What goes wrong if we automate without enough human understanding?
- What should the U.S. do to keep human mathematical capacity strong in the age of AI?
How does the author make the case?
This is a policy and ideas essay, not a lab experiment. The author:
- Points to recent examples where advanced AI systems solved or disproved hard math problems that stumped humans for decades (like the “unit distance problem,” which asks: if you put n points on a flat surface, how many pairs can be exactly one unit apart?).
- Cites budget moves and hiring freezes that are shrinking U.S. math programs and delaying research.
- Uses everyday comparisons: you still keep water engineers in an automated treatment plant and human judges in a court, even if machines can help, because sometimes systems fail in surprising ways and someone must truly understand what went wrong.
- Explains key ideas in plain terms: “emergence” (simple training rules leading to complex, surprising abilities), and “formal verification” (having proofs or certificates that other programs and people can mechanically check).
What are the main points and why do they matter?
1) Machines can now do real math
Recent AI models haven’t just crunched numbers; they’ve discovered new math ideas and connected distant areas of math. In one headline case, an AI found a construction that overturned an 80-year-old belief about distances between points. Human experts checked and translated the AI’s reasoning into standard math language. That shows AI can contribute at the research level.
Why it matters: If AI can produce true but complicated math, humans still need to understand, verify, improve, and build on it. Otherwise, we’re taking results on faith.
2) The human math pipeline is quietly shrinking
Funding scares and cuts stalled or canceled grants, froze hiring, and shrank PhD programs. Some universities admitted far fewer (or zero) new funded math PhD students. This doesn’t look like a planned strategy—more like budget chaos and the false belief that “if machines can do math, we need fewer mathematicians.”
Why it matters: Mathematical capacity isn’t a pile of theorems—it’s a community of trained people. Training that talent takes years, and rebuilding it after damage takes even longer.
3) A proof is a product; understanding is a capacity
A “proof” is like a finished product. “Understanding” is the human skill to judge, adapt, connect, and challenge that product. You don’t become a surgeon by watching videos, and you don’t become a mathematician by reading proofs alone. You learn by long practice, mentorship, and being part of a community that insists on clarity and rigor.
Why it matters: Without enough trained people, we can’t reliably audit AI reasoning, spot hidden assumptions, or catch when a slick-sounding answer is wrong.
4) AI is powerful—and not yet well understood
LLMs are trained with a simple rule: predict the next piece of text. Yet at scale they show planning and multi-step reasoning their builders can’t fully explain. Researchers have begun to peek inside (interpretability), and sometimes find real math-like structure. But this science is young, and the biggest models are private, making outside scrutiny hard.
Why it matters: Society is adopting systems that are advancing faster than our understanding of how they think. That’s risky.
5) The “first-contact problem” isn’t sci-fi
We’re already heading toward everyday decisions—about money, science, infrastructure, even defense—where a model’s recommendation is persuasive but not truly transparent. “The model said so” can’t be the end of the conversation.
Why it matters: Democracies need explanations they can audit, not just fluent language. Otherwise, institutions can’t take real responsibility.
What does the paper recommend?
The author proposes four concrete steps:
- Preserve and strengthen the human pipeline: fund strong undergraduate and graduate training, postdocs, stable academic jobs, and research institutes. Don’t starve the system that creates mathematical thinkers.
- Build an independent national AI assurance capacity: public institutions with direct access to top models, data, and experiments so outside experts can test, verify, and criticize frontier systems.
- Stop demanding immediate “usefulness” from all math: foundational math often looks obscure before it becomes essential later. Keep pure math healthy so new ideas and standards can emerge.
- Require formal, checkable outputs for high-stakes AI: when AI is used for consequential decisions, it should produce decision-critical claims in a formal, machine-checkable form (like a proof or certificate), not just a persuasive paragraph. Independent tools and experts can then verify what the system asserts.
Why this matters for the future
Choosing “automation without understanding” makes a country fragile and dependent. Keeping a strong community of human mathematicians helps society:
- Audit and direct powerful AI systems
- Tell sound reasoning from slick but wrong answers
- Build trustworthy standards for science, engineering, and policy
- Maintain the intellectual independence needed to govern technology
In short: AI can help make discoveries, but people must keep the capacity to understand, question, and guide what the machines do. That takes time, training, and steady support—and losing it would be easy, slow, and very costly to reverse.
Knowledge Gaps
Consolidated knowledge gaps, limitations, and open questions
Below is a single, concrete list of what the paper leaves missing, uncertain, or unexplored, framed so future researchers and policymakers can act on them:
- Quantitative evidence linking funding volatility to loss of “mathematical capacity”: causal models estimating how cuts translate into reduced enrollments, hiring, publication output, and time-to-recovery at national and field levels.
- Operational definitions and metrics for “mathematical capacity” as infrastructure: measurable indicators (e.g., trained personnel, formal-library coverage, verification throughput, seminar density) and dashboards to track them over time.
- Decay and rebuild timescales of the mathematical workforce: cohort-based modeling of skill atrophy, emigration, and the minimum sustained investments required to restore capacity after shocks.
- Generalizability of AI-led mathematical breakthroughs: systematic audits of how often frontier models import deep machinery across fields, versus cherry-picked successes, and the preconditions that enable such transfers.
- Benchmarks and reproducibility for “research-level” AI mathematics: leakage-controlled datasets, protocols for independent re-derivation, and standards to distinguish genuine discovery from retrieval or prompt exploitation.
- Empirical accounting of the human effort required to convert AI-generated arguments into usable knowledge: time-and-motion studies of expert hours per result, typical failure modes, and bottlenecks in verification and exposition.
- A concrete research agenda for a mathematical theory of emergence in large models: candidate invariants, symmetries, phase transitions, and predictive relationships between training regimes, scale, and reasoning capabilities.
- Methods to audit model reasoning beyond natural language explanations: experimentally grounded toolkits (counterfactual probes, causal ablations, representation-level tests) tied to formal properties and error bounds.
- Feasibility and cost trade-offs of requiring “decision-critical claims” to be machine-checkable: latency, computational overhead, coverage limits, and performance impacts across domains (real-time control, stochastic decision-making, scientific inference).
- Standards, tooling, and security for proof-carrying AI: interoperable formats (e.g., proof object schemas), certification pipelines, red-teaming for proof spoofing, supply-chain integrity for formal libraries, and tamper-evident provenance.
- Strategy to scale formal math libraries (Lean/Coq/etc.): prioritization frameworks, manpower and funding estimates, contributor incentives, and QA processes to cover advanced areas (e.g., class field theory) needed for modern results.
- Design and governance of independent AI assurance institutions: legal authorities, guaranteed access to models/data/compute, conflict-of-interest safeguards, publication norms, and sustainable funding mechanisms independent of vendors.
- Regulatory architecture for formal assurance: which sectors and risk thresholds trigger machine-checkable obligations, how to handle uncertainty (probabilistic certificates, statistical guarantees), and accountability/liability when formally valid claims rest on faulty premises.
- Pedagogical reforms to preserve human judgment while integrating AI: curricula that train abstraction, proof, and model auditing; best practices for using AI tutors without eroding depth; mentorship models; and evaluation methods that resist automation shortcuts.
- Equity and regional considerations in capacity-building: impacts of funding shifts on non-elite institutions and underrepresented groups; mechanisms to prevent concentration of expertise in a few hubs; scholarship and fellowship designs that broaden participation.
- Public–private access frameworks enabling independent scrutiny: agreements for compute/model/data access that protect IP and privacy while allowing replication, stress-testing, and longitudinal safety studies.
- Sector-specific risk taxonomy for “automation without understanding”: concrete failure modes, incident and near-miss databases, and scenario-based stress tests in domains like finance, infrastructure, biosecurity, and defense.
- Comparative international analysis: rigorous mapping of national strategies (e.g., China’s), their inputs (funding, institutions) and outputs (talent, publications, verification capacity), and risks of brain drain or strategic dependency.
- Economic analysis of alternative allocations: cost–benefit and real-options models comparing commercialization initiatives with foundational mathematics funding, including spillovers to verification, education, and long-run innovation.
- Scope limits of mathematical assurance and division of labor: where formal methods are insufficient or impractical, what complementary disciplines (security, HCI, governance, domain science) must supply, and interface standards between them.
Practical Applications
Immediate Applications
Below are specific, deployable use cases that flow directly from the paper’s recommendations on formal verification, AI assurance, and sustaining mathematical capacity. Each item includes target sectors, potential tools/workflows/products, and feasibility assumptions.
- AI procurement clauses that require machine‑checkable artifacts for high‑stakes decisions
- Sectors: healthcare (clinical decision support), finance (risk/credit decisions), defense/logistics, critical infrastructure (power, water)
- What to deploy: Contract language mandating that any model influencing consequential decisions must produce decision‑critical claims in a formal, verifiable format (e.g., certificates, proof logs, constraint witnesses), not only natural‑language rationales
- Tools/workflows: SAT/SMT proof logs (e.g., DRAT/LRAT), optimization certificates (dual solutions, optimality gaps), TLA+/Ivy specs for protocols, proof assistants (Lean/Coq/Isabelle) for the parts that can be formalized today
- Assumptions/dependencies: Access to verifiable components of the workflow; willingness to scope the “decision‑critical” core; performance overhead is acceptable; legal authority and regulator capacity to enforce
- Assurance CI/CD pipelines for AI products
- Sectors: software, finance, healthcare, energy, insurance
- What to deploy: Integrate property checks, formal specs for key invariants, counterexample generation, and certifiable optimization steps into the ML deployment pipeline
- Tools/workflows: “Spec‑first” tickets; property‑based tests; model cards plus formal invariants; reproducible training with attestation; regression test suites for assumptions
- Assumptions/dependencies: Staff trained in formal methods; compute/time budget for checks; organizational buy‑in to slow/stop deployments on failing proofs
- Independent third‑party mathematical audits of frontier models
- Sectors: cross‑sector; especially firms selling AI into regulated contexts
- What to deploy: Contracted audits that test formal properties (monotonicity, stability, boundedness), probe failure modes, and validate certificates on sample decisions
- Tools/workflows: Secure model access in audit sandboxes; red‑team protocols; reproducibility scripts; verifiable logging and artifact preservation
- Assumptions/dependencies: Legal frameworks for model/data access; NDAs/safe harbors; sufficient independent mathematical expertise
- Fast‑track funding and backstops to prevent breaks in the math training pipeline
- Sectors: academia; spillover to industry via talent supply
- What to deploy: Emergency bridge grants, graduate fellowships, postdoc slots, and hiring backstops to stabilize cohorts and research groups
- Tools/workflows: Competitive micro‑grants; society‑administered “backstop” funds; multi‑year commitments insulated from annual budget shocks
- Assumptions/dependencies: Immediate public or philanthropic funding; streamlined administration
- Targeted expansion of formal math libraries used in verification
- Sectors: software, aerospace, robotics, cryptography, AI
- What to deploy: Bounty programs and “library sprints” to encode missing theories in Lean/Coq/Isabelle that block formalization of AI‑relevant results
- Tools/workflows: Open calls for modules; maintainers and review pipelines; test suites with proof obligations
- Assumptions/dependencies: Expert time and incentives; prioritized roadmaps tied to deployment needs
- Embed mathematicians as “model auditors” on product and risk teams
- Sectors: finance, healthcare, software, energy trading/dispatch
- What to deploy: New roles responsible for assumptions registers, invariant design, counterexample hunts, and proof artifact review for each feature/decision path
- Tools/workflows: Assumption logs; decision dossiers bundling inputs, models, and certificates; sign‑off gates in release processes
- Assumptions/dependencies: Hiring pipelines; competitive compensation; clear authority to block releases
- Specification‑first ML feature development
- Sectors: software, robotics/AV, operations research
- What to deploy: Write formal specs for safety/monotonicity/fairness constraints before modeling; treat models as implementations of specs testable by proof or property checks
- Tools/workflows: Design by contract; runtime monitors; control barrier certificates for safety‑critical control
- Assumptions/dependencies: Cultural shift; training in spec languages; acceptance of narrower but auditable functionality
- Consumer apps that surface assumptions and allow “what‑if” stress tests
- Sectors: personal finance, health/wellness, education
- What to deploy: UI elements that list model assumptions, show decision boundaries, and let users vary inputs to see changes; flag unsupported counterfactuals
- Tools/workflows: Lightweight monotonicity checks; sensitivity analyses; explanatory dashboards
- Assumptions/dependencies: Product willingness to trade persuasion for transparency; minimal performance impact
- Joint industry–academia interpretability projects grounded in mathematics
- Sectors: AI labs, universities, defense research
- What to deploy: Small consortia studying learned representations with mathematical tools (symmetry, Fourier structure, invariants), using shared model slices
- Tools/workflows: Pre‑registered experiments; shared probes; mechanistic interpretability notebooks; public benchmarks of interpretability claims
- Assumptions/dependencies: Data/model access; publication allowances; funding for open work
- Regulatory pilots that require formal artifacts in narrow domains
- Sectors: medical devices (assistive diagnostics), algorithmic trading safeguards, credit underwriting thresholds
- What to deploy: Time‑boxed sandboxes where deploying firms must submit formal certificates for specified properties (e.g., limits, constraints, safety checks)
- Tools/workflows: Regulator‑hosted verification toolchains; standardized certificate formats; post‑mortem disclosure rules
- Assumptions/dependencies: Regulator staffing; industry participation; clear scope to avoid overreach
- Verifiable optimization in grid operations and logistics
- Sectors: energy (unit commitment, OPF), supply chain, aviation scheduling
- What to deploy: Require solvers to emit feasibility/optimality certificates for critical runs and archive them for audit
- Tools/workflows: Solver support for certificates; dashboards that flag uncertified runs; fallback policies
- Assumptions/dependencies: Commercial solver capabilities; operator training; acceptance of modest runtime overhead
- Formally verified components in cybersecurity and safety kernels
- Sectors: defense, aerospace, industrial control
- What to deploy: Use verified microkernels and protocols in systems that host or supervise AI components; apply proof‑carrying code where feasible
- Tools/workflows: seL4/SPARK/TLA+ ecosystems; standard proof obligations in supply chains
- Assumptions/dependencies: Vendor support; integration costs; legacy system constraints
Long‑Term Applications
These require sustained research, scaling, or institutional development to become routine.
- National AI Assurance Institutes with independent access to frontier models
- Sectors: cross‑sector public interest; national security
- What to build: Federally funded labs where mathematicians, computer scientists, and verification experts evaluate systems with their own compute, data, and experiments
- Tools/products: Secure model access frameworks; standardized audit batteries; public reports and certification marks
- Assumptions/dependencies: Multi‑year funding; cooperation or legal compulsion for access; talent pipeline
- Proof‑carrying AI: models that emit machine‑checkable proofs/certificates by design
- Sectors: healthcare, finance, autonomy, critical infrastructure
- What to build: Training and decoding architectures that co‑produce decisions and verifiable artifacts for decision‑critical claims
- Tools/products: Neuro‑symbolic pipelines; verified decoders; succinct proof systems (e.g., SNARK/STARK‑style certificates for certain subroutines)
- Assumptions/dependencies: Research to reduce overhead; extensive formal library coverage; standards for certificate formats
- Open standards for machine‑checkable explanations
- Sectors: standards bodies, regulators, enterprise software
- What to build: Interoperable schemas and formats for certificates/proofs linked to specific decisions, data, and specs
- Tools/products: RFC‑like specification; conformance test suites; open‑source validators
- Assumptions/dependencies: Industry consensus; governance body with authority; backward compatibility plans
- Large‑scale formalization of core mathematics relevant to AI and verification
- Sectors: academia, tool vendors, safety‑critical industries
- What to build: Multi‑decade programs to encode algebra, analysis, optimization, probability, and domain math in proof assistants
- Tools/products: Maintained libraries, APIs for engineered reuse, education materials
- Assumptions/dependencies: Stable funding; career incentives for contributors; community governance
- A mathematical theory of learned representations and emergence
- Sectors: AI R&D, defense research, advanced analytics
- What to build: Frameworks that describe invariants, symmetries, and phase‑change phenomena in large models; predictive theory of capability emergence
- Tools/products: New diagnostics; training curricula for auditors; design rules that guarantee properties at scale
- Assumptions/dependencies: Access to empirical data; sustained cross‑disciplinary collaboration
- Regulatory regimes that treat mathematical capacity as critical infrastructure
- Sectors: national policy, education, R&D
- What to build: Protected funding baselines, redundancy mandates (e.g., minimum faculty and trainee levels), and long‑horizon grants for pure math
- Tools/products: Endowment‑like funding mechanisms; performance‑independent support for foundational work
- Assumptions/dependencies: Political will; shielded budgets; independent oversight
- Math‑AI dual‑track education and career pathways
- Sectors: higher education, industry
- What to build: Degrees, residencies, and fellowships that combine pure math training with verification, interpretable ML, and assurance practice
- Tools/products: Joint curricula; practicum rotations in assurance labs; stackable credentials
- Assumptions/dependencies: Faculty capacity; industry partnerships; accreditation evolution
- Sector‑specific formal safety cases for AI
- Sectors: autonomous vehicles/robots, medical AI, aviation
- What to build: Standardized, proof‑backed safety cases (invariants, barrier certificates, runtime assurance) required for certification and updates
- Tools/products: Safety case repositories; certifier toolchains; continuous monitoring with certificate renewal
- Assumptions/dependencies: Mature tooling; regulator adoption; reliable sensing/actuation models
- Public‑interest compute and data access centers
- Sectors: research, civil society, oversight bodies
- What to build: Secure environments where independent experts can probe, reproduce, and verify claims about high‑capability systems
- Tools/products: Data trusts, governance frameworks, reproducibility infrastructure
- Assumptions/dependencies: Privacy/IP law updates; funding; company participation
- Insurance and capital markets that price mathematically assured AI
- Sectors: insurance, corporate governance, venture financing
- What to build: Premium discounts or capital access tied to certified assurance levels (e.g., proof‑carrying deployments, independent audits)
- Tools/products: Risk models calibrated to assurance artifacts; certification registries
- Assumptions/dependencies: Loss data; actuarial consensus; regulator acceptance of assurance metrics
- International mutual recognition of AI assurance certifications
- Sectors: trade, multinational enterprises
- What to build: Treaties and technical accords for equivalence of proof standards and audit processes across jurisdictions
- Tools/products: Cross‑certification bodies; shared conformity tests
- Assumptions/dependencies: Diplomatic alignment; harmonized legal definitions
- Dedicated, protected funding lines for pure mathematics analogous to semiconductor programs
- Sectors: national R&D
- What to build: Long‑term, ring‑fenced appropriations and institutes focused on foundational math with clear links to AI assurance and beyond
- Tools/products: Institute networks, challenge programs, decade‑long grants
- Assumptions/dependencies: Stable governance; periodic but not short‑horizon reviews
These applications operationalize the paper’s core thesis: sustaining human mathematical capacity and embedding formal, auditable structure into AI workflows are not luxuries—they are prerequisites for trustworthy, governable automation.
Glossary
- AI assurance: Independent evaluation and oversight of AI systems to ensure safety, reliability, and compliance with standards. "build an independent national capacity for AI assurance"
- algebraic number theory: A branch of mathematics studying algebraic structures related to integers and number fields. "by importing machinery from algebraic number theory, including class field towers,"
- alignment problem: The challenge of ensuring AI systems’ objectives and behaviors align with human values and intent. "This would not solve the alignment problem:"
- class field towers: Sequences of abelian extensions in class field theory, often used to study the arithmetic of number fields. "including class field towers, a corner of mathematics built for entirely different purposes."
- class-field-theoretic results: Theorems and tools arising from class field theory. "only by taking the two deepest class-field-theoretic results as explicit unproven hypotheses,"
- combinatorics: The study of discrete structures and counting principles, often involving arrangements and configurations. "the best minds in combinatorics believed him."
- discrete Fourier transforms: An algorithmic technique that represents discrete signals or functions as sums of complex exponentials. "built from discrete Fourier transforms and trigonometric identities,"
- discrete geometry: The study of geometric objects and properties in discrete spaces or involving combinatorial constraints. "on the planar unit distance problem in discrete geometry"
- extended inference: Additional reasoning-time procedures applied after training to improve or adapt model performance. "then refined through post-training and extended inference,"
- Fields Medalist: A recipient of the Fields Medal, one of the highest honors in mathematics awarded for outstanding achievements. "Among them was the Fields Medalist Timothy Gowers,"
- formal verification: The use of mathematical proofs and rigorous methods to verify the correctness of systems or statements. "Serious work is under way on interpretability, formal verification, and the theory of learned representations."
- formalization: The process of expressing mathematical arguments in a formal language suitable for machine checking. "Another team did complete a formalization, but only by taking the two deepest class-field-theoretic results as explicit unproven hypotheses,"
- frontier model: A state-of-the-art, highly capable AI model at the leading edge of current capabilities. "We cannot map what a frontier model has learned with the mathematical equivalent of a magnifying glass."
- internal representation spaces: The high-dimensional feature spaces learned inside neural networks that encode concepts and relationships. "the internal representation spaces of frontier AI systems."
- International Mathematical Olympiad: A prestigious annual competition for pre-university students solving challenging math problems. "International Mathematical Olympiad problems"
- invariants: Properties of a system or object that remain unchanged under specified transformations or operations. "What are its invariants?"
- Lean: A modern interactive theorem prover and programming language used for formalizing and verifying mathematical proofs. "Lean, a leading proof-assistant language,"
- limiting behaviors: The asymptotic characteristics or tendencies of a system as some parameter grows without bound. "Its limiting behaviors?"
- machine-checkable: Represented in a formal format that can be verified by automated proof checkers. "in a formal, machine-checkable form,"
- mechanistic interpretability: A research approach that aims to reverse-engineer the internal algorithms of neural networks. "celebrated in the young field of mechanistic interpretability,"
- modular arithmetic: Arithmetic system where numbers wrap around upon reaching a certain modulus, fundamental in number theory and cryptography. "trained a small artificial neural network on modular arithmetic,"
- planar unit distance problem: A question in discrete geometry about the maximum number of unit-distance pairs among n points in the plane. "breakthrough on the planar unit distance problem in discrete geometry"
- post-training: Procedures applied after the initial training phase (e.g., fine-tuning, RLHF) to refine model behavior. "then refined through post-training and extended inference,"
- proof-assistant language: A formal language used by interactive theorem-proving systems to encode and verify proofs. "Lean, a leading proof-assistant language,"
- scaling curves: Empirical relationships showing how model performance or properties change with increases in data, model size, or compute. "Existing tools reveal fragments: circuits, features, scaling curves."
- symmetries: Transformations that preserve structure or properties of a mathematical object or system. "Its symmetries?"
- theory of learned representations: A theoretical framework that seeks to explain how neural networks encode and organize concepts internally. "the theory of learned representations."
- theorem's signature: The formal specification of a theorem’s inputs, hypotheses, and outputs in a proof system. "written directly into the theorem's signature as trust."
- trigonometric identities: Fundamental equalities involving trigonometric functions used to transform and simplify expressions. "built from discrete Fourier transforms and trigonometric identities,"
- type-checked: Verified by a type system to ensure expressions and proofs conform to formal typing rules. "type-checked while proving nothing."
- verifiable certificate: A machine-checkable artifact that provides evidence for the correctness of a claim or computation. "accompanied by a proof or a verifiable certificate,"
Collections
Sign up for free to add this paper to one or more collections.