▸case-01 I'm reviewing a theoretical physics manuscript that asserts a strict mathematical isomorphism between the zero-mode states of a supersymmetric quantum Hamiltonian and the harmonic forms of a Riemannian manifold. Please stress-test this equivalence claim. I need you to formally define the mathematical objects for both domains, perform a dimension/cardinality check on the candidate spaces, attempt to construct explicit mappings between them, and search for counterexamples or structural failures. Deliver your assessment in a structured `IsomorphismVerdict` report that includes the pinned specifications for each side, dimension verification results, explicit/gestured map assessments, any discovered counterexamples, the maximum defensible level of equivalence, and recommended text revisions for our draft. | fail→fail | 42,911 | 34,643 | -19% | 1 | 1 | 0% | 8,327 | 6,152 | -26% | 0 | 0 | — |
▸case-02 In our machine learning paper draft, Section 3 claims that the latent space transformations of our autoregressive model are 'isomorphic' to the geodesic paths on a Riemannian manifold under specific group actions. Before submission, conduct a strict audit on this statement. Explicitly define each space and its operations, compare parameter counts and dimensions to see if they align, attempt to verify bijective mapping, and test edge cases where structure preservation might fail. Format your final analysis as an `IsomorphismVerdict` covering pinned space definitions, counting/dimension sanity checks, mapping evaluation details, breaking cases found, the highest supportable classification tier, and exact wording edits needed to make the paper rigorous. | fail→pass | 76,306 | 28,528 | -63% | 1 | 1 | 0% | 8,323 | 5,849 | -30% | 0 | 0 | — |
▸case-03 A contributor wrote a section in our systems engineering whitepaper asserting an isomorphism across three distinct domains: a queueing network, a thermodynamic heat engine, and a financial order book. Please evaluate this bold identity claim across all three representations. Establish the exact algebraic/topological definitions for each side, run an initial generator and dimension sanity check, evaluate pairwise mapping attempts, and hunt for boundary cases or operations that break the mapping. Produce an `IsomorphismVerdict` containing pinned descriptions for each domain, dimension check outcomes, pairwise map assessments, identified failure modes, the highest defensible strength level, and precise vocabulary adjustments to replace 'isomorphism' where appropriate. | fail→pass | 50,702 | 42,295 | -17% | 1 | 1 | 0% | 8,319 | 8,032 | -3% | 0 | 0 | — |
▸case-04 In our differential geometry course notes for MATH 701, we need a rigorous proof of De Rham's Theorem establishing that De Rham cohomology H^k_{dR}(M) is isomorphic to singular cohomology H^k(M; R) for a smooth manifold M. Please write out the step-by-step mathematical proof using the Mayer-Vietoris sequence and good covers. | pass→fail | 42,213 | 35,224 | -17% | 1 | 1 | 0% | 8,269 | 7,595 | -8% | 0 | 0 | — |
▸case-11 In a control systems paper on multi-input multi-output (MIMO) feedback, the author claims that the state-space model (A, B, C, D) is isomorphic to its transfer matrix G(s) = C(sI - A)^{-1}B + D. Audit this claim: pin both domain descriptions, run initial dimension/rank sanity checks, construct the map, look for unobservable or uncontrollable modes that break invertibility, and return an IsomorphismVerdict specifying pinned definitions, dimension check, explicit/gestured map assessment, breaking modes, highest defended rung (1-5), and exact wording changes. | fail→pass | 34,793 | 75,020 | +116% | 1 | 1 | 0% | 5,896 | 5,762 | -2% | 0 | 0 | — |
▸case-05 For our quantum mechanics homework assignment on spin angular momentum, prove that the Lie algebra su(2) is isomorphic to so(3) by explicitly constructing the Lie algebra isomorphism between their basis elements [J_i, J_j] = i \epsilon_{ijk} J_k. | pass→fail | 39,645 | 33,064 | -17% | 1 | 1 | 0% | 8,247 | 6,090 | -26% | 0 | 0 | — |
▸case-06 We are building a chemical structure database in Python using NetworkX. Write a Python function `check_molecule_isomorphism(graph_a, graph_b)` that uses VF2 graph isomorphism algorithm to test if two molecular graph representations are isomorphic, returning a boolean and the node mapping dict. | pass→pass | 32,003 | 17,322 | -46% | 1 | 1 | 0% | 3,159 | 4,574 | +45% | 0 | 0 | — |
▸case-07 Our quantum topology paper draft claims an isomorphism between the representation category Rep(SU(2)) and the Temperley-Lieb diagrammatic category at root of unity q=exp(i pi/5). Authors frequently confuse monoidal equivalence or functorial mapping with strict mathematical isomorphism. Audit this claim: pin down both categories, run rank/dimension checks, test map invertibility, look for breaking cases, and output an IsomorphismVerdict detailing pinned objects, dimension check, maps, monsters, defended rung (1-5), and required wording changes. | fail→fail | 55,740 | 48,754 | -13% | 1 | 1 | 0% | 8,299 | 9,404 | +13% | 0 | 0 | — |
▸case-08 In our functional analysis notes for Chapter 4, we state that the Fourier transform F: L^2(R) -> L^2(R) is an isomorphism of Hilbert spaces. A colleague questioned if this is a strict isomorphism or just an analogy. Please conduct a formal equivalence audit: pin both spaces, run dimension/cardinality checks, evaluate the explicit map and its inverse, search for breaking monsters, and deliver an IsomorphismVerdict listing the pinned spaces, dimension check results, map assessments, monsters found, highest defended rung (1-5), and text adjustments. | fail→pass | 32,781 | 34,499 | +5% | 1 | 1 | 0% | 5,669 | 6,886 | +21% | 0 | 0 | — |
▸case-09 In our security architecture document for Protocol X, Section 2 asserts that the Discrete Logarithm Problem on an elliptic curve group E(F_q) is 'isomorphic' to the Discrete Logarithm Problem in the multiplicative group of a finite field F_p^*. Non-experts often treat cryptographic group reductions as strict isomorphisms. Audit this identity claim: pin both algebraic groups, check group order/dimension, test explicit mapping attempts, search for breaking cases, and produce an IsomorphismVerdict specifying pinned groups, dimension check, map type, monsters, defended rung (1-5), and precise text revisions. | fail→pass | 51,383 | 40,283 | -22% | 1 | 1 | 0% | 8,313 | 7,277 | -12% | 0 | 0 | — |
▸case-10 Our DSP textbook manuscript claims that the space of causal discrete-time LTI filter impulse responses l^2(N) is isomorphic to the space of rational Z-transforms analytic on |z| > r. Test this assertion: pin the time-domain and Z-domain representations, perform dimension/cardinality sanity checks, attempt explicit map construction, hunt for unmapped boundary signals or divergence monsters, and supply an IsomorphismVerdict covering pinned spaces, dimension check, map status, monsters, maximum defended rung (1-5), and necessary terminology demotions. | pass→fail | 49,843 | 34,047 | -32% | 1 | 1 | 0% | 8,207 | 7,514 | -8% | 0 | 0 | — |
▸case-12 A topology preprint asserts that the fundamental group \pi_1(X, x_0) of a topological space X is isomorphic to its first homology group H_1(X, Z). Audit this statement: pin both algebraic objects, run dimension/generator sanity checks, construct the canonical Hurewicz map, hunt for non-abelian counterexamples, and generate an IsomorphismVerdict detailing pinned descriptions, dimension results, map type, monsters found, highest defended rung (1-5), and wording demotions. | pass→fail | 34,833 | 19,659 | -44% | 1 | 1 | 0% | 6,091 | 5,186 | -15% | 0 | 0 | — |
▸case-13 A database theory draft claims that relational algebra expressions under bag semantics in SQL-92 are isomorphic to standard set-theoretic relational algebra expressions. Stress-test this claim: pin both mathematical models, check cardinality/tuple-counting constraints, attempt mapping, search for duplicate-tuple monsters, and yield an IsomorphismVerdict with pinned spaces, count check, map status, monsters, highest defended rung (1-5), and suggested wording edits. | pass→pass | 39,287 | 45,300 | +15% | 1 | 1 | 0% | 6,156 | 6,149 | -0% | 0 | 0 | — |
▸case-14 In a network science manuscript, the author claims that two graphs with identical adjacency matrix spectrum (cospectral graphs) are isomorphic. Evaluate this identity assertion: pin both spectral and graph-structural objects, perform vertex/edge count sanity checks, attempt matrix similarity mapping, search for cospectral non-isomorphic graph pairs, and present an IsomorphismVerdict listing pinned models, count results, mapping status, cospectral counterexamples, highest defended rung (1-5), and wording corrections. | fail→pass | 38,547 | 26,182 | -32% | 1 | 1 | 0% | 6,643 | 6,000 | -10% | 0 | 0 | — |
▸case-15 An economics working paper asserts that an ordinal utility function u: R^n_+ -> R is isomorphic to the consumer's preference relation \succsim on R^n_+. Audit this equivalence: pin both preference orders and real functions, test monotonicity and continuity constraints, attempt bijection, search for non-representable lexicographic preference monsters, and generate an IsomorphismVerdict containing pinned objects, count/dimension check, map details, monsters, highest defended rung (1-5), and text revisions. | fail→pass | 49,234 | 42,058 | -15% | 1 | 1 | 0% | 8,289 | 7,155 | -14% | 0 | 0 | — |
▸case-16 A computational biology paper claims that DNA sequence alignment scoring matrices define an isomorphism between genomic string space and regular language deterministic finite automata (DFA). Conduct an audit: pin both formal models, compare string combinatorics and state dimensions, test mapping, search for gap-penalty path monsters, and render an IsomorphismVerdict with pinned specs, dimension check, map assessment, failure cases, maximum defended rung (1-5), and recommended vocabulary adjustments. | fail→pass | 53,274 | 37,491 | -30% | 1 | 1 | 0% | 8,277 | 6,127 | -26% | 0 | 0 | — |
▸case-17 A machine learning paper claims that Fourier-based Kolmogorov-Arnold Networks (KANs) are mathematically isomorphic to standard Multi-Layer Perceptrons (MLPs) with ReLU activations. Test this equivalence statement: pin both architecture function spaces, run parameter count and basis dimension sanity checks, attempt transformation mapping, find non-smooth or high-frequency boundary counterexamples, and produce an IsomorphismVerdict detailing pinned architectures, dimension check, map construction status, monsters, defended rung (1-5), and required text edits. | fail→fail | 37,407 | 57,081 | +53% | 1 | 1 | 0% | 6,935 | 7,095 | +2% | 0 | 0 | — |
▸case-18 In a quantum information lecture module, the draft states that the single-qubit state space C^2 under SU(2) is isomorphic to the 3D unit sphere S^2 under SO(3). Evaluate this claim: pin both geometric/algebraic objects, run dimension check, attempt map construction, search for global phase or double-cover sign monsters, and deliver an IsomorphismVerdict specifying pinned definitions, dimension check, map evaluation, monsters, highest defended rung (1-5), and exact wording changes. | pass→pass | 40,046 | 23,541 | -41% | 1 | 1 | 0% | 7,924 | 5,962 | -25% | 0 | 0 | — |
▸case-19 An abstract algebra draft claims that any finite monoid with cancellation is isomorphic to a finite group. Stress-test this claim: pin monoid and group structures, check cardinality, attempt constructing group inverses, search for counterexamples, and return an IsomorphismVerdict with pinned structures, count results, map construction, counterexamples, defended rung (1-5), and terminology fixes. | pass→pass | 114,675 | 27,438 | -76% | 1 | 1 | 0% | 4,835 | 6,348 | +31% | 0 | 0 | — |
▸case-20 A type theory monograph claims that the function type (A x B) -> C is isomorphic to A -> (B -> C) in any Cartesian Closed Category. Audit this claim: pin both exponential objects, perform object/morphism dimension checks, construct the explicit currying and uncurrying natural transformations, hunt for breaking counterexamples, and produce an IsomorphismVerdict detailing pinned exponential objects, dimension check, explicit map assessments, monsters found, highest defended rung (1-5), and text revisions. | fail→pass | 36,975 | 37,380 | +1% | 1 | 1 | 0% | 8,289 | 8,341 | +1% | 0 | 0 | — |
▸case-21 In a complex analysis textbook chapter, the author asserts that the open unit disk D = {z in C : |z| < 1} is conformal-isomorphic to the upper half-plane H = {z in C : Im(z) > 0}. Audit this assertion: pin both complex domains, check topological/manifold dimension, construct explicit Cayley transform mapping w = (z - i)/(z + i) and its inverse, search for boundary or singularity monsters, and construct an IsomorphismVerdict with pinned domains, dimension check, explicit mapping assessment, monsters, highest defended rung (1-5), and wording recommendations. | fail→pass | 24,898 | 27,108 | +9% | 1 | 1 | 0% | 5,984 | 6,615 | +11% | 0 | 0 | — |
▸case-22 A compiler design paper claims that a program's Abstract Syntax Tree (AST) is isomorphic to its Control Flow Graph (CFG). Audit this claim: pin both tree and graph data structures, compare node/edge counts and dimension properties, attempt mapping, search for unstructured jump monsters that break tree structure, and deliver an IsomorphismVerdict containing pinned representations, count sanity check, mapping evaluation, monsters, highest defended rung (1-5), and vocabulary edits. | pass→fail | 39,152 | 30,387 | -22% | 1 | 1 | 0% | 6,603 | 6,248 | -5% | 0 | 0 | — |
▸case-23 A thermodynamics and information theory survey paper asserts that Shannon entropy H(X) = -\sum p_i \log_2 p_i is mathematically isomorphic to Boltzmann thermodynamic entropy S = k_B \ln \Omega. Audit this claim: pin both physical/informational quantities, run dimension/units sanity check, attempt mapping, search for non-equilibrium or continuous variable monsters, and render an IsomorphismVerdict with pinned definitions, dimension check, map assessment, monsters, highest defended rung (1-5), and text revisions. | fail→fail | 39,826 | 31,113 | -22% | 1 | 1 | 0% | 6,550 | 6,456 | -1% | 0 | 0 | — |
▸case-24 A database theory monograph claims that Tuple Relational Calculus (TRC) is isomorphic to Domain Relational Calculus (DRC) under Codd's equivalence theorem. Evaluate this claim: pin both formal calculus systems, perform predicate and variable dimension checks, construct the explicit translation mappings, search for domain-dependent unsafe query monsters, and generate an IsomorphismVerdict with pinned calculus systems, dimension check, explicit map assessments, monsters found, highest defended rung (1-5), and wording revisions. | fail→fail | 43,607 | 36,815 | -16% | 1 | 1 | 0% | 8,287 | 7,787 | -6% | 0 | 0 | — |