Operator-Mediated Completion Theory for Nonclassical Automorphic Objects

Research-Monograph TOC

PART I — THE AUTOMORPHIC CLOSURE PROBLEM

Chapter 1. Classical Automorphic Closure

1.1 Group actions and slash operators
1.2 Weight, multiplier, and representation
1.3 Exact transformation laws
1.4 Holomorphic modular forms
1.5 Meromorphic modular forms
1.6 Jacobi transformation laws
1.7 Maass and real-analytic automorphic objects
1.8 Boundary and cusp behavior
1.9 Closure as an exact structural condition
1.10 Classical modularity as the zero-defect case

Chapter 2. Nonclassical Automorphic Objects

2.1 Holomorphic objects failing exact modular closure
2.2 Mock modular forms
2.3 False theta and false modular structures
2.4 Partial theta structures
2.5 Quantum modular forms
2.6 Harmonic Maass forms
2.7 Maass–Jacobi and harmonic Maass–Jacobi forms
2.8 Appell–Lerch structures
2.9 Indefinite theta functions
2.10 Eisenstein-type nonholomorphic completions
2.11 Mixed modular structures
2.12 Why “nonmodular” is too coarse a classification

Chapter 3. Transformation Defect

3.1 The candidate primitive

\Delta_f(\gamma) = f|_k\gamma-f

3.2 Defect relative to an acting group
3.3 Defect relative to weight
3.4 Defect relative to multiplier
3.5 Defect relative to domain
3.6 Defect relative to boundary locus
3.7 Exact zero defect
3.8 Removable defect
3.9 Persistent defect
3.10 Distributional defect
3.11 Boundary-supported defect
3.12 Defect as structural data rather than error term

Chapter 4. The Closure Packet

4.1 Why $\Delta_f$ alone is insufficient
4.2 Candidate packet

\mathfrak D(f) = \langle \Delta_f, \Gamma, k, \mu, B, \mathcal C \rangle

4.3 Acting symmetry $\Gamma$
4.4 Weight $k$
4.5 Multiplier or representation $\mu$
4.6 Closure geometry $B$
4.7 Admissible completion class $\mathcal C$
4.8 Growth conditions
4.9 Principal-part conditions
4.10 Normalization data
4.11 Structural equivalence of defect packets

PART II — COMPLETION AS STRUCTURAL REPAIR

Chapter 5. Completion as an Inverse Problem

5.1 Incomplete object versus completed object
5.2 Basic equation

\widehat f = f+R

5.3 Correction term $R$
5.4 Restoration of transformation law
5.5 Minimal versus nonminimal corrections
5.6 Holomorphic versus nonholomorphic correction
5.7 Completion as structure rather than cosmetic modification
5.8 Completion existence
5.9 Completion uniqueness
5.10 Homogeneous ambiguity

Chapter 6. The Homogeneous Kernel

6.1 Defect equation

\delta F=\rho

6.2 Closed solutions

\delta H=0

6.3 Ambiguity

F\mapsto F+H

6.4 Modular kernel
6.5 Weakly holomorphic ambiguity
6.6 Jacobi ambiguity
6.7 Boundary normalization
6.8 Principal-part normalization
6.9 Growth normalization
6.10 Why shadow data alone cannot generally reconstruct the object

Chapter 7. Eichler-Integral Completion

7.1 Classical Eichler integrals
7.2 Nonholomorphic Eichler integrals
7.3 Eichler integrals in mock completion
7.4 Period-type transformation defects
7.5 Iterated Eichler integrals
7.6 Multiple Eichler integrals
7.7 Eichler integrals as reconstruction kernels
7.8 Boundary interpretation
7.9 Higher-depth extension

Chapter 8. Harmonic Maass Completion

8.1 Harmonic weak Maass forms
8.2 Holomorphic and nonholomorphic parts
8.3 Shadow data
8.4 Harmonicity
8.5 Laplacian
8.6 Growth at cusps
8.7 Weakly holomorphic kernel
8.8 Harmonic completion as a depth-one model
8.9 Limits of the harmonic-Maass carrier

Chapter 9. Maass–Jacobi and Jacobi Completion

9.1 Jacobi variables
9.2 Elliptic transformation law
9.3 Modular transformation law
9.4 Singular harmonic Maass–Jacobi forms
9.5 Jacobi analogues of Eichler integrals
9.6 Completion in two variables
9.7 Index as structural data
9.8 Polar and singular behavior
9.9 Carrier-specific versus carrier-independent content

Bringmann’s 2026 Ramanujan/Lim work explicitly constructs completions and embeds the resulting functions into a singular harmonic Maass–Jacobi framework.

PART III — THE OPERATOR CALCULUS

Chapter 10. Operators as Structural Probes

10.1 Operators versus representations
10.2 Operator action as an executable test
10.3 Kernel
10.4 Image
10.5 Fixed subspaces
10.6 Weight shifting
10.7 Closure preservation
10.8 Defect exposure
10.9 Reconstruction
10.10 Operator families rather than one universal operator

Chapter 11. The Shadow Operator

11.1 Shadow as first exposed modular residue
11.2 Antiholomorphic differentiation
11.3 $\xi$ -type operators
11.4 Weight change
11.5 Kernel structure
11.6 Shadow equivalence
11.7 Shadow ambiguity
11.8 Shadow as one coordinate of the defect architecture

Chapter 12. Bol-Type Operators

12.1 Holomorphic differentiation
12.2 Bol identities
12.3 Weakly holomorphic images
12.4 Complementarity with shadow operators
12.5 Canonical decomposition
12.6 Reconstruction information encoded by Bol images
12.7 When Bol and shadow data jointly determine more than either separately

Chapter 13. Maass Raising and Lowering

13.1 Raising operators
13.2 Lowering operators
13.3 Weight flow
13.4 Laplace eigenvalues
13.5 Poincaré-series sources
13.6 Operator-generated modularity
13.7 Constructive versus diagnostic operators
13.8 Raising as candidate GRM ascent

Bringmann–Kane explicitly use the Maass raising operator to realize functions as images of quadratic-form Poincaré series and to explain their modular and Laplace-eigenvalue properties.

Chapter 14. Flipping Operators

14.1 Canonical splitting of harmonic Maass forms
14.2 Shadow-controlled component
14.3 Bol-controlled component
14.4 Flipping between components
14.5 Duality under operator exchange
14.6 Operator symmetry
14.7 Flipping as a test of carrier dependence

Chapter 15. Operator Algebra

15.1 Composition
15.2 Noncommutativity
15.3 Commutators
15.4 Nested commutators
15.5 Operator relations
15.6 Redundant operators
15.7 Independent operators
15.8 Minimal operator basis
15.9 Operator-generated invariants
15.10 Candidate operator category

PART IV — INDEFINITE THETA AND ERROR-FUNCTION COMPLETION

Chapter 16. Indefinite Theta as a Completion Laboratory

16.1 Definite versus indefinite signature
16.2 Convergence failure
16.3 Cone restriction
16.4 Sign kernels
16.5 Wall and chamber geometry
16.6 Modular defect from discontinuous kernels
16.7 Smoothing
16.8 Completion
16.9 Separation of convergence from modularity

Chapter 17. Vignéras-Type Differential Structure

17.1 Kernel deformation
17.2 Vignéras equation
17.3 Differential criterion for modularity
17.4 Growth and regularity conditions
17.5 Shadow extraction
17.6 Asymptotic reconstruction
17.7 Differential equation as carrier-specific closure operator
17.8 Limits of Vignéras universality

Chapter 18. $r$ -Tuple Error Functions

18.1 $E_r$
18.2 $M_r$
18.3 Gaussian convolution
18.4 Sign asymptotics
18.5 Factorization
18.6 Permutation and scaling symmetries
18.7 Discontinuity loci
18.8 Subset decompositions
18.9 Boosted error functions
18.10 Modular completion at arbitrary signature

Chapter 19. Rank-Lowering Descent

19.1 Shadow of $E_r$
19.2 Shadow of $M_r$
19.3 Gaussian weighting
19.4 Rank $r\rightarrow r-1$
19.5 Repeated descent
19.6 Wall incidence
19.7 Codimension and analytic rank
19.8 Cancellation
19.9 Effective descent depth
19.10 Why rank is evidence for depth but not its universal definition

PART V — HIGHER DEPTH AND COUPLING

Chapter 20. Recursive Higher-Depth Mock Modularity

20.1 Depth zero
20.2 Depth one
20.3 Depth $d$
20.4 Recursive antiholomorphic derivative
20.5 Tensor-product descendants
20.6 Weight bookkeeping
20.7 Multiplier bookkeeping
20.8 Growth conditions
20.9 Formal depth
20.10 Effective depth

Chapter 21. Trivial versus Primitive Depth

21.1 Product of two depth-one objects
21.2 Formal depth two
21.3 Why product depth can be structurally trivial
21.4 Decomposable sector

\mathrm{Dec}_d

21.5 Primitive quotient

\mathcal O_d/\mathrm{Dec}_d

21.6 Primitive depth
21.7 Indecomposable coupling
21.8 Cancellation depth
21.9 Reconstruction depth
21.10 Need for an irreducibility criterion

Chapter 22. Eisenstein-Series Coupling

22.1 Classical Eisenstein construction
22.2 Depth-one Eisenstein mock forms
22.3 Product versus coupling
22.4 Coupled depth-two object
22.5 Analytic continuation
22.6 Modular completion
22.7 Depth-two shadow
22.8 Antisymmetric coupling
22.9 Vafa–Witten realization
22.10 Independent construction of higher depth

The 2026 Bringmann–Nazaroglu result gives a new independent route to depth-two mock modularity through coupled Eisenstein series rather than relying exclusively on indefinite theta functions.

Chapter 23. Coupling Topology

23.1 Branching shadow data
23.2 Coupling coefficients
23.3 Sign/orientation
23.4 Tensor factors
23.5 Multiplicity
23.6 Dependency topology
23.7 Coupling equivalence
23.8 Coupling as a structural invariant
23.9 Same depth, different topology
23.10 Native arity

Chapter 24. The Residue DAG

24.1 Why a chain is insufficient
24.2 Nodes
24.3 Directed descent edges
24.4 Branches
24.5 Products
24.6 Couplings
24.7 Terminal nodes
24.8 Cancellation
24.9 Replay
24.10 Reduction to irreducible ancestry

PART VI — FALSE, PARTIAL, AND QUANTUM MODULARITY

Chapter 25. False Theta Functions

25.1 False versus ordinary theta
25.2 Sign asymmetry
25.3 Modular obstruction
25.4 Completion
25.5 False modular behavior
25.6 Boundary phenomena
25.7 Rank-two false theta
25.8 Higher-rank false theta
25.9 False Jacobi structures
25.10 Mixed false modular forms

Chapter 26. Higher-Depth False Modular Forms

26.1 Parallelism with higher-depth mock theory
26.2 Rank hierarchy
26.3 Completion hierarchy
26.4 Recursive structure
26.5 Comparison with mock depth
26.6 Structural commonalities
26.7 Structural distinctions
26.8 Why depth alone cannot classify the basin

Higher-depth false modular forms are explicitly developed as a structure parallel to higher-depth mock modular forms.

Chapter 27. Partial Theta and Transitional Objects

27.1 Partial theta functions
27.2 Radial limits
27.3 Asymptotic sectors
27.4 Stokes phenomena
27.5 Relation to mock theta functions
27.6 Relation to false theta functions
27.7 Boundary transition
27.8 Classification difficulties
27.9 Carrier instability

Chapter 28. Quantum Modular Forms

28.1 Modular defects on $\mathbb Q$
28.2 Boundary-domain transformation
28.3 Error functions on the real line
28.4 Quantum cocycles
28.5 Eichler-integral realization
28.6 Radial limits
28.7 Quantum modular depth
28.8 Higher Mordell integrals
28.9 Boundary closure as a distinct geometry

Chapter 29. Higher-Depth Quantum Modularity

29.1 Recursive quantum defects
29.2 Multiple Eichler integrals
29.3 Rank-two false-theta sources
29.4 Nonholomorphic theta companions
29.5 Double-error-function coefficients
29.6 Carrier duality
29.7 Boundary depth
29.8 Obstruction ancestry beyond the upper half-plane

PART VII — COHOMOLOGICAL FAILURE

Chapter 30. Classical Cocycle Structure

30.1 Group cohomology
30.2 $1$ -cocycles
30.3 Coboundaries
30.4 Period functions
30.5 Eichler cohomology
30.6 Modular transformation defect as cocycle data
30.7 Completion and coboundary solving

Chapter 31. Mock Completion and Cohomology

31.1 Mock period functions
31.2 Completion of $1$ -cohomology
31.3 Parallel with mock modular completion
31.4 Cohomological obstruction
31.5 Homogeneous classes
31.6 Reconstruction ambiguity
31.7 Extension classes

Chapter 32. Extended Cohomology

32.1 Failure of the classical cocycle condition
32.2 Failure by products of simpler maps
32.3 Iterated integrals
32.4 Noncommutative modular symbols
32.5 False-theta motivation
32.6 Product-valued cohomological defect
32.7 Higher-order extension data
32.8 Relation to higher depth

Bringmann–Diamantis explicitly introduce an extension of standard cohomology where maps fail to be classical cocycles by products of simpler maps.

Chapter 33. From Residue DAG to Obstruction Architecture

33.1 Transformation nodes
33.2 Cocycle nodes
33.3 Product nodes
33.4 Operator-labeled edges
33.5 Coupling edges
33.6 Boundary nodes
33.7 Reconstruction kernel
33.8 Multiplicative structure
33.9 Why “complex” requires more than a DAG
33.10 Conditions required for an actual chain/cochain complex

PART VIII — THE PROPOSED OPERATOR-MEDIATED THEORY

Chapter 34. The Candidate Structural Object

34.1 Proposed architecture

\mathfrak O(f) = \langle V,E,\delta,\mathcal D,\mathcal P,B,K \rangle

34.2 $V$ : obstruction objects
34.3 $E$ : ancestry relations
34.4 $\delta$ : transformation/coboundary maps
34.5 $\mathcal D$ : differential/operator family
34.6 $\mathcal P$ : products and couplings
34.7 $B$ : closure geometry
34.8 $K$ : reconstruction kernel
34.9 Weight decorations
34.10 Multiplier decorations
34.11 Growth data
34.12 Principal-part data

Chapter 35. Reduction and Primitive Structure

35.1 Carrier artifacts
35.2 Redundant operators
35.3 Decomposable ancestry
35.4 Reconstructible intermediate nodes
35.5 Cancellation
35.6 Minimal consequential structure
35.7 Reduced architecture

\mathfrak O_{\mathrm{red}}(f)

35.8 Replay stability
35.9 Primitive depth
35.10 Primitive coupling topology

Chapter 36. Carrier Independence

36.1 Representation versus ontology
36.2 Indefinite theta carrier
36.3 Appell–Lerch carrier
36.4 Jacobi carrier
36.5 Harmonic-Maass carrier
36.6 Eisenstein carrier
36.7 Poincaré carrier
36.8 Eichler-integral carrier
36.9 False-theta carrier
36.10 Quantum boundary carrier
36.11 Carrier-ablation test
36.12 Earned equivalence

Chapter 37. Closure Geometry as Classifier

37.1 Upper-half-plane closure
37.2 Harmonic closure
37.3 Jacobi closure
37.4 Meromorphic closure
37.5 Singular closure
37.6 Lower-half-plane companion
37.7 Rational-boundary closure
37.8 Mixed closure
37.9 Local versus global closure
37.10 Closure geometry as indispensable structural data

Chapter 38. Operator Type as Classifier

38.1 Shadow-type descent
38.2 Bol-type descent
38.3 Raising/lowering
38.4 Flipping
38.5 Vignéras-type operators
38.6 Jacobi operators
38.7 Boundary operators
38.8 Cohomological differential
38.9 Operator equivalence
38.10 Operator noncommutativity as new structure

PART IX — RECONSTRUCTION

Chapter 39. The GRM Inverse Problem

39.1 Given obstruction data, reconstruct a realization
39.2 Terminal target
39.3 Reverse build
39.4 Forward build
39.5 Earliest common carrier
39.6 First noninvertible reconstruction map
39.7 Minimum completion
39.8 Kernel ambiguity
39.9 Boundary selection
39.10 Replay

Chapter 40. Reconstruction from Shadows

40.1 First shadow
40.2 Higher shadows
40.3 Why shadows alone are incomplete
40.4 Asymptotic data
40.5 Principal part
40.6 Weight
40.7 Multiplier
40.8 Growth
40.9 Reconstruction modulo homogeneous kernel

Chapter 41. Reconstruction from an Obstruction DAG

41.1 Deepest terminal object
41.2 Solve local inverse problem
41.3 Restore parent coupling
41.4 Solve next layer
41.5 Branch compatibility
41.6 Global consistency
41.7 Boundary conditions
41.8 Uniqueness
41.9 Failure localization

Chapter 42. Reconstruction Across Carriers

42.1 One obstruction structure
42.2 Theta realization
42.3 Eisenstein realization
42.4 Jacobi realization
42.5 Eichler-integral realization
42.6 False-theta realization
42.7 Quantum-boundary realization
42.8 Determine which information is genuinely carrier independent

PART X — CLASSIFICATION

Chapter 43. Structural Equivalence

43.1 Candidate equivalence

\mathfrak O_{\mathrm{red}}(f) \cong \mathfrak O_{\mathrm{red}}(g)

43.2 Preserve ancestry
43.3 Preserve operator type
43.4 Preserve coupling topology
43.5 Preserve weight/multiplier
43.6 Preserve closure geometry
43.7 Preserve reconstruction kernel
43.8 Erase nonconsequential presentation data
43.9 Structural versus analytic equivalence

Chapter 44. Classification by Primitive Depth

44.1 Formal depth
44.2 Shadow depth
44.3 Signature depth
44.4 Analytic rank
44.5 Cancellation depth
44.6 Primitive depth
44.7 Boundary depth
44.8 Cohomological depth
44.9 Why no single depth coordinate is likely sufficient

Chapter 45. Classification by Obstruction Type

45.1 Mock-type obstruction
45.2 False-type obstruction
45.3 Quantum-type obstruction
45.4 Jacobi-type obstruction
45.5 Maass-type obstruction
45.6 Mixed obstruction
45.7 Cohomological obstruction
45.8 Degenerate boundary obstruction
45.9 Unknown obstruction types

Chapter 46. Classification by Coupling Topology

46.1 Chain
46.2 Tree
46.3 General DAG
46.4 Product
46.5 Antisymmetric coupling
46.6 Higher arity
46.7 Noncommutative coupling
46.8 Extension structure
46.9 Coupling invariants

PART XI — CROSS-CARRIER COURTS

Chapter 47. Indefinite Theta versus Eisenstein

47.1 Select common depth-two object
47.2 Freeze consequences
47.3 Descend theta realization
47.4 Descend Eisenstein realization
47.5 Erase carrier data
47.6 Compare reduced obstruction architectures
47.7 Compare coupling topology
47.8 Compare reconstruction data
47.9 Carrier-independence verdict

Chapter 48. Eichler Integral versus Nonholomorphic Theta

48.1 Double Eichler realization
48.2 Double-error-function theta realization
48.3 Independent descent
48.4 Common obstruction object
48.5 Carrier-specific residue
48.6 Structural equivalence court

The supplied corpus contains examples where higher-depth quantum/false-theta companions admit both multiple-Eichler and nonholomorphic-theta realizations.

Chapter 49. Mock versus False

49.1 Match formal depth
49.2 Match rank where possible
49.3 Match operator count
49.4 Compare closure geometry
49.5 Compare obstruction type
49.6 Compare reconstruction law
49.7 Determine minimal separating invariant

Chapter 50. Mock versus Quantum

50.1 Same modular group
50.2 Different closure locus
50.3 Upper-half-plane versus rational-boundary defect
50.4 Eichler-integral commonality
50.5 Distinguishing terminal geometry
50.6 Test for over-coarse classification

Chapter 51. False versus Quantum

51.1 False theta sources
51.2 Quantum companions
51.3 Boundary realization
51.4 Shared residue ancestry
51.5 Distinct closure data
51.6 Structural overlap without basin collapse

PART XII — DISCOVERY MACHINERY

Chapter 52. TSCT Descent

52.1 Object audit
52.2 Representation ablation
52.3 Operator-family execution
52.4 Defect extraction
52.5 Coupling decomposition
52.6 Redundancy removal
52.7 Basin cover
52.8 Depth descent
52.9 Fracture detection
52.10 Bottom extraction

Chapter 53. GRM Ascent

53.1 Minimum demanded closure
53.2 Reverse build
53.3 Forward build
53.4 Common carrier
53.5 First noninvertible arrow
53.6 Narrow-path reconstruction
53.7 Boundary repair
53.8 Liftback
53.9 Replay

Chapter 54. Bidirectional Court

54.1 Start from concrete object
54.2 TSCT descent
54.3 Reduced obstruction architecture
54.4 GRM reconstruction
54.5 Compare reconstructed realization
54.6 Compare consequences
54.7 Localize reconstruction debt
54.8 Structural round-trip criterion

PART XIII — FALSIFICATION

Chapter 55. Carrier-Independence Failure

55.1 Same object gives incompatible reduced architectures
55.2 Operator structure changes irreducibly under carrier swap
55.3 Closure data cannot be transported
55.4 Reconstruction depends essentially on hidden carrier information
55.5 Consequence: reject carrier-independent claim

Chapter 56. Over-Coarse Classification Failure

56.1 Mock and false collapse incorrectly
56.2 Mock and quantum collapse incorrectly
56.3 Distinct reconstruction kernels are erased
56.4 Boundary geometry is lost
56.5 Coupling topology is lost
56.6 Consequence: enrich classifier

Chapter 57. Reconstruction Failure

57.1 Obstruction architecture insufficient
57.2 Missing principal part
57.3 Missing asymptotics
57.4 Missing multiplier
57.5 Missing extension data
57.6 Missing coupling orientation
57.7 Missing closure geometry
57.8 Consequence: architecture is descriptive, not generative

Chapter 58. Finite-Depth Failure

58.1 Infinite ancestry
58.2 Nonterminating defect sequence
58.3 Cyclic obstruction
58.4 Non-DAG behavior
58.5 Continuous depth
58.6 Accumulation of defects
58.7 Consequence: finite-obstruction architecture must be generalized

PART XIV — OPEN MATHEMATICAL PROGRAM

Chapter 59. Is There a Universal Defect Functor?

59.1 Carrier-specific defect maps
59.2 Common transformation action
59.3 Functoriality
59.4 Intertwining relations

T D_A = D_B T

59.5 Obstruction preservation
59.6 Failure of functoriality
59.7 Minimal common domain

Chapter 61. Does the DAG Upgrade to a Complex?

61.1 Candidate differential
61.2 Nilpotence
61.3 Boundary-of-boundary
61.4 Exactness
61.5 Cohomology groups
61.6 Multiplicative structure
61.7 Higher operations
61.8 Conditions under which “obstruction complex” becomes literal rather than provisional

Chapter 62. Higher Algebra Possibilities

62.1 Differential graded structure
62.2 $A_\infty$ -type structure
62.3 $L_\infty$ -type obstruction calculus
62.4 Derived extensions
62.5 Massey-type higher products
62.6 Whether higher-depth coupling demands higher algebra
62.7 Counterexamples preventing premature promotion

Chapter 63. Beyond the Current Modular Families

63.1 Automorphic integrals
63.2 Real-analytic modular graph forms
63.3 Siegel and higher-rank automorphic structures
63.4 Hilbert modular analogues
63.5 Higher-genus Jacobi phenomena
63.6 Quantum modular extensions
63.7 Period and regulator structures
63.8 Geometric generating functions
63.9 Mathematical-physics partition functions
63.10 Limits of the present framework

PART XV — FINAL SYNTHESIS

Chapter 64. The Operator-Mediated Completion Principle

64.1 Incomplete automorphic object
64.2 Transformation defect
64.3 Operator exposure
64.4 Recursive factorization
64.5 Completion
64.6 Closure
64.7 Carrier realization
64.8 Reconstruction
64.9 Classification
64.10 Falsification

Chapter 65. The Proposed Structural Hierarchy

classical modular object
↓

first-order transformation defect
↓

completed depth-one object
↓

recursive coupled defect
↓

higher-depth architecture
↓

carrier-independent reduced obstruction structure.

Chapter 66. Final Conjecture

66.1 Weak form:

A broad class of nonclassical automorphic objects can be organized by transformation defects, completions, operator actions, recursive depth, and cohomological data.

66.2 Strong form:

Different analytic carriers of the same underlying object possess equivalent reduced obstruction architectures.

66.3 Stronger form:

Mock, false, quantum, Jacobi, Maass, Eisenstein, Eichler-integral, Appell–Lerch and indefinite-theta structures occur as realizations of a finite family of operator-mediated automorphic obstruction architectures.

66.4 Reconstruction form:

\text{reduced obstruction architecture} + \text{minimal boundary data}

↑

\text{automorphic realization}

modulo a controlled homogeneous kernel.

66.5 Classification form:

\mathfrak O_{\mathrm{red}}(f) \cong \mathfrak O_{\mathrm{red}}(g)

should encode structural equivalence only if the isomorphism preserves operator type, coupling topology, closure geometry, weight/multiplier data, and reconstruction ambiguity.

66.6 Required evidence:
cross-carrier agreement
+
cross-theory separation
+
successful inverse reconstruction
+
failure-resistant heldout replay.

66.7 Current status:

DISCOVERY PROGRAM, not established unified theory.

The structural center of the monograph should therefore not be “mock modular forms.” It should be the transition

\text{failure of closure}

↓

\text{operator-exposed obstruction}

↓

\text{recursive coupling}

↓

\text{completion}

↓

\text{automorphic realization}.

Mock, false, quantum, Jacobi, Maass, Eisenstein, indefinite-theta and Eichler-integral theories then become distinct but interacting basins inside that larger architecture.

THE AUTOMORPHIC CLOSURE PROBLEM

The Automorphic Closure Problem begins from a more primitive question than “is $f$ a mock modular form?” or “which special-function representation does $f$ admit?” Fix an object $f$ , an acting group or semigroup $\Gamma$ , a weight $k$ , a multiplier or representation $\mu$ , an analytic domain $X$ , and a declared class of admissible transformations. The zero-defect condition is exact automorphic closure,

$f|_{k,\mu}\gamma=f \qquad (\gamma\in\Gamma).$

The central object is therefore not $f$ alone but the structured pair between $f$ and its action. “Automorphic” means that the object reconstructs itself under the specified action within the specified analytic category. Once that action is declared, failure of closure becomes executable rather than descriptive. Define provisionally

$\Delta_f(\gamma) := f|_{k,\mu}\gamma-f.$

Then classical closure is the special case

$\Delta_f=0,$

whereas nonclassical automorphic phenomena begin when

$\Delta_f\neq0.$

The key structural move is to treat $\Delta_f$ not as an error term to be discarded but as mathematical data. The defect may encode a missing nonholomorphic contribution, a boundary correction, a failure of a theta kernel to satisfy a differential condition, an Eichler-period contribution, a cocycle defect, or a recursively coupled lower-depth structure. The supplied literature supports several such regimes: false-theta completion is explicitly used to compute an obstruction to modularity, higher-depth quantum modular forms possess structured errors of modularity, and higher-depth mock modularity is defined recursively through lower-depth completed data.

The defect cannot be treated as a carrier-free scalar. Its meaning depends on the transformation environment. A more faithful candidate is the defect packet

$\mathfrak D(f) = \left\langle \Delta_f,\Gamma,k,\mu,X,B,\mathcal C \right\rangle,$

where $B$ records the geometry on which closure is demanded and $\mathcal C$ records the admissible class of repairs or completions. This is necessary because superficially similar equations can describe mathematically different phenomena. A defect on the upper half-plane, a defect controlled only at rational boundary points, and a defect arising from elliptic transformation in a Jacobi variable do not become identical merely because each can be written symbolically as $f|\gamma-f$ . Likewise, two objects may have equally nonzero transformation defects but inhabit different closure geometries. The structural classifier must therefore preserve not merely whether closure fails, but where it fails, how it fails, and what class of correction is allowed to discharge the failure.

Completion is the first major response to nonzero defect. The generic problem is to construct

$\widehat f=f+R$

such that

$\Delta_{\widehat f}=0.$

Equivalently, if

$\rho:=\Delta_f,$

then one seeks a correction satisfying

$\Delta_R=-\rho.$

This turns completion into an inverse problem. The correction $R$ is mathematically significant because it records the information absent from the original holomorphic, combinatorial, theta, Eisenstein, Jacobi, or boundary carrier. In mock modular settings that missing structure may appear through nonholomorphic Eichler integrals; in indefinite-theta settings it may arise through generalized error functions smoothing sign kernels; in Maass–Jacobi settings the completion may enlarge the original object into a real-analytic modular framework. Bringmann’s 2026 work on Ramanujan/Lim identities explicitly constructs such completions and embeds the resulting functions as singular harmonic Maass–Jacobi forms. The mathematical point is not that every correction is the same, but that completion repeatedly functions as a mechanism for restoring a transformation law that the original carrier cannot satisfy by itself.

Completion is generally nonunique. If

$\Delta_H=0,$

then

$\Delta_{R+H} = \Delta_R.$

Hence $R$ and $R+H$ discharge the same defect. Let

$K:=\ker\Delta.$

Then a solution to the completion problem is naturally defined only modulo $K$ . The solution space has the schematic form

$R+K.$

This immediately defeats any theory claiming that the first shadow or first transformation defect is a complete classifier. The same defect may admit distinct completions differing by an automorphically closed homogeneous contribution. Reconstruction therefore requires additional data such as principal parts, growth, cusp conditions, asymptotics, normalization, boundary values, or equivalent structural constraints. The correct inverse problem is not

$\rho\mapsto f$

but rather

$\left\langle \rho, \text{boundary data}, \text{growth}, \text{normalization} \right\rangle \longmapsto \widehat f \pmod K.$

This distinction between obstruction data and reconstruction data is foundational.

The shadow should consequently be interpreted as one particular defect readout rather than the universal primitive. In a depth-one harmonic-Maass situation an antiholomorphic differential operator can expose a modular shadow. But the broader corpus contains Bol operators, shadow operators, flipping operators, raising operators, Vignéras-type operators, Jacobi differential operators, and boundary-error structures. Bringmann’s work explicitly treats Bol and shadow operators as controlling different canonical pieces of harmonic Maass forms and introduces a flipping operator exchanging those roles. Bringmann–Kane use a Maass raising operator constructively: the operator maps quadratic-form Poincaré-series sources to objects whose modularity and Laplace-eigenvalue behavior become structurally transparent. The evidence therefore favors an operator family

$\mathcal D = \{D_1,\ldots,D_m\}$

over one privileged scalar operator. An object can then be studied through its operator response profile

$\mathcal R_{\mathcal D}(f) = \left\{ D_i f \right\}_{i=1}^{m},$

together with kernels, images, compositions, and potentially commutators

$[D_i,D_j] = D_iD_j-D_jD_i.$

$[D_i,D_j]f\neq0,$

the order of structural descent or reconstruction matters. Such order sensitivity is itself information and cannot be compressed into a scalar “depth.”

Higher depth changes the closure problem from a single defect problem into an ancestry problem. Bringmann–Nazaroglu’s recursive definition places a depth- $d$ completed object under antiholomorphic differentiation into combinations involving depth- $(d-1)$ completions and ordinary modular forms. Schematically,

$\widehat f_d$

descends to

$\sum_j \widehat f_{d-1,j}\otimes g_j,$

not necessarily to a single $\widehat f_{d-1}$ . The natural structure is therefore branching. A simple chain

$\rho_d \to \rho_{d-1} \to \cdots \to \rho_0$

throws away multiplicity, tensor structure, coefficients, sign orientation, and coupling. The more faithful object is a directed ancestry architecture in which nodes represent defects or lower-depth objects and edges record the operators or transformation mechanisms exposing them. The architecture may branch,

$\rho_d \longrightarrow \{\rho_{d-1}^{(1)},\rho_{d-1}^{(2)},\ldots\},$

and descendants may occur only in specific coupled combinations. This is why the generic term “residue DAG” is more accurate than “residue chain.”

Formal depth is still too coarse. The same paper explicitly notes that the product of two depth-one mock modular forms is trivially depth two. Therefore

$d_{\mathrm{formal}}(f)=2$

does not imply that $f$ contains an irreducible depth-two phenomenon. A structural theory needs to separate composite depth from primitive depth. Introduce provisionally a decomposable sector

$\mathrm{Dec}_d$

generated by licensed products, tensors, or reconstructions from lower-depth structures. Then the meaningful residue is not $\rho_d$ itself but its class

$[\rho_d] \in \mathcal O_d/\mathrm{Dec}_d.$

A candidate primitive depth is

$d_{\mathrm{prim}}(f) = \max \left\{ d: [\rho_d]\neq0 \right\}.$

This is not established by the supplied literature; it is the natural next invariant forced by the distinction between trivial and nontrivial higher depth. It also blocks an obvious self-validation failure: merely multiplying lower-depth objects cannot be counted automatically as discovery of a new structural level.

The 2026 Eisenstein-coupling construction materially weakens the sovereignty of indefinite-theta signature as a definition of depth. Higher-depth mock modularity had largely been generated through indefinite theta functions of general signature; Bringmann–Nazaroglu produce depth-two mock modular forms through coupled Eisenstein series as an independent construction. The structural consequence is precise:

$\text{signature} \neq \text{universal depth ontology}.$

Signature may generate a hierarchy of higher-depth behavior, but another carrier can produce the same formal level. Thus the carrier and the resulting closure architecture must be distinguished. One can write schematically

$\text{indefinite theta} \longrightarrow \mathfrak O$

and independently

$\text{Eisenstein coupling} \longrightarrow \mathfrak O',$

then ask whether

$\mathfrak O_{\mathrm{red}} \cong \mathfrak O'_{\mathrm{red}}.$

Only such a comparison can earn a claim of carrier independence.

Carrier plurality is visible elsewhere. Higher-depth false/quantum structures can admit companion realizations both as multiple Eichler integrals and as nonholomorphic theta series with double-error-function coefficients. A common partition-source algebra can also give rise to theta functions, quasi-Jacobi forms, Appell–Lerch sums, and false theta functions. These examples suggest that analytic representation is often not the deepest structural layer. The same source can support multiple carriers, and the same transformation architecture can potentially be realized through distinct analytic constructions. But “potentially” matters: carrier independence is not established merely because two formulas resemble one another. One must identify a transport map preserving the consequential structure and test it by reconstruction or replay.

False modularity supplies a necessary adversarial court because it prevents the theory from equating “recursive completion” with “mock modularity.” Higher-depth false modular forms are explicitly developed as a structure parallel to higher-depth mock modular forms. Therefore both theories may exhibit recursive depth and completion while remaining mathematically distinct. If a proposed classifier uses only

$d,$

or only

$\Delta_f,$

or only a first shadow, it will collapse distinct theories. At minimum, the classifier must retain the type of obstruction, the operator generating or exposing it, and the geometry on which closure occurs. The same constraint is sharpened by quantum modularity: a quantum modular defect can live naturally on rational or boundary data, so an interior completed object and a boundary-regularized object cannot be identified merely because their transformation discrepancies have similar algebraic shape.

Closure geometry therefore belongs inside the invariant. Write

$B(f) = \text{locus on which the demanded closure is evaluated}.$

Possible regimes include the upper half-plane, a Jacobi domain, a singular or meromorphic domain, a lower-half-plane companion, a chamber determined by wall data, or a rational boundary locus. Structural equivalence should require compatibility of these regimes whenever they affect consequences. Thus

$\mathfrak O(f)\cong\mathfrak O(g)$

cannot be licensed solely from an isomorphism of underlying DAGs if

$B(f)\not\sim B(g).$

The closure geometry is not presentation metadata when changing it changes which transformation law is meaningful.

The cohomological evidence suggests an even deeper organization. Bringmann–Diamantis–Raum developed a completion technique for $1$ -cohomology explicitly parallel to the completion theory of mock modular forms. Bringmann–Diamantis later introduced an extension of standard cohomology in which maps fail to be classical cocycles by products of simpler maps. This is structurally close to higher-depth behavior. Classical cocycle closure has a schematic form

$\delta c=0.$

Extended failure can instead look like

$\delta c = c_1c_2$

or more generally a sum of products or couplings of lower-complexity objects. This suggests that higher-depth automorphic failure may be understood not simply as repeated differentiation but as iterated failure of closure in a multiplicative cohomological environment. The key object then becomes the law governing how defects factor, couple, and terminate.

This evidence does not yet justify calling the universal object a literal cochain complex. A genuine complex would require maps such as

$C_d \xrightarrow{\partial_d} C_{d-1}$

satisfying

$\partial_{d-1}\partial_d=0.$

The current corpus supports branching, products, differential operators, and recursive descent, but not a universal nilpotent differential valid across all the relevant carriers. The safe candidate is therefore an extended obstruction architecture, perhaps represented provisionally by

$\mathfrak O(f) = \left\langle V,E,\delta,\mathcal D,\mathcal P,B,K \right\rangle.$

Here $V$ denotes obstruction objects, $E$ ancestry relations, $\delta$ transformation or coboundary data, $\mathcal D$ the operator family, $\mathcal P$ products and couplings, $B$ closure geometry, and $K$ the homogeneous reconstruction kernel. Weight, multiplier, growth, principal part, and asymptotic data can be attached as decorations when they are load-bearing.

Raw $\mathfrak O(f)$ will generally contain carrier-specific material, so the serious structural target is a reduced object

$\mathfrak O_{\mathrm{red}}(f).$

Reduction should not mean arbitrary simplification. It should be earned through ablation and reconstruction. A component can be removed only if the demanded consequences survive and the removed information can be reconstructed from the retained structure. Candidate reduction operations include elimination of decomposable depth, deletion of redundant operators, collapse of reconstructible intermediate nodes, and erasure of carrier-specific presentation details. But irreducible coupling, closure geometry, multiplier behavior, and reconstruction ambiguity must survive whenever removing them changes consequences. The test is therefore not “is this notation elegant?” but

$\text{remove }x$

↓

$\text{replay closure and reconstruction obligations}.$

If all obligations survive, $x$ is nonconstitutive at the declared grain. If not, it must be restored.

The carrier-independence conjecture can now be stated sharply. Suppose $f_A$ and $f_B$ are two valid realizations of the same mathematical object in different carriers. Then the theory predicts, not assumes,

$\mathfrak O_{\mathrm{red}}(f_A) \cong \mathfrak O_{\mathrm{red}}(f_B).$

The isomorphism must preserve whatever data remain consequential: operator ancestry, coupling topology, weights or multiplier relations, closure locus, and reconstruction kernel. This is the positive court. There is an equally important negative court. Take genuinely distinct families such as mock, false, and quantum modular objects with matched superficial features. A viable classifier must not produce

$\mathfrak O_{\mathrm{red}}(\text{mock}) \cong \mathfrak O_{\mathrm{red}}(\text{false}) \cong \mathfrak O_{\mathrm{red}}(\text{quantum})$

when their closure geometries or reconstruction laws differ. Carrier independence and cross-theory separation must both hold. A theory satisfying only the first condition is too coarse; one satisfying only the second remains carrier-bound.

The strongest test is reconstruction. Given only

$\mathfrak O_{\mathrm{red}}(f)$

and the minimum boundary packet

$\mathcal B(f) = \left\langle k,\mu, \text{growth}, \text{principal part}, \text{asymptotics} \right\rangle,$

can one recover a completed realization

$\widehat f$

modulo the predicted kernel $K$ ? The desired inverse statement has the form

$\left\langle \mathfrak O_{\mathrm{red}}(f), \mathcal B(f) \right\rangle$

↓

$\widehat f \pmod K.$

If this succeeds across independent carriers, the obstruction architecture is generative. If it repeatedly fails unless hidden carrier-specific information is restored, then the supposed carrier-independent ontology has failed. This reconstruction criterion is stricter than descriptive classification and is therefore the appropriate court for any claim that the closure architecture is fundamental.

The discovery boundary is similarly precise. Recognizing a known mock shadow and attaching a known completion is not structural discovery. A discovery event begins when the current closure language is exhausted. Schematically,

$\text{current carrier}$

↓

$\text{persistent defect}$

↓

$\text{known repairs fail}$

↓

$\text{irreducible obstruction remains}$

↓

$\text{new operator, coupling, or closure structure is forced}$

↓

$\text{new completion closes held-out consequences}.$

Only the final transition earns a successor structure. Merely renaming the residue, increasing special-function rank, or choosing a more elaborate carrier does not.

The Automorphic Closure Problem can therefore be formulated as a bidirectional program. The descent direction begins from an explicit mathematical object and extracts its minimum consequential failure architecture:

$f$

↓

$\Delta_f$

↓

$\mathcal D\text{-response}$

↓

$\text{recursive coupling}$

↓

$\mathfrak O_{\mathrm{red}}(f).$

The ascent direction begins from that reduced architecture and attempts to reconstruct admissible realizations:

$\mathfrak O_{\mathrm{red}}(f)$

↓

$\text{inverse defect equations}$

↓

$\text{boundary and growth constraints}$

↓

$\widehat f \pmod K.$

The two directions meet only if the descent output contains enough information to make the ascent possible.

The resulting research conjecture is narrower and stronger than saying that all post-Ramanujan modular phenomena are “the same.” They are not. The proposed commonality lies at the level of structured closure failure. A substantial class of nonclassical automorphic objects may be organized by a finite or finitely generated architecture of transformation defects, operator-mediated descendants, multiplicative or coupled ancestry, closure geometry, and reconstruction ambiguity. Mock, false, quantum, Jacobi, Maass, Eisenstein, indefinite-theta, Appell–Lerch, and Eichler-integral realizations would then be different basins of this broader architecture, distinguished precisely by the data that survive carrier ablation.

The compact mathematical target is therefore not

$\text{classify functions by name},$

but

$\text{classify closure failures by structure}.$

More explicitly,

$\text{AUTOMORPHIC ACTION}$

↓

$\text{TRANSFORMATION-CLOSURE DEFECT}$

↓

$\text{OPERATOR-MEDIATED EXPOSURE}$

↓

$\text{RECURSIVE / COUPLED OBSTRUCTION}$

↓

$\text{CLOSURE GEOMETRY}$

↓

$\text{REDUCED CARRIER-INDEPENDENT ARCHITECTURE}$

↓

$\text{INVERSE COMPLETION}$

↓

$\text{AUTOMORPHIC REALIZATION}.$

The supplied evidence establishes the ingredients, not the universal synthesis. Completion, modular obstruction, recursive higher depth, operator families, alternate carriers, and extended cohomological failure are all present in the literature. What remains unresolved is whether these ingredients admit one mathematically natural reduced obstruction architecture that is simultaneously carrier-independent, fine enough to separate distinct automorphic theories, and strong enough to reconstruct their completed realizations. That unresolved triple requirement—invariance, separation, reconstruction—is the actual Automorphic Closure Problem.

THE AUTOMORPHIC CLOSURE PROBLEM

This should be the conceptual entrance to the theory. It should not begin with mock modular forms. It should begin with the more primitive question:

$\text{When does an object close under its demanded automorphic transformation law?}$

Everything else—mockness, false modularity, quantum modularity, completion, shadow, higher depth, cohomological failure—should appear as different answers to what happens when closure fails.

A strong structure is:

AUTOMORPHIC ACTION
↓
EXPECTED CLOSURE
↓
ACTUAL TRANSFORMATION
↓
DEFECT
↓
DEFECT TYPE
↓
REPAIR / COMPLETION / BOUNDARY REINTERPRETATION
↓
CLOSURE OR PERSISTENT OBSTRUCTION

Chapter 1. Automorphic Closure as the Primitive Problem

1.1 The closure question

Begin with an object $f$ , an acting group $\Gamma$ , and a transformation law.

For $\gamma\in\Gamma$ ,

$f|_{k,\mu}\gamma$

is the transformed object.

Classical automorphic closure means

$f|_{k,\mu}\gamma=f$

for every admissible $\gamma$ .

The primary object of study is therefore not “modularity.”

It is the relation

$\text{object} + \text{action} + \text{closure condition}.$

1.2 Closure requires a declared action

Closure is meaningless without specifying:

acting group;
representation or multiplier;
weight;
variable space;
analytic category;
domain;
growth conditions.

Thus

$\text{CLOSED}$

is never an intrinsic label on $f$ alone.

It is shorthand for

$\text{CLOSED}(f\mid\Gamma,k,\mu,\mathcal A,B).$

1.3 Exact versus effective closure

Distinguish:

$\text{exact closure}$

from

$\text{closure after completion}$

from

$\text{boundary closure}$

from

$\text{closure modulo controlled defect}.$

This distinction prevents mock, false, and quantum modularity from being collapsed into one undifferentiated “almost modular” class.

1.4 Closure as a reconstruction constraint

A transformation law imposes a reconstruction requirement:

given $f$ in one coordinate domain,

can the transformed value be recovered from $f$ itself under the declared automorphic law?

If yes:

$\text{closure}.$

If not:

$\text{obstruction}.$

1.5 Local versus global closure

An object may satisfy transformation behavior:

locally;
on a chamber;
away from singular loci;
at cusps;
on rational boundary points;
only after analytic continuation.

Therefore

$\text{local closure} \not\Rightarrow \text{global closure}.$

This should be treated as a standing law throughout the monograph.

Chapter 2. The Transformation-Closure Defect

2.1 Defect as the first nonclosed object

Define the basic candidate defect

$\Delta_f(\gamma) = f|_{k,\mu}\gamma-f.$

Then:

$\Delta_f=0$

means exact closure.

The first nonzero $\Delta_f$ is the first exposed obstruction to closure.

2.2 Defect is relational

The same function may have different defects under different:

groups;
weights;
multipliers;
domains;
admissible transformation laws.

So the true object is not merely

$\Delta_f.$

It is a defect packet.

2.3 The defect packet

Introduce

$\mathfrak D(f) = \langle \Delta_f, \Gamma, k, \mu, X, B, \mathcal C \rangle.$

Where:

$\Gamma$

is the acting group,

$k$

the weight,

$\mu$

the multiplier or representation,

$X$

the analytic domain,

$B$

the closure locus or boundary geometry,

and

$\mathcal C$

the admissible correction/completion class.

2.4 Zero defect

Classical automorphic case:

$\Delta_f(\gamma)=0.$

This becomes the depth-zero reference state.

2.5 Removable defect

There may exist $R$ such that

$\widehat f=f+R$

and

$\Delta_{\widehat f}=0.$

Then the defect is removable by completion.

2.6 Persistent defect

If no admissible $R\in\mathcal C$ yields closure, then the current completion ontology is insufficient.

This is the first true discovery pressure.

2.7 Boundary defect

A defect may fail to vanish in the interior but admit a controlled boundary realization.

This is structurally relevant to quantum modular phenomena.

2.8 Singular defect

Poles, walls, branch loci, discontinuity sets, and singular supports may carry the transformation failure.

The support of the defect is therefore part of its structure.

2.9 Distributional defect

For sign kernels and discontinuous data, the relevant failure can live in a distributional or wall-supported sense.

This becomes essential in indefinite-theta settings.

2.10 Defect magnitude versus defect type

Two defects may be equally nonzero but structurally different.

Hence classification cannot be based on

$|\Delta_f|$

or any scalar defect score.

The classifier must preserve type.

Chapter 3. Failure Modes of Automorphic Closure

3.1 Holomorphic failure

The holomorphic object does not transform correctly.

A nonholomorphic correction may repair it.

This is the canonical mock-modular pattern.

3.2 Sign-kernel failure

Restricting an indefinite theta sum restores convergence but destroys exact modular transformation.

The resulting failure is repaired by smoothing the kernel.

3.3 False-theta failure

False theta functions resemble theta functions but have different modular behavior; their completion theory explicitly exposes an obstruction to modularity.

This is a critical counterexample to identifying “nonzero modular defect” with mock modularity.

3.4 Quantum boundary failure

Quantum modular forms move the relevant defect to a boundary/rational-domain problem.

Higher-depth examples possess errors of modularity represented by higher integral structures.

Therefore:

$\text{closure locus}$

is part of the ontology.

3.5 Jacobi failure

The object may satisfy only part of the modular/Jacobi transformation system.

Elliptic and modular variables must remain distinguished.

3.6 Harmonic failure

A holomorphic object may fail classical modularity but become part of a real-analytic harmonic object.

This introduces Laplacian structure as an additional constraint.

3.7 Eisenstein-type failure

Objects may behave like Eisenstein series while only their nonholomorphic completions transform modularly or quasimodularly.

3.8 Cohomological failure

The transformation data may fail the ordinary cocycle condition.

More strongly, that failure may decompose into products of simpler maps, as in the extended cohomological framework of Bringmann–Diamantis.

This is the strongest evidence that higher automorphic defect may be multiplicative rather than linear.

Chapter 4. Completion as Closure Repair

4.1 The completion equation

The basic repair problem is

$\widehat f = f+R.$

Demand:

$\Delta_{\widehat f}=0.$

Then $R$ is not decorative data.

It is the structure required to discharge the defect.

4.2 Completion is an inverse problem

Given

$\rho=\Delta_f,$

find $R$ satisfying

$\Delta_R=-\rho.$

The problem is therefore:

defect
↓
inverse transformation equation
↓
correction
↓
closure.

4.3 Minimal completion

Not every correction should count as structurally equivalent.

The natural question is:

what is the minimum correction necessary to restore the demanded closure?

This leads to a minimality program.

4.4 Nonuniqueness

$\Delta_H=0,$

then

$R+H$

repairs the same defect.

Thus completion is generally determined only modulo a homogeneous closed sector.

4.5 Reconstruction kernel

Define

$K = \ker\Delta.$

Then a completion lives in an affine space

$R+K.$

This is why defect data alone does not usually determine the completed object.

4.6 Boundary conditions

Additional information may select a preferred completion:

principal part;
growth;
asymptotics;
normalization;
cusp behavior;
boundary values.

4.7 Completion versus extension

Sometimes completion merely repairs an object within an existing analytic class.

Sometimes it forces enlargement of the class itself.

That difference should be explicit.

4.8 Completion versus discovery

Known repair:

$\rho \rightarrow R_{\text{known}}$

is not discovery.

Discovery occurs only when the current correction language fails and a new structure is forced.

Chapter 5. Closure Geometry

5.1 Why “where” matters

Transformation closure can occur on:

$\mathbb H,$

a Jacobi domain,

a lower half-plane,

a cusp neighborhood,

$\mathbb Q,$

or another boundary locus.

These cannot be identified without evidence.

5.2 Interior closure

Classical modular transformation on the upper half-plane.

5.3 Harmonic closure

Real-analytic extension satisfying modular transformation plus differential constraints.

5.4 Jacobi closure

Closure under both modular and elliptic transformation laws.

5.5 Singular closure

Closure away from controlled poles or singularities.

5.6 Boundary closure

Transformation discrepancy becomes well-behaved only at rational or real boundary points.

5.7 Lower-half-plane companions

Some quantum/false-theta constructions admit companions across the real axis.

5.8 Chamber closure

For wall-dependent theta kernels, behavior can depend on chamber.

5.9 Closure geometry as an invariant

Two objects should not be declared structurally identical solely because their defect algebra is isomorphic if their closure loci differ consequentially.

Chapter 6. The Operator View of Closure

6.1 Operators expose what the transformation law hides

Transformation defect provides one observation.

Differential operators provide another.

Thus an automorphic object should be probed by an operator family.

6.2 Shadow-type operators

Expose lower-complexity modular data.

6.3 Bol-type operators

Probe the complementary holomorphic component.

6.4 Raising operators

Move toward higher-weight or more structured realizations.

Bringmann–Kane explicitly use a Maass raising operator constructively to realize functions from quadratic-form Poincaré series.

6.5 Flipping operators

Exchange canonical components of harmonic Maass forms. Bringmann’s corpus identifies Bol, shadow, and flipping operators as distinct structural controls.

6.6 Vignéras-type operators

Probe whether a theta kernel satisfies the differential condition required for modular transformation.

6.7 Operator family

The evidence does not justify one universal scalar operator.

Use instead

$\mathcal D = \{D_1,\ldots,D_m\}.$

6.8 Operator response profile

Associate

$\mathcal R_{\mathcal D}(f) = \{D_i f\}_{i=1}^{m}.$

This may distinguish structures having similar transformation defects.

6.9 Noncommuting operators

$D_iD_jf \neq D_jD_if,$

the commutator reveals additional coupling.

6.10 Closure under the operator family

A larger structural notion may require compatibility not only with $\Gamma$ but with $\mathcal D$ .

Chapter 7. Recursive Closure Failure

7.1 First-order defect

$f$

↓

$\rho_1.$

7.2 Defect of the defect

If $\rho_1$ is itself nonclosed:

$\rho_1$

↓

$\rho_2.$

7.3 Higher-depth recursion

Continue:

$\rho_2$

↓

$\rho_3.$

This motivates depth.

7.4 Why depth is not automatically a chain

Higher-depth mock modularity can produce sums of tensor-product descendants rather than one successor object.

Therefore:

chain
→ too weak.

DAG
→ better.

7.5 Branching

One parent defect may generate several descendants.

7.6 Coupling

Descendants may occur only through particular linear, tensor, or antisymmetric combinations.

7.7 Decomposable depth

Products of lower-depth objects can create formal higher depth.

Bringmann–Nazaroglu explicitly note this for depth two.

7.8 Primitive depth

Define provisionally:

$d_{\mathrm{prim}} = \text{maximal nondecomposable obstruction depth}.$

This remains a discovery target.

Chapter 8. Cohomological Closure

8.1 Transformation law as cocycle structure

Transformation defects naturally resemble cocycle data.

8.2 Ordinary cocycle condition

Classical consistency conditions constrain the defect.

8.3 Coboundary repair

Completion can be interpreted as solving a coboundary problem.

8.4 Cohomological completion

Bringmann–Diamantis–Raum explicitly developed completion for $1$ -cohomology in parallel with mock modular completion.

8.5 Extended cocycle failure

Bringmann–Diamantis later consider maps whose failure to be classical cocycles is expressed by products of simpler maps.

8.6 Higher depth as cohomological ancestry

This suggests:

cocycle
↓
failure
↓
product of lower failures
↓
iterated extension data.

8.7 Why ordinary complexes may be insufficient

If the failure law is multiplicative,

$\partial^2=0$

need not be the operative structure.

Therefore the term “complex” must remain provisional until the actual differential law is established.

8.8 Candidate alternatives

Possible structures to test—not assert:

filtered DAG;
differential graded algebra;
extension tower;
$A_\infty$ -like system;
higher cohomological object.

Chapter 9. The Automorphic Closure Taxonomy

9.1 Classical modular closure

$\Delta=0.$

9.2 Mock closure

Holomorphic failure repaired by a nonholomorphic completion.

9.3 False modular closure

Distinct modular obstruction and correction regime.

9.4 Quantum closure

Defect controlled on boundary/rational locus.

9.5 Jacobi closure

Simultaneous modular and elliptic compatibility.

9.6 Harmonic-Maass closure

Modular completion plus differential equation.

9.7 Eisenstein-mediated closure

Completion through Eisenstein or Poincaré-type construction.

9.8 Mixed closure

Multiple modular species occur simultaneously.

The supplied corpus explicitly contains generating functions involving modular, mock theta, mock Maass theta, and false theta structures at once.

9.9 Unknown closure types

The theory must leave room for defects not fitting current named classes.

Chapter 10. The Automorphic Closure Problem as a Research Program

10.1 Input

An object $f$ with incomplete or unknown transformation structure.

10.2 Stage 1 — declare the action

Specify

$\Gamma,k,\mu,X,B.$

10.3 Stage 2 — measure closure

Compute

$\Delta_f.$

10.4 Stage 3 — localize the defect

Determine:

support;
boundary;
singularity;
rank;
coupling;
operator sensitivity.

10.5 Stage 4 — descend the defect

Apply admissible operators.

10.6 Stage 5 — identify recursion

Determine whether the defect contains lower-complexity defect objects.

10.7 Stage 6 — remove decomposable structure

Distinguish primitive from product-generated depth.

10.8 Stage 7 — solve the inverse problem

Construct a candidate completion.

10.9 Stage 8 — characterize the kernel

Determine all homogeneous ambiguity.

10.10 Stage 9 — test carrier independence

Recompute the structure in an independent analytic realization.

10.11 Stage 10 — classify closure type

Only after these steps assign the object to a basin.

Chapter 11. Falsification of the Closure Architecture

11.1 Defect too coarse

If mock, false, and quantum objects become identical under the classifier, the classifier has failed.

11.2 Closure geometry omitted

If boundary and interior closure are conflated, the theory is too coarse.

11.3 Operator dependence is irreducibly carrier-specific

Then carrier independence fails.

11.4 Completion cannot be reconstructed

Then the obstruction structure is descriptive rather than generative.

11.5 Formal depth misclassifies products

Then raw depth is not structural.

11.6 Infinite ancestry

Then finite-depth architecture is insufficient.

11.7 Different carriers produce incompatible reduced structures

Then the proposed invariant is not carrier independent.

Chapter 12. Primary Conjecture of the Automorphic Closure Problem

12.1 Weak form

A substantial class of nonclassical automorphic objects can be organized by their transformation-closure defects.

12.2 Strong form

Their defects possess finite operator-mediated recursive structure.

12.3 Carrier-independent form

After eliminating representation-dependent data, independent carriers of the same object yield equivalent reduced obstruction architectures.

12.4 Cohomological form

The surviving architecture can be expressed through generalized cocycle failure, extension, and repair data.

12.5 Reconstruction form

Given

$\mathfrak O_{\mathrm{red}}(f)$

plus minimal boundary and normalization data, one can reconstruct an admissible completed realization modulo a controlled homogeneous kernel.

12.6 Classification form

Mock, false, quantum, Jacobi, Maass, Eisenstein and related structures are distinguished not primarily by historical names or special functions, but by:

$\text{defect type}$

↓

$\text{operator ancestry}$

↓

$\text{coupling topology}$

↓

$\text{closure geometry}$

↓

$\text{reconstruction law}.$

12.7 Status

SUPPORTED:

completion, transformation obstruction, recursive depth, operator families, carrier plurality, and cohomological failure all occur in the supplied literature.

DIRECT INFERENCE:

they form a common structural pattern.

UNRESOLVED:

whether there exists a universal carrier-independent automorphic obstruction architecture.

DISCOVERY TARGET:

construct that architecture, prove cross-carrier invariance, prove cross-theory separation, and reconstruct known completions from it.

The correct conceptual endpoint of this part is therefore:

$\text{AUTOMORPHIC CLOSURE}$

is the zero-defect reference state.

$\text{NONCLASSICAL AUTOMORPHY}$

is not one phenomenon.

It is the structured study of the different ways closure fails, how that failure recursively decomposes, and what minimal additional structure restores or relocates closure.

Ramanujan and THE AUTOMORPHIC CLOSURE PROBLEM

Ramanujan’s mock theta functions can be reread as the earliest decisive instance of the Automorphic Closure Problem: a family of holomorphic $q$ -series exhibited enough theta-like and modularly consequential behavior to demand explanation, while the available holomorphic theta-function language did not provide the correct closure law. The modern theory confirms that this was not merely a problem of finding a clever identity inside the existing carrier. Bringmann–Nazaroglu explicitly locate the modern concept of mock modular forms in the understanding of Ramanujan’s mock theta functions through Zwegers’ indefinite theta theory and harmonic Maass forms, and describe a mock modular form as a holomorphic function that is not itself modular but can be completed to a real-analytic modular object by adding nonholomorphic Eichler-integral-type contributions. In closure language, the historical transition is therefore

$f_{\mathrm{Ram}}$

with

$\Delta_{f_{\mathrm{Ram}}}\neq0,$

followed much later by the construction of a correction $R$ such that

$\widehat f_{\mathrm{Ram}} = f_{\mathrm{Ram}}+R$

and

$\Delta_{\widehat f_{\mathrm{Ram}}}=0$

in the enlarged real-analytic modular carrier.

The important point is that Ramanujan encountered the phenomenon from the source side, not from the completed automorphic side. The source objects were explicit $q$ -series. Their remarkable behavior was visible before the ambient structure capable of closing them was known. In modern notation one starts with an automorphic action and computes

$\Delta_f(\gamma) = f|_{k,\mu}\gamma-f.$

Ramanujan did not possess this later completion formalism, but structurally his problem can be reconstructed as follows: the source $q$ -series had consequential asymptotic and cusp behavior suggesting theta-like organization, yet the source could not simply be placed inside the known holomorphic theta class. Bringmann–Rolen’s later work explicitly returns to Ramanujan’s original definition through the behavior of mock theta functions at cusps and radial limits, which shows that the boundary behavior was not incidental to the original phenomenon. The Automorphic Closure Problem therefore interprets Ramanujan’s discovery not as “an unknown modular form” but as an object for which the demanded closure data were only partially visible in the source representation.

The first structural distinction is consequently

$\text{source behavior} \neq \text{completed automorphic behavior}.$

The holomorphic $q$ -series is not the completed modular object. If $f$ denotes the holomorphic mock part, then modern completion theory supplies

$\widehat f=f+R,$

where $R$ is nonholomorphic. The decisive structural fact is not merely that $R$ exists. It is that $R$ carries exactly the transformation information absent from $f$ . Thus

$\Delta_f = -\Delta_R.$

The failure of $f$ and the corrective behavior of $R$ are dual descriptions of the same closure debt. What appeared historically as anomalous theta-like behavior becomes, in the completed theory, a controlled automorphic defect.

This changes the interpretation of the word “mock.” In an object-first classification, “mock” looks like the name of a special family. In the Automorphic Closure Problem, it identifies one basin of a more general relation:

$\text{holomorphic carrier}$

↓

$\text{nonzero transformation defect}$

↓

$\text{nonholomorphic correction}$

↓

$\text{real-analytic automorphic closure}.$

The Bringmann–Nazaroglu formulation makes this precise at the modern level: the holomorphic object is not modular, while its real-analytic completion is modular and its antiholomorphic derivative is constrained by modular data. The closure problem therefore identifies the completed object $\widehat f$ , not the holomorphic source $f$ , as the object satisfying the full transformation law.

This does not mean that $f$ is ontologically secondary. The opposite problem is equally important: why does the completed object split into a distinguished holomorphic source and a nonholomorphic correction? In schematic form,

$\widehat f = f+R$

contains two structurally different components. The source $f$ contains the $q$ -series information that Ramanujan actually discovered; $R$ supplies the missing closure data. If one erases $f$ , one loses the discovery source. If one erases $R$ , one loses automorphic closure. The primitive object is therefore better regarded as a structured extension

$0 \longrightarrow \mathcal K \longrightarrow \widehat{\mathcal M} \longrightarrow \mathcal H \longrightarrow 0$

schematically, where the completed automorphic space $\widehat{\mathcal M}$ contains information whose holomorphic projection lies in $\mathcal H$ , while the missing or homogeneous sector $\mathcal K$ controls ambiguity and correction. This exact-sequence notation is structural shorthand here, not a claim that every mock family is literally described by one universal exact sequence.

The shadow becomes intelligible inside this extension picture. The shadow is not “the missing half” in a naive additive sense. Rather, an appropriate antiholomorphic differential operator applied to the completion exposes lower-complexity modular information. Symbolically,

$D_{\mathrm{sh}}\widehat f = g,$

where $g$ is modular data of the relevant weight. Thus

$\widehat f$

↓

$g$

is an operator-mediated descent from a completed nonclassical object to ordinary modular structure. The historical Ramanujan problem can then be recast as an inverse problem: given the holomorphic source $f$ and evidence of a transformation anomaly, can one infer the existence and form of $g$ , then reconstruct a correction $R$ satisfying the required transformation equation? This is the point at which the Automorphic Closure Problem becomes a reconstruction theory rather than a retrospective taxonomy.

In GRM terms, the reconstruction problem would begin from the demanded terminal condition

$\Delta_{\widehat f}=0$

and reverse-build what must be supplied to satisfy it. Forward from Ramanujan’s source one has only $f$ and its observed consequences. Reverse from closure one requires a correction $R$ . The earliest comparison carrier is therefore the transformation defect:

$\Delta_f$

on the source side and

$-\Delta_R$

on the completion side. The first noninvertible step is where the original holomorphic language cannot reconstruct the missing contribution internally. The post-Ramanujan program then supplies a successor carrier in which

$f+R$

is a legitimate object. Your earlier GRM formulation captures exactly this intended reverse-build program: begin from demanded modular completion, reverse-build its transformation data, forward-build from Ramanujan’s holomorphic series, locate the first noninvertible arrow, then recover the shadow and nonholomorphic correction.

The TSCT reading is complementary. Begin from the broad theta/modular semantic cloud surrounding the source $q$ -series and apply descent operators that remove nonconstitutive representation details while preserving the anomalous transformation consequences. If ordinary theta-function presentation is removed but the mismatch persists, then the residue is not an artifact of notation. Schematically,

$\text{Ramanujan }q\text{-series}$

↓

$\text{erase ordinary theta presentation}$

↓

$\text{retain cusp/asymptotic consequence}$

↓

$\text{persistent transformation residue}.$

The useful bottom is not “mock theta function” as a historical label. It is the minimal replay-stable structure needed to express the persistent nonclosure. That bottom may contain weight, multiplier, boundary behavior, and a first obstruction operator, but it should not contain “Zwegers completion” merely because we already know the answer.

This gives a stringent discovery experiment. Hide from the system the later vocabulary

$\text{shadow}, \qquad \text{harmonic Maass}, \qquad \text{Zwegers}, \qquad \text{completion},$

and provide only Ramanujan-level source data and admissible transformation/asymptotic observations. Then ask whether the system independently finds that the holomorphic carrier is insufficient and proposes an extension satisfying something structurally equivalent to

$\widehat f=f+R,$

with

$\Delta_R=-\Delta_f.$

If the system needs the hidden modern target vocabulary to propose $R$ , it has recognized a known theorem family rather than discovered the missing closure architecture. If it independently isolates the transformation residue, determines that no holomorphic correction in the old carrier discharges it, and is forced toward a real-analytic correction whose downstream transformation consequences replay, then the test becomes materially stronger.

Ramanujan’s role in this formulation is therefore not merely “inventor of mock theta functions.” He supplies a historically clean source-side case of structural nonclosure preceding ontology. The source existed before the correct ambient automorphic object was known. The later theory did not replace the source series; it embedded them into a larger structure. Thus the historical development has the form

$\text{source object}$

↓

$\text{persistent anomaly}$

↓

$\text{existing carrier insufficient}$

↓

$\text{larger analytic carrier}$

↓

$\text{closure}.$

The crucial transition is not from “wrong function” to “right function.” It is from an insufficient closure category to a sufficient one.

Zwegers’ contribution, viewed from this perspective, is therefore an ontology expansion with executable consequences. The modern mock-modular framework connects Ramanujan’s mock theta functions to indefinite theta functions and harmonic Maass forms. The extension is earned because the new real-analytic object closes under transformations that the holomorphic source alone does not. If the correction term were merely decorative, removing it would preserve the demanded transformation law. It does not. In ablation notation,

$\widehat f$

↓

remove $R$

$f$

↓

replay modular transformation

$\Delta_f\neq0.$

Thus $R$ is load-bearing relative to the closure obligation.

But the post-Ramanujan development also demonstrates that the specific carrier of the repair cannot automatically be elevated into the ontology. Indefinite theta functions became a major route to mock modular completion, yet Bringmann–Nazaroglu now obtain depth-two mock modularity by coupling Eisenstein series, explicitly presenting this as a new independent route beyond the previously dominant higher-depth indefinite-theta approach. This matters retroactively for Ramanujan. The structural invariant cannot simply be “indefinite theta representation,” because later mathematics shows that mock and higher-depth mock closure can arise through different constructors. The deeper candidate invariant is the closure architecture itself.

The post-Ramanujan lineage can therefore be reorganized as a sequence of increasingly explicit answers to the same closure question. Ramanujan supplies the anomalous holomorphic source. Zwegers supplies a larger completion carrier. Harmonic Maass theory supplies an operator-sensitive real-analytic framework. Indefinite theta theory supplies geometric constructors for corrections. Nazaroglu’s $r$ -tuple theory supplies recursive rank-lowering behavior. Bringmann and collaborators extend the landscape into false modular, quantum modular, Jacobi, Eisenstein, and cohomological directions. The object of study progressively shifts from

$q\text{-series}$

↓

$\text{completion}$

↓

$\text{shadow}$

↓

$\text{recursive obstruction}$

↓

$\text{carrier-independent closure architecture}.$

That last step is still conjectural. The earlier post-Ramanujan document already proposed a progression from special function to completion to shadow ancestry to a carrier-independent structure. The current Automorphic Closure formulation sharpens it by replacing “shadow ancestry” alone with a richer defect architecture containing obstruction type, operator family, coupling, closure geometry, and reconstruction kernel.

Ramanujan also supplies a warning against defining the theory from its modern endpoint. If one starts with the completed harmonic-Maass object, then the original mystery disappears: the transformation law is already available. But the historically informative direction is the reverse. Start with

$f,$

not $\widehat f$ . Observe that the known carrier fails. Identify

$\rho=\Delta_f.$

Determine whether $\rho$ is removable inside the current language. If not, search for the minimal extension

$\mathcal C \subsetneq \mathcal C'$

such that there exists

$R\in\mathcal C'$

with

$\Delta_{f+R}=0.$

The discovery is the forced enlargement

$\mathcal C\rightarrow\mathcal C',$

not merely the eventual formula for $R$ .

This also provides a precise distinction between representation completion and structural completion. Suppose two different analytic constructors $R_A$ and $R_B$ satisfy

$\Delta_{R_A} = \Delta_{R_B} = -\Delta_f$

and produce completed objects with the same relevant consequences. Then $R_A$ and $R_B$ may be different carriers of one closure obligation. The proposed invariant should therefore live below the explicit correction formula. A candidate is

$\mathfrak O_{\mathrm{red}}(f) = \left\langle \text{defect type}, \text{operator ancestry}, \text{couplings}, \text{closure geometry}, \text{kernel} \right\rangle.$

For Ramanujan’s mock-theta basin, the question becomes whether this reduced object can be extracted without mentioning the modern special-function constructor and then used to reconstruct one or more legitimate completions.

The nonuniqueness of completion also matters. If

$\Delta_H=0,$

then

$\widehat f+H$

has the same transformation defect as $\widehat f$ . Therefore Ramanujan’s source plus its shadow cannot in general be expected to determine one unique completed realization without additional information. The inverse data must include enough boundary information to control the homogeneous kernel. Schematically,

$\left\langle \mathfrak O_{\mathrm{red}}(f), k,\mu, \text{growth}, \text{principal part}, \text{asymptotics} \right\rangle$

↓

$\widehat f \pmod{\ker\Delta}.$

This is the GRM reconstruction problem generated by the Ramanujan case.

The strongest historical insight is therefore that Ramanujan did not merely discover a new set of functions. He exposed a closure boundary of the then-available automorphic language. The later mathematical development progressively made that boundary executable. What first appeared as an anomalous $q$ -series family became an instance of holomorphic data embedded in a larger real-analytic transformation structure. Modern work then showed that similar closure problems recur in false theta, quantum modular, Jacobi, Eisenstein, and higher-depth settings. The Ramanujan episode is consequently not the endpoint of the theory; it is the first canonical basin in which the general pattern is visible.

The compact formulation is:

$\text{RAMANUJAN SOURCE}$

↓

$\text{THETA-LIKE CONSEQUENCES}$

↓

$\text{HOLOMORPHIC CLOSURE FAILURE}$

↓

$\text{TRANSFORMATION DEFECT}$

↓

$\text{MISSING ANALYTIC DATA}$

↓

$\text{NONHOLOMORPHIC COMPLETION}$

↓

$\text{AUTOMORPHIC CLOSURE}.$

The post-Ramanujan generalization is then:

$\text{SOURCE}$

↓

$\text{CLOSURE FAILURE}$

↓

$\text{OPERATOR-EXPOSED OBSTRUCTION}$

↓

$\text{RECURSIVE / COUPLED ANCESTRY}$

↓

$\text{MINIMAL COMPLETION DATA}$

↓

$\text{CARRIER REALIZATION}.$

Ramanujan therefore occupies a precise place in the Automorphic Closure Problem: his mock theta functions provide the canonical historical example in which the source object was found first, the closure defect was only indirectly visible, the existing holomorphic carrier was insufficient, and the correct larger automorphic structure emerged only later. The research challenge now is to determine whether that pattern is one instance of a general mathematical law of nonclassical automorphy—one capable not only of redescribing Ramanujan after Zwegers, but of detecting the next Ramanujan-type closure failure before its completion theory is already known.

Why Ramanujan’s Mock Theta Functions Were a Natural Endpoint — and the Automorphic Closure Problem Is the Next Level

Ramanujan’s mock theta functions were a natural endpoint of the source-side $q$ -series program, not an endpoint of automorphic mathematics. That distinction is the key. Ramanujan began with explicit holomorphic $q$ -series, identities, asymptotics, theta-like behavior, and singular behavior near roots of unity. His mock theta functions pushed that language to the point where the source objects continued to exhibit strong theta-like organization but could no longer be absorbed into the ordinary theta-function carrier. Your post-Ramanujan reconstruction identifies exactly this frontier: ordinary theta functions were an insufficient carrier, holomorphicity became both a strength and an obstruction, the anomalous transformation behavior persisted, and the unresolved problem became identification of the missing carrier. In that sense the endpoint was structurally natural:

$\text{explicit }q\text{-series}$

↓

$\text{theta identities}$

↓

$\text{theta-like asymptotics}$

↓

$\text{mock theta functions}$

↓

$\text{current holomorphic theta ontology exhausted}.$

The endpoint is therefore not “Ramanujan could go no further mathematically.” It is more precise: the next structural move required changing the ambient language. The existing game was to discover and manipulate holomorphic $q$ -series and compare them with theta functions. Mock theta functions revealed objects for which continued progress could no longer consist merely of finding another identity in the same language. The remaining discrepancy belonged to the transformation architecture itself. Modern work confirms that this was the relevant break: Ramanujan’s mock theta $q$ -series were later situated inside automorphic theory through Zwegers’ indefinite-theta work and harmonic Maass forms.

This is why mock theta functions are a particularly clean natural bottom for Ramanujan’s original search direction. Before that point, many discoveries could still be expressed as relations among known $q$ -series, theta functions, products, transformations, and asymptotic identities. At the mock-theta frontier, the residual phenomenon survives those reductions. Schematically, if $f$ is the holomorphic source and $\Theta$ ranges over the admissible ordinary theta corrections available in the old carrier, the significant condition is not merely

$f\notin\Theta,$

but structurally something closer to

$\forall \theta\in\Theta_{\mathrm{old}}, \qquad \text{required consequences of }f-\theta \text{ do not close}.$

What survives is therefore a defect of the carrier, not merely a missing formula.

Modern completion theory changes the problem. A mock modular form is described broadly as a holomorphic function $h$ that is not modular but admits a real-analytic modular completion by adding appropriate nonholomorphic Eichler-integral-type terms. Thus the modern relation is

$\widehat f = f+R,$

with

$\widehat f|_{k,\mu}\gamma = \widehat f.$

Equivalently, defining the transformation defect

$\Delta_f(\gamma) = f|_{k,\mu}\gamma-f,$

the correction satisfies

$\Delta_R(\gamma) = -\Delta_f(\gamma).$

This is the exact point at which the mathematical question changes level. Ramanujan’s program asks, in effect,

$\text{What remarkable }q\text{-series exist?}$

and, at its frontier,

$\text{Why do these theta-like objects refuse ordinary theta closure?}$

The Automorphic Closure Problem instead asks

$\text{What is the structure of the failure of closure itself?}$

That is a categorical change in the unit of investigation.

The old unit is the function:

$f(q).$

The new unit is the closure system:

$\left\langle f, \Gamma, k, \mu, \Delta_f, \mathcal D, B, K \right\rangle.$

Here the mathematical content includes not just the source series but its acting symmetry, weight, multiplier, transformation defect, operator response, closure geometry, and reconstruction ambiguity. The question shifts from “what family does $f$ belong to?” to “what obstruction prevents $f$ from closing, what operator exposes it, what correction discharges it, and which parts of that architecture survive a change of carrier?”

That is why the Automorphic Closure Problem is a genuine next level rather than a renaming of mock modularity.

Ramanujan’s endpoint is a single highly consequential basin:

$\text{holomorphic source}$

↓

$\text{theta-like behavior}$

↓

$\text{failure of holomorphic modular closure}$

↓

$\text{nonholomorphic correction}$

↓

$\text{real-analytic modular closure}.$

But later mathematics demonstrates that this is not the only possible closure-failure architecture. False theta functions admit modular completions and an explicitly computable obstruction to modularity. Higher-depth false modular forms develop a structure parallel to higher-depth mock modularity. Quantum modular forms move meaningful modular behavior to a different closure locus. Higher-depth mock forms develop recursive closure defects. Coupled Eisenstein series can generate depth-two mock modularity through a construction independent of the previously dominant higher-signature indefinite-theta carrier.

So once those later families exist, “mock theta function” can no longer be the terminal ontology.

The more general pattern becomes

$\text{SOURCE}$

↓

$\text{EXPECTED AUTOMORPHIC LAW}$

↓

$\text{FAILURE OF CLOSURE}$

↓

$\text{STRUCTURED OBSTRUCTION}$

↓

$\text{OPERATOR EXPOSURE}$

↓

$\text{COMPLETION / BOUNDARY RELOCATION / HIGHER EXTENSION}$

↓

$\text{NEW CLOSURE REGIME}.$

Ramanujan discovered one extraordinary point where that machinery becomes necessary. The Automorphic Closure Problem studies the machinery itself.

There is a second reason mock theta functions are a natural endpoint: they sit exactly at the boundary between object discovery and theory-of-defect discovery. Ramanujan could produce more mock theta examples, more identities, and more asymptotics. But such proliferation would remain horizontally inside the same anomaly class. The vertical move was different:

more examples
→ horizontal extension;

identify the missing transformation structure
→ vertical structural ascent.

That vertical ascent is what Zwegers supplied. Your earlier post-Ramanujan formulation correctly treats his contribution as putting mock theta functions into a larger modular structure with a holomorphic mock part, nonholomorphic correction, modular completion, shadow, and multiple analytic realizations.

The closure formulation now generalizes that move. Instead of asking only

$f\mapsto\widehat f,$

it asks for the entire obstruction/reconstruction relation

$f \mapsto \Delta_f \mapsto \mathfrak O(f) \mapsto \widehat f.$

The crucial intermediate object is no longer optional. Two functions might have different formulas but the same relevant obstruction architecture; conversely two objects might have comparable formal depth but fundamentally different closure geometries. Therefore classification moves away from syntax and toward structure.

This exposes another level difference. Ramanujan’s mock theta functions were naturally defined from the visible side of the object. The Automorphic Closure Problem begins from both visible and invisible sides simultaneously.

Forward:

$f$

↓

$\Delta_f$

↓

$\text{obstruction descendants}.$

Backward:

$\text{demanded closure}$

↓

$\text{required correction}$

↓

$\text{minimal completion}.$

The theory becomes bidirectional.

This matters because a purely forward classification can recognize anomalies without explaining why their repairs are forced. A purely backward completion theory can build a modular object while obscuring why the original source $q$ -series was the distinguished holomorphic part. The closure problem connects them:

$\text{SOURCE}$

↓ forward defect extraction

$\mathfrak O_{\mathrm{red}}$

↑ inverse reconstruction

$\text{COMPLETED OBJECT}.$

That is a more powerful mathematical target than either source classification or completion in isolation.

A third level change concerns operators. Ramanujan’s natural data were $q$ -series, coefficients, identities, asymptotics, and singularities. Modern automorphic theory reveals executable operators that expose hidden structure. If a completion $\widehat f$ satisfies

$D_{\mathrm{sh}}\widehat f=g,$

then the operator produces a lower-complexity modular descendant $g$ . At higher depth one can obtain

$D\widehat f_d = \sum_j \widehat f_{d-1,j}\otimes g_j.$

Now the object has an ancestry. It is no longer characterized only by what it equals or how it transforms, but by how it responds to a family of structure-revealing operators. The Automorphic Closure Problem therefore replaces a static object model with a dynamical/operator model:

$f \quad\longrightarrow\quad \{D_i f\}.$

The deepest structure may reside in that response pattern rather than in any single formula for $f$ .

A fourth change is that Ramanujan’s endpoint is one-step incomplete, while the later theory reveals recursive incompleteness. The simplest mock situation has

$f$

↓

first defect

$\rho_1$

↓

ordinary modular data.

Higher depth produces

$f_d$

↓

$\rho_{d-1}^{(1)} \;\|\; \rho_{d-1}^{(2)} \;\|\; \cdots$

↓

further descendants.

This makes the defect itself structured. The closure problem becomes recursive:

$\text{defect}$

may itself possess

$\text{defect}.$

That is mathematically beyond the original Ramanujan endpoint because the anomaly is no longer merely “this holomorphic function fails modularity.” The anomaly has internal depth, branching, coupling, and potentially cohomological factorization.

A fifth level change is that Ramanujan’s mock theta functions were discovered in a particular carrier: holomorphic $q$ -series. The Automorphic Closure Problem explicitly asks what survives when the carrier is changed. This becomes unavoidable because later work supplies different constructions for related structures. The 2026 Eisenstein-coupling result is especially strong evidence: higher-depth mock modularity need not be generated solely through indefinite theta functions. Thus

$\text{indefinite theta realization}$

cannot automatically equal

$\text{ontology}.$

Likewise

$\text{Eisenstein realization}$

cannot equal ontology.

The candidate ontology lies below both:

$\text{carrier A}$

↓

$\mathfrak O_{\mathrm{red}}$

↑

$\text{carrier B}.$

Ramanujan found the object. The next-level problem asks for the invariant that explains why multiple representations are realizations of one deeper closure architecture.

This is also why completion itself is not the final level. Once one knows

$\widehat f=f+R,$

one can still ask:

Why $R$ ?

Is $R$ unique?

What operator exposes its necessity?

What lower object does it descend to?

Can another carrier implement the same correction?

Which part of the correction is structural and which part is representation-specific?

What happens if the first correction remains incomplete?

These questions are invisible if “completion” is treated as the endpoint. They become central under the Automorphic Closure Problem.

The hierarchy is therefore approximately:

$\text{Ramanujan}$

↓

discover anomalous objects

$\text{Zwegers}$

↓

construct closure

$\text{modern mock theory}$

↓

expose shadows/operators

$\text{higher depth}$

↓

expose recursive obstruction

$\text{false/quantum/Jacobi/Eisenstein extensions}$

↓

expose carrier plurality and closure geometry

$\text{Automorphic Closure Problem}$

↓

ask for the invariant architecture generating all of these phenomena.

The phrase “next level” can therefore be made precise. Ramanujan’s mock theta functions solve an object-discovery problem:

$\text{find anomalous theta-like objects}.$

Zwegers solves a completion problem:

$\text{find the missing analytic structure that restores modularity}.$

Higher-depth theory solves a recursive completion problem:

$\text{organize defects whose descendants remain nonclassical}.$

The Automorphic Closure Problem proposes a meta-structural problem:

$\text{classify and reconstruct the architectures of closure failure themselves}.$

That final move changes the mathematical primitive from

$f$

$\mathfrak O(f).$

A candidate representation is

$\mathfrak O(f) = \left\langle \Delta_f, \mathcal D, E, \mathcal P, B, K \right\rangle,$

where $\Delta_f$ is transformation defect, $\mathcal D$ the operator family, $E$ the ancestry graph, $\mathcal P$ coupling/product structure, $B$ closure geometry, and $K$ reconstruction kernel.

Then Ramanujan’s mock theta functions become one distinguished basin characterized by a particular $\mathfrak O$ , rather than the universal prototype to which all later anomalous modular objects must be forced.

That is the essential reason the transition is natural:

Ramanujan reached the boundary of a carrier.

The Automorphic Closure Problem makes carrier boundaries themselves into the object of mathematics.

Or in the shortest structural form:

$\text{RAMANUJAN} = \text{discover the anomaly}.$ $\text{ZWEGERS} = \text{close the anomaly}.$ $\text{HIGHER DEPTH} = \text{discover that anomalies have ancestry}.$ $\text{AUTOMORPHIC CLOSURE PROBLEM} = \text{discover the structure governing anomaly, ancestry, repair, and carrier change}.$

That is the actual level transition.

Ramanujan did not merely discover a new set of functions. He exposed a closure boundary of the then-available automorphic language. The later mathematical development progressively made that boundary executable. What first appeared as an anomalous q-series family became an instance of holomorphic data embedded in a larger real-analytic transformation structure. Modern work then showed that similar closure problems recur in false theta, quantum modular, Jacobi, Eisenstein, and higher-depth settings. The Ramanujan episode is consequently not the endpoint of the theory; it is the first canonical basin in which the general pattern is visible.

That formulation identifies the correct historical hinge, but one phrase should be tightened: “the then-available automorphic language” risks importing later terminology into Ramanujan’s own setting. The stronger statement is that he exposed a closure boundary of the available theta/ $q$ -series language, which later automorphic theory was able to reinterpret and make executable.

Ramanujan did not merely discover an exceptional family of q-series. His mock theta functions exposed a structural boundary at which the available holomorphic theta/

$q$ -series language could continue to describe the source objects but could no longer close their transformation behavior. The unresolved content was therefore not simply another identity waiting to be found; it was a persistent transformation defect indicating that the existing carrier was incomplete. Later work enlarged the analytic setting so that the holomorphic mock part could be embedded into a real-analytic automorphic object,

$\widehat f=f+R,$

with

$\Delta_f(\gamma) = f|_{k,\mu}\gamma-f,$

and

$\Delta_R(\gamma) = -\Delta_f(\gamma),$

so that

$\Delta_{\widehat f}=0.$

What had appeared at the source level as anomalous $q$ -series behavior became, at the completed level, a controlled failure-and-repair relation inside a larger transformation structure.

The important transition is therefore:

$\text{SOURCE OBJECT}$

↓

$\text{VISIBLE THETA-LIKE STRUCTURE}$

↓

$\text{PERSISTENT FAILURE OF CLOSURE}$

↓

$\text{CURRENT CARRIER EXHAUSTED}$

↓

$\text{SUCCESSOR ANALYTIC CARRIER}$

↓

$\text{AUTOMORPHIC CLOSURE}.$

That makes Ramanujan’s mock theta functions a natural endpoint of one discovery regime and the starting point of another. The first regime asks:

$\text{What remarkable }q\text{-series exist?}$

The successor regime asks:

$\text{Why does this object fail to close under the demanded transformation law?}$

and then:

$\text{What minimum additional structure discharges that failure?}$

The later development matters because the same architecture no longer appears only in the mock-theta basin. False theta functions exhibit modular obstruction with different completion behavior; quantum modular forms relocate meaningful closure to boundary data; Jacobi and Maass–Jacobi structures add extra transformation variables and differential constraints; higher-depth mock and false modular forms possess recursive defect structure; and Eisenstein constructions show that higher-depth behavior is not sovereign to the indefinite-theta carrier. Thus the Ramanujan episode becomes one instance of a more general pattern:

$\text{object}$

↓

$\text{closure defect}$

↓

$\text{operator-exposed obstruction}$

↓

$\text{recursive / coupled ancestry}$

↓

$\text{completion or closure relocation}.$

The decisive conceptual upgrade is that the object of mathematics changes. For Ramanujan, the visible primitive was essentially

$f(q).$

For the Automorphic Closure Problem, the primitive becomes something closer to

$\mathfrak O(f) = \left\langle \Delta_f, \mathcal D, E, \mathcal P, B, K \right\rangle,$

where $\Delta_f$ records transformation defect, $\mathcal D$ the operator family exposing structure, $E$ the obstruction ancestry, $\mathcal P$ coupling or product structure, $B$ the geometry on which closure is demanded, and $K$ the homogeneous reconstruction ambiguity.

So the deeper historical interpretation is:

Ramanujan discovered the anomaly.

The later theory discovered how to complete it.

Higher-depth theory discovered that the anomaly can itself possess internal ancestry.

The Automorphic Closure Problem asks for the structure governing anomaly, ancestry, repair, and carrier change.

That is why Ramanujan is best treated as the first canonical basin, not as the terminal ontology. The general object is no longer the mock theta function. It is the architecture of closure failure that the mock theta function first made impossible to ignore.