universal-physics-tensor 10.0.0 → 12.0.0

package/dist/composition/expr-simplify.js

@@ -1,11 +1,11 @@
 /**
- * Symbolic simplification of a scalar `ExprNode` via MathTS (v0.12 — optional
- * supplement to symbolic composition).
+ * Symbolic simplification of a scalar `ExprNode` through MathTS, a supplement
+ * to symbolic composition.
  *
  * Composing two bridges' symbolic forms leaves an UNSIMPLIFIED AST — CT-1 is
  * `k_B·(ℏc³/8πG·mass·k_B)·ln2`, with `k_B` uncancelled. This folds it to the
  * canonical `ℏc³·ln2/(8πG·mass)` using `@danielsimonjr/mathts-functions`'
- * `simplify` (the same OPTIONAL peer the Path-A formula parser loads).
+ * `simplify`, a required dependency.
  *
  * Pipeline (Adam+Eve-vetted — docs/planning/v0.12.0-Symbolic-Simplification-
  * Design.md): GENSYM every non-exponent leaf to a mathjs-safe identifier
@@ -19,7 +19,7 @@
  *   3. numeric    — `evalExpr` agrees over ≥2 finite synthesized probes at
  *      rel tol 1e-9 (Adam CRITICAL-2 / EVE-C).
  * A representable result that DISAGREES dimensionally/numerically THROWS (a
- * bug to surface); anything we cannot represent / verify / load degrades to a
+ * bug to surface); anything we cannot represent or verify degrades to a
  * graceful no-op (return the original, `simplified:false`).
  *
  * INTERNAL — surfaced via `upt symbolic --simplify`.
@@ -30,10 +30,12 @@ import { validate } from '../dimensional/validator.js';
 import { equals } from '../dimensional/algebra.js';
 import { DIMENSIONLESS } from '../dimensional/types.js';
 import { evalExpr } from './expr-eval.js';
-import { CONSTANTS } from '../dimensional/symbolic-constants.js';
+import { forEachScalarLeaf, isDecimalLiteral } from '../dimensional/ast-leaves.js';
+import { isRegisteredConstant } from '../dimensional/symbolic-constants.js';
 import { makeObservable } from './compose-symbolic.js';
 import { renderScalarLeaf } from './mathts-scalar-symbols.js';
-import { quietly } from './mathts-quiet.js';
+import { parse as mathtsParse, simplify as mathtsSimplify } from '@danielsimonjr/mathts-functions';
+import { quietlySync } from './mathts-quiet.js';
 /** A simplification completed but produced a dimensionally/numerically wrong
  *  result (a real bug — not a graceful no-op). @internal */
 class SimplificationError extends Error {
@@ -47,37 +49,29 @@ class SimplificationError extends Error {
 class Unsupported extends Error {
 }
 // ---------------------------------------------------------------------------
-// Optional-peer load — cache + quietly + simplify-smoke (mirrors
-// formula-registry.ts).
+// The MathTS simplifier: a static import, bound once after a smoke test.
 // ---------------------------------------------------------------------------
 let cached;
-/** Load + smoke-test the peer. A peer with `parse` but a missing/broken
- *  `simplify` (it must actually CANCEL) is rejected → null (graceful no-op). */
-async function detect() {
-    try {
-        // Import AND smoke-test inside the ONE suppression window this module
-        // opens (`mathts-quiet.ts` states the invariant): the WASM-fallback
-        // chatter fires lazily on first parse/simplify, not only at import, and
-        // the smoke below is that first use. Later calls run with the console
-        // untouched.
-        return await quietly(async () => {
-            const mod = (await import('@danielsimonjr/mathts-functions'));
-            if (typeof mod.parse !== 'function' || typeof mod.simplify !== 'function') {
-                return null;
-            }
-            // Smoke: g0 must cancel out of (g0)*((g1)/(g0)) → only g1 remains.
-            const s = mod.simplify(mod.parse('(g0)*((g1)/(g0))'));
-            const names = new Set();
-            collectMathSymbols(s, names);
-            return names.size === 1 && names.has('g1') ? mod : null;
-        });
-    }
-    catch {
-        return null;
-    }
-}
+/**
+ * `parse` and `simplify`, bound once after a smoke test that `simplify`
+ * CANCELS (`(g0)*((g1)/(g0))` must come back as `g1` alone). The smoke is the
+ * first use, so it runs inside the one console window (`mathts-quiet.ts`).
+ * MathTS is a required dependency, so a failed smoke is a defect of that
+ * dependency and throws; it is not read as an absent simplifier.
+ */
 function loadSimplifier() {
-    cached ??= detect();
+    if (cached !== undefined)
+        return cached;
+    const mod = {
+        parse: (text) => mathtsParse(text),
+        simplify: (node) => mathtsSimplify(node),
+    };
+    const names = new Set();
+    quietlySync(() => collectMathSymbols(mod.simplify(mod.parse('(g0)*((g1)/(g0))')), names));
+    if (names.size !== 1 || !names.has('g1')) {
+        throw new Error(`expr-simplify: MathTS simplify did not cancel g0 in the smoke test (left ${[...names].join(', ')})`);
+    }
+    cached = mod;
     return cached;
 }
 function collectMathSymbols(n, out) {
@@ -88,11 +82,17 @@ function collectMathSymbols(n, out) {
     for (const a of n.args ?? [])
         collectMathSymbols(a, out);
 }
-const isLiteral = (name) => Number.isFinite(Number(name));
-/** Render a scalar ExprNode to a mathjs-safe, fully-parenthesized string,
- *  gensym'ing each non-literal leaf by NAME (so repeats share an identifier
- *  and can cancel). Throws `Unsupported` on non-scalar arms. */
-function renderGensym(expr, gensymOf, meta) {
+const isLiteral = isDecimalLiteral;
+/**
+ * Render a scalar ExprNode to a mathjs-safe, fully-parenthesized string,
+ * gensym'ing each non-literal leaf by NAME (so repeats share an identifier
+ * and can cancel). Throws on a non-scalar arm and on a non-literal exponent;
+ * `algebraic-equivalence.ts` renders both sides of a quotient through one
+ * gensym table with it.
+ *
+ * @internal
+ */
+export function renderGensym(expr, gensymOf, meta) {
     switch (expr.kind) {
         case 'symbol':
             return renderScalarLeaf(expr, gensymOf, meta);
@@ -106,6 +106,13 @@ function renderGensym(expr, gensymOf, meta) {
             }
             if (expr.args.length === 0)
                 throw new Unsupported();
+            if (expr.args.length === 1) {
+                const arg = renderGensym(expr.args[0], gensymOf, meta);
+                if (expr.op === '-')
+                    return `(-(${arg}))`;
+                if (expr.op === '+')
+                    return `(${arg})`;
+            }
             const parts = expr.args.map((a) => `(${renderGensym(a, gensymOf, meta)})`);
             return `(${parts.join(expr.op)})`;
         }
@@ -153,10 +160,12 @@ function walkBack(node, meta) {
                     args: [walkBack(args[0], meta), lit(exp.value)],
                 };
             }
-            if ((op === '+' || op === '-') && args.length === 1) {
+            if (op === '-' && args.length === 1) {
                 // unary minus → (-1) * arg
                 return { kind: 'op', op: '*', args: [lit(-1), walkBack(args[0], meta)] };
             }
+            if (op === '+' && args.length === 1)
+                return walkBack(args[0], meta); // unary plus is the argument
             if (op === '+' || op === '-' || op === '*' || op === '/') {
                 if (args.length < 2)
                     throw new Unsupported();
@@ -172,19 +181,7 @@ function walkBack(node, meta) {
 // Guards.
 // ---------------------------------------------------------------------------
 function symbolNames(expr, out = []) {
-    if (expr.kind === 'symbol')
-        out.push(expr.name);
-    else if (expr.kind === 'op')
-        for (const a of expr.args)
-            symbolNames(a, out);
-    else if (expr.kind === 'integral') {
-        symbolNames(expr.over, out);
-        symbolNames(expr.integrand, out);
-    }
-    else if (expr.kind === 'derivative') {
-        symbolNames(expr.of, out);
-        symbolNames(expr.wrt, out);
-    }
+    forEachScalarLeaf(expr, (leaf) => out.push(leaf.name), { integral: 'over+integrand', derivative: true });
     return out;
 }
 const nonNumericSymbols = (expr) => symbolNames(expr).filter((n) => !isLiteral(n));
@@ -195,7 +192,7 @@ const PROBE_MULTIPLIERS = [1, 1.7, 0.41, 2.9];
  *  avoid accidental cancellation. <2 finite probes ⇒ 'insufficient' (cannot
  *  verify — EVE-C). */
 function numericAgreement(original, candidate) {
-    const leaves = [...new Set(nonNumericSymbols(original))].filter((n) => !(n in CONSTANTS));
+    const leaves = [...new Set(nonNumericSymbols(original))].filter((n) => !isRegisteredConstant(n));
     let finiteProbes = 0;
     for (const mult of PROBE_MULTIPLIERS) {
         const values = {};
@@ -220,46 +217,41 @@ function numericAgreement(original, candidate) {
     return finiteProbes >= 2 ? 'agree' : 'insufficient';
 }
 /**
- * Whether the optional MathTS simplifier peer is installed AND passes its
- * smoke test.
- *
- * {@link simplifyExpr} returns `simplified: false` both when the peer is absent
- * and when it is present but could not reduce the expression, so a caller that
- * must report WHY nothing happened (the atlas witness runner's `peer-absent`
- * versus `not-simplified`) needs this separate signal. Shares the same cached
- * detection, so it costs nothing after the first call.
+ * Whether the MathTS simplifier is usable. MathTS is a required dependency, so
+ * the answer is true; a simplifier that fails its smoke test throws instead.
+ * The atlas witness runner reads it to choose between the simplifier and its
+ * `peer-absent` path, which a caller still reaches by passing `null`.
  *
  * @internal
  */
 export async function isSimplifierAvailable() {
-    return (await loadSimplifier()) !== null;
+    loadSimplifier();
+    return true;
 }
 /**
  * Simplify a scalar `ExprNode` via MathTS, guarded. Returns the original
- * unchanged (`simplified:false`) when the peer is absent or the result cannot
- * be represented/verified; THROWS {@link SimplificationError} only when a
+ * unchanged (`simplified:false`) when the result cannot be represented or
+ * verified; THROWS {@link SimplificationError} only when a
  * representable result disagrees dimensionally/numerically. See module docs.
  *
  * @internal
  */
 export async function simplifyExpr(expr) {
-    const mod = await loadSimplifier();
-    if (!mod)
-        return { expr, simplified: false };
+    const mod = loadSimplifier();
     const gensymOf = new Map();
     const meta = new Map();
     let candidate;
     try {
         const str = renderGensym(expr, gensymOf, meta);
-        // The peer can THROW on some forms (e.g. a known mathts `simplify` BigInt
+        // MathTS can THROW on some forms (e.g. a known mathts `simplify` BigInt
         // bug on nested `a/(b/c²)`); that, like an unsupported node, is a graceful
-        // no-op, not an error. The console is not touched here: the peer's first
-        // use already ran inside `detect`'s load window.
+        // no-op, not an error. The console is not touched here: the first use
+        // already ran inside `loadSimplifier`'s window.
         const simplifiedNode = mod.simplify(mod.parse(str));
         candidate = walkBack(simplifiedNode, meta);
     }
     catch {
-        return { expr, simplified: false }; // unsupported / unrepresentable / peer threw
+        return { expr, simplified: false }; // unsupported / unrepresentable / MathTS threw
     }
     // Guard 1 — dimensional. Inability to validate ⇒ no-op; a CHANGED dimension
     // is a representable disagreement ⇒ throw.

package/dist/composition/expr-simplify.js.map

@@ -1 +1 @@
-{"version":3,"file":"expr-simplify.js","sourceRoot":"","sources":["../../src/composition/expr-simplify.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AAGH,OAAO,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AACvD,OAAO,EAAE,MAAM,EAAE,MAAM,2BAA2B,CAAC;AAEnD,OAAO,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AACxD,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC1C,OAAO,EAAE,SAAS,EAAE,MAAM,sCAAsC,CAAC;AAEjE,OAAO,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,EAAE,gBAAgB,EAAE,MAAM,4BAA4B,CAAC;AAC9D,OAAO,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AAE5C;4DAC4D;AAC5D,MAAM,mBAAoB,SAAQ,KAAK;IACrC,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,qBAAqB,CAAC;IACpC,CAAC;CACF;AAkBD;wDACwD;AACxD,MAAM,WAAY,SAAQ,KAAK;CAAG;AAElC,8EAA8E;AAC9E,iEAAiE;AACjE,wBAAwB;AACxB,8EAA8E;AAE9E,IAAI,MAAwD,CAAC;AAE7D;gFACgF;AAChF,KAAK,UAAU,MAAM;IACnB,IAAI,CAAC;QACH,sEAAsE;QACtE,oEAAoE;QACpE,wEAAwE;QACxE,sEAAsE;QACtE,aAAa;QACb,OAAO,MAAM,OAAO,CAAC,KAAK,IAAI,EAAE;YAC9B,MAAM,GAAG,GAAG,CAAC,MAAM,MAAM,CACvB,iCAAiC,CAClC,CAAoC,CAAC;YACtC,IAAI,OAAO,GAAG,CAAC,KAAK,KAAK,UAAU,IAAI,OAAO,GAAG,CAAC,QAAQ,KAAK,UAAU,EAAE,CAAC;gBAC1E,OAAO,IAAI,CAAC;YACd,CAAC;YACD,mEAAmE;YACnE,MAAM,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,kBAAkB,CAAC,CAAC,CAAC;YACtD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;YAChC,kBAAkB,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YAC7B,OAAO,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;QAC1D,CAAC,CAAC,CAAC;IACL,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED,SAAS,cAAc;IACrB,MAAM,KAAK,MAAM,EAAE,CAAC;IACpB,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,kBAAkB,CAAC,CAAW,EAAE,GAAgB;IACvD,IAAI,CAAC,CAAC,IAAI,KAAK,YAAY,IAAI,CAAC,CAAC,IAAI;QAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACvD,IAAI,CAAC,CAAC,OAAO;QAAE,kBAAkB,CAAC,CAAC,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;IAClD,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,IAAI,EAAE;QAAE,kBAAkB,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;AAC3D,CAAC;AAWD,MAAM,SAAS,GAAG,CAAC,IAAY,EAAW,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;AAE3E;;gEAEgE;AAChE,SAAS,YAAY,CACnB,IAAc,EACd,QAA6B,EAC7B,IAA2B;IAE3B,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,QAAQ;YACX,OAAO,gBAAgB,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;QAChD,KAAK,IAAI,EAAE,CAAC;YACV,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;gBACpB,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACzB,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC1D,MAAM,IAAI,WAAW,EAAE,CAAC;gBAC1B,CAAC;gBACD,OAAO,IAAI,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,KAAK,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/E,CAAC;YACD,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;gBAAE,MAAM,IAAI,WAAW,EAAE,CAAC;YACpD,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,YAAY,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;YAC3E,OAAO,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC;QACpC,CAAC;QACD;YACE,MAAM,IAAI,WAAW,EAAE,CAAC,CAAC,sCAAsC;IACnE,CAAC;AACH,CAAC;AAED,MAAM,GAAG,GAAG,CAAC,CAAS,EAAY,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,aAAa,EAAE,CAAC,CAAC;AAE/F;;wCAEwC;AACxC,SAAS,QAAQ,CAAC,IAAc,EAAE,IAA2B;IAC3D,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,cAAc,EAAE,CAAC;YACpB,IAAI,OAAO,IAAI,CAAC,KAAK,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACnE,MAAM,IAAI,WAAW,EAAE,CAAC;YAC1B,CAAC;YACD,OAAO,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACzB,CAAC;QACD,KAAK,YAAY,EAAE,CAAC;YAClB,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YACpE,IAAI,CAAC,CAAC;gBAAE,MAAM,IAAI,WAAW,EAAE,CAAC,CAAC,4BAA4B;YAC7D,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC;QACtD,CAAC;QACD,KAAK,iBAAiB;YACpB,IAAI,CAAC,IAAI,CAAC,OAAO;gBAAE,MAAM,IAAI,WAAW,EAAE,CAAC;YAC3C,OAAO,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QACtC,KAAK,cAAc,EAAE,CAAC;YACpB,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;YACnB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;YAC7B,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;gBACf,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;oBAAE,MAAM,IAAI,WAAW,EAAE,CAAC;gBAC/C,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;gBACpB,IACE,GAAG,CAAC,IAAI,KAAK,cAAc;oBAC3B,OAAO,GAAG,CAAC,KAAK,KAAK,QAAQ;oBAC7B,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAC5B,CAAC;oBACD,MAAM,IAAI,WAAW,EAAE,CAAC,CAAC,yCAAyC;gBACpE,CAAC;gBACD,OAAO;oBACL,IAAI,EAAE,IAAI;oBACV,EAAE,EAAE,GAAG;oBACP,IAAI,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;iBAChD,CAAC;YACJ,CAAC;YACD,IAAI,CAAC,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACpD,2BAA2B;gBAC3B,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC;YAC3E,CAAC;YACD,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;gBACzD,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;oBAAE,MAAM,IAAI,WAAW,EAAE,CAAC;gBAC7C,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC;YACtE,CAAC;YACD,MAAM,IAAI,WAAW,EAAE,CAAC;QAC1B,CAAC;QACD;YACE,MAAM,IAAI,WAAW,EAAE,CAAC,CAAC,kCAAkC;IAC/D,CAAC;AACH,CAAC;AAED,8EAA8E;AAC9E,UAAU;AACV,8EAA8E;AAE9E,SAAS,WAAW,CAAC,IAAc,EAAE,GAAG,GAAa,EAAE;IACrD,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ;QAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SAC3C,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;QAAE,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,IAAI;YAAE,WAAW,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;SACvE,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;QAClC,WAAW,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAC5B,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;IACnC,CAAC;SAAM,IAAI,IAAI,CAAC,IAAI,KAAK,YAAY,EAAE,CAAC;QACtC,WAAW,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QAC1B,WAAW,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IAC7B,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,MAAM,iBAAiB,GAAG,CAAC,IAAc,EAAY,EAAE,CACrD,WAAW,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;AAEjD,MAAM,YAAY,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;AAClE,MAAM,iBAAiB,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;AAE9C;;;uBAGuB;AACvB,SAAS,gBAAgB,CACvB,QAAkB,EAClB,SAAmB;IAEnB,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAC7D,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,CACzB,CAAC;IACF,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,KAAK,MAAM,IAAI,IAAI,iBAAiB,EAAE,CAAC;QACrC,MAAM,MAAM,GAA2B,EAAE,CAAC;QAC1C,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;YACzB,MAAM,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC;QAC9D,CAAC,CAAC,CAAC;QACH,IAAI,CAAS,CAAC;QACd,IAAI,CAAS,CAAC;QACd,IAAI,CAAC;YACH,CAAC,GAAG,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;YAC/B,CAAC,GAAG,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;QAClC,CAAC;QAAC,MAAM,CAAC;YACP,SAAS,CAAC,8CAA8C;QAC1D,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,SAAS;QACzD,YAAY,EAAE,CAAC;QACf,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI;YAAE,OAAO,UAAU,CAAC;IACnE,CAAC;IACD,OAAO,YAAY,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,cAAc,CAAC;AACtD,CAAC;AAaD;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,KAAK,UAAU,qBAAqB;IACzC,OAAO,CAAC,MAAM,cAAc,EAAE,CAAC,KAAK,IAAI,CAAC;AAC3C,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,YAAY,CAAC,IAAc;IAC/C,MAAM,GAAG,GAAG,MAAM,cAAc,EAAE,CAAC;IACnC,IAAI,CAAC,GAAG;QAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC;IAE7C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAoB,CAAC;IACzC,IAAI,SAAmB,CAAC;IACxB,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,YAAY,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;QAC/C,0EAA0E;QAC1E,2EAA2E;QAC3E,yEAAyE;QACzE,iDAAiD;QACjD,MAAM,cAAc,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;QACpD,SAAS,GAAG,QAAQ,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;IAC7C,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,CAAC,6CAA6C;IACnF,CAAC;IAED,4EAA4E;IAC5E,2CAA2C;IAC3C,MAAM,OAAO,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,iBAAiB,CAAC;IACjD,8EAA8E;IAC9E,4EAA4E;IAC5E,iEAAiE;IACjE,qEAAqE;IACrE,IACE,OAAO,KAAK,IAAI;QAChB,SAAS,CAAC,IAAI,KAAK,QAAQ;QAC3B,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE;QAC5B,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,EAC5B,CAAC;QACD,SAAS,GAAG,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,OAAO,EAAE,CAAC;IAC1D,CAAC;IACD,MAAM,SAAS,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC;IACtC,IAAI,OAAO,KAAK,IAAI,IAAI,CAAC,SAAS,CAAC,EAAE,IAAI,SAAS,CAAC,iBAAiB,KAAK,IAAI,EAAE,CAAC;QAC9E,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC;IACrC,CAAC;IACD,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,SAAS,CAAC,iBAAiB,CAAC,EAAE,CAAC;QAClD,MAAM,IAAI,mBAAmB,CAC3B,iEAAiE;YAC/D,kBAAkB,CACrB,CAAC;IACJ,CAAC;IAED,8DAA8D;IAC9D,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC;IAClD,KAAK,MAAM,CAAC,IAAI,iBAAiB,CAAC,SAAS,CAAC,EAAE,CAAC;QAC7C,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,CAAC,qBAAqB;IACjF,CAAC;IAED,+BAA+B;IAC/B,MAAM,OAAO,GAAG,gBAAgB,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IAClD,IAAI,OAAO,KAAK,UAAU,EAAE,CAAC;QAC3B,MAAM,IAAI,mBAAmB,CAC3B,mEAAmE;YACjE,sCAAsC,CACzC,CAAC;IACJ,CAAC;IACD,IAAI,OAAO,KAAK,cAAc;QAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC;IAEnE,+DAA+D;IAC/D,MAAM,OAAO,GAAG,WAAW,CAAC,SAAS,CAAC,CAAC,MAAM,KAAK,WAAW,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC;IAC3E,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC;AAClD,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CAAC,GAAe;IACtD,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,GAAG,MAAM,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC1D,IAAI,CAAC,UAAU;QAAE,OAAO,GAAG,CAAC;IAC5B,OAAO,cAAc,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;AAC7D,CAAC","sourcesContent":["/**\n * Symbolic simplification of a scalar `ExprNode` via MathTS (v0.12 — optional\n * supplement to symbolic composition).\n *\n * Composing two bridges' symbolic forms leaves an UNSIMPLIFIED AST — CT-1 is\n * `k_B·(ℏc³/8πG·mass·k_B)·ln2`, with `k_B` uncancelled. This folds it to the\n * canonical `ℏc³·ln2/(8πG·mass)` using `@danielsimonjr/mathts-functions`'\n * `simplify` (the same OPTIONAL peer the Path-A formula parser loads).\n *\n * Pipeline (Adam+Eve-vetted — docs/planning/v0.12.0-Symbolic-Simplification-\n * Design.md): GENSYM every non-exponent leaf to a mathjs-safe identifier\n * (shared by name, so repeated leaves cancel), render FULLY-PARENTHESIZED\n * (EVE-A — no precedence ambiguity), `parse`+`simplify`, walk the result back\n * (un-gensym, INTEGER-exponent-strict — EVE/Adam HIGH-1). Three guards make a\n * black-box CAS safe to trust:\n *   1. dimensional — `validate(simplified)` dim `equals` the original's;\n *   2. structural — non-numeric symbols of the result ⊆ those of the original\n *      (no leaf invented — Adam HIGH-2 / EVE-B);\n *   3. numeric    — `evalExpr` agrees over ≥2 finite synthesized probes at\n *      rel tol 1e-9 (Adam CRITICAL-2 / EVE-C).\n * A representable result that DISAGREES dimensionally/numerically THROWS (a\n * bug to surface); anything we cannot represent / verify / load degrades to a\n * graceful no-op (return the original, `simplified:false`).\n *\n * INTERNAL — surfaced via `upt symbolic --simplify`.\n *\n * @module composition/expr-simplify\n */\n\nimport type { ExprNode } from '../dimensional/validator.js';\nimport { validate } from '../dimensional/validator.js';\nimport { equals } from '../dimensional/algebra.js';\nimport type { Dimension } from '../dimensional/types.js';\nimport { DIMENSIONLESS } from '../dimensional/types.js';\nimport { evalExpr } from './expr-eval.js';\nimport { CONSTANTS } from '../dimensional/symbolic-constants.js';\nimport type { Observable } from './compose-symbolic.js';\nimport { makeObservable } from './compose-symbolic.js';\nimport { renderScalarLeaf } from './mathts-scalar-symbols.js';\nimport { quietly } from './mathts-quiet.js';\n\n/** A simplification completed but produced a dimensionally/numerically wrong\n *  result (a real bug — not a graceful no-op). @internal */\nclass SimplificationError extends Error {\n  constructor(message: string) {\n    super(message);\n    this.name = 'SimplificationError';\n  }\n}\n\n/** The bits of a MathTS (mathjs-style) AST node the walk-back reads — pinned\n *  + runtime-verified (Adam CRITICAL-1). */\ninterface MathNode {\n  readonly type?: string;\n  readonly op?: string;\n  readonly name?: string;\n  readonly value?: unknown;\n  readonly args?: MathNode[];\n  readonly content?: MathNode;\n  toString(): string;\n}\ninterface MathtsSimplifyModule {\n  parse(expr: string): MathNode;\n  simplify(node: MathNode): MathNode;\n}\n\n/** Thrown internally when a node cannot be rendered/walked — caught and turned\n *  into a graceful no-op (never escapes the module). */\nclass Unsupported extends Error {}\n\n// ---------------------------------------------------------------------------\n// Optional-peer load — cache + quietly + simplify-smoke (mirrors\n// formula-registry.ts).\n// ---------------------------------------------------------------------------\n\nlet cached: Promise<MathtsSimplifyModule | null> | undefined;\n\n/** Load + smoke-test the peer. A peer with `parse` but a missing/broken\n *  `simplify` (it must actually CANCEL) is rejected → null (graceful no-op). */\nasync function detect(): Promise<MathtsSimplifyModule | null> {\n  try {\n    // Import AND smoke-test inside the ONE suppression window this module\n    // opens (`mathts-quiet.ts` states the invariant): the WASM-fallback\n    // chatter fires lazily on first parse/simplify, not only at import, and\n    // the smoke below is that first use. Later calls run with the console\n    // untouched.\n    return await quietly(async () => {\n      const mod = (await import(\n        '@danielsimonjr/mathts-functions'\n      )) as unknown as MathtsSimplifyModule;\n      if (typeof mod.parse !== 'function' || typeof mod.simplify !== 'function') {\n        return null;\n      }\n      // Smoke: g0 must cancel out of (g0)*((g1)/(g0)) → only g1 remains.\n      const s = mod.simplify(mod.parse('(g0)*((g1)/(g0))'));\n      const names = new Set<string>();\n      collectMathSymbols(s, names);\n      return names.size === 1 && names.has('g1') ? mod : null;\n    });\n  } catch {\n    return null;\n  }\n}\n\nfunction loadSimplifier(): Promise<MathtsSimplifyModule | null> {\n  cached ??= detect();\n  return cached;\n}\n\nfunction collectMathSymbols(n: MathNode, out: Set<string>): void {\n  if (n.type === 'SymbolNode' && n.name) out.add(n.name);\n  if (n.content) collectMathSymbols(n.content, out);\n  for (const a of n.args ?? []) collectMathSymbols(a, out);\n}\n\n// ---------------------------------------------------------------------------\n// ExprNode → gensym string (fully parenthesized) and back.\n// ---------------------------------------------------------------------------\n\ninterface LeafMeta {\n  readonly name: string;\n  readonly dim: Dimension;\n}\n\nconst isLiteral = (name: string): boolean => Number.isFinite(Number(name));\n\n/** Render a scalar ExprNode to a mathjs-safe, fully-parenthesized string,\n *  gensym'ing each non-literal leaf by NAME (so repeats share an identifier\n *  and can cancel). Throws `Unsupported` on non-scalar arms. */\nfunction renderGensym(\n  expr: ExprNode,\n  gensymOf: Map<string, string>,\n  meta: Map<string, LeafMeta>,\n): string {\n  switch (expr.kind) {\n    case 'symbol':\n      return renderScalarLeaf(expr, gensymOf, meta);\n    case 'op': {\n      if (expr.op === '^') {\n        const exp = expr.args[1];\n        if (!exp || exp.kind !== 'symbol' || !isLiteral(exp.name)) {\n          throw new Unsupported();\n        }\n        return `(${renderGensym(expr.args[0], gensymOf, meta)})^${Number(exp.name)}`;\n      }\n      if (expr.args.length === 0) throw new Unsupported();\n      const parts = expr.args.map((a) => `(${renderGensym(a, gensymOf, meta)})`);\n      return `(${parts.join(expr.op)})`;\n    }\n    default:\n      throw new Unsupported(); // integral / derivative / tensor arms\n  }\n}\n\nconst lit = (v: number): ExprNode => ({ kind: 'symbol', name: String(v), dim: DIMENSIONLESS });\n\n/** Walk a simplified MathTS node back to an ExprNode, un-gensym'ing leaves and\n *  rejecting anything outside UPT's integer-exponent scalar model (→ throws\n *  `Unsupported`, a graceful no-op). */\nfunction walkBack(node: MathNode, meta: Map<string, LeafMeta>): ExprNode {\n  switch (node.type) {\n    case 'ConstantNode': {\n      if (typeof node.value !== 'number' || !Number.isFinite(node.value)) {\n        throw new Unsupported();\n      }\n      return lit(node.value);\n    }\n    case 'SymbolNode': {\n      const m = node.name !== undefined ? meta.get(node.name) : undefined;\n      if (!m) throw new Unsupported(); // a symbol we did not issue\n      return { kind: 'symbol', name: m.name, dim: m.dim };\n    }\n    case 'ParenthesisNode':\n      if (!node.content) throw new Unsupported();\n      return walkBack(node.content, meta);\n    case 'OperatorNode': {\n      const op = node.op;\n      const args = node.args ?? [];\n      if (op === '^') {\n        if (args.length !== 2) throw new Unsupported();\n        const exp = args[1];\n        if (\n          exp.type !== 'ConstantNode' ||\n          typeof exp.value !== 'number' ||\n          !Number.isInteger(exp.value)\n        ) {\n          throw new Unsupported(); // non-integer exponent — not in ℤ⁷ model\n        }\n        return {\n          kind: 'op',\n          op: '^',\n          args: [walkBack(args[0], meta), lit(exp.value)],\n        };\n      }\n      if ((op === '+' || op === '-') && args.length === 1) {\n        // unary minus → (-1) * arg\n        return { kind: 'op', op: '*', args: [lit(-1), walkBack(args[0], meta)] };\n      }\n      if (op === '+' || op === '-' || op === '*' || op === '/') {\n        if (args.length < 2) throw new Unsupported();\n        return { kind: 'op', op, args: args.map((a) => walkBack(a, meta)) };\n      }\n      throw new Unsupported();\n    }\n    default:\n      throw new Unsupported(); // FunctionNode (sqrt/cbrt/…) etc.\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Guards.\n// ---------------------------------------------------------------------------\n\nfunction symbolNames(expr: ExprNode, out: string[] = []): string[] {\n  if (expr.kind === 'symbol') out.push(expr.name);\n  else if (expr.kind === 'op') for (const a of expr.args) symbolNames(a, out);\n  else if (expr.kind === 'integral') {\n    symbolNames(expr.over, out);\n    symbolNames(expr.integrand, out);\n  } else if (expr.kind === 'derivative') {\n    symbolNames(expr.of, out);\n    symbolNames(expr.wrt, out);\n  }\n  return out;\n}\n\nconst nonNumericSymbols = (expr: ExprNode): string[] =>\n  symbolNames(expr).filter((n) => !isLiteral(n));\n\nconst PROBE_VALUES = [2.3, 3.7, 5.1, 7.9, 11.3, 13.1, 17.9, 19.3];\nconst PROBE_MULTIPLIERS = [1, 1.7, 0.41, 2.9];\n\n/** Numeric agreement of `original` and `candidate` over synthesized probes.\n *  Free (non-constant) leaves get distinct, mutually-incommensurate values to\n *  avoid accidental cancellation. <2 finite probes ⇒ 'insufficient' (cannot\n *  verify — EVE-C). */\nfunction numericAgreement(\n  original: ExprNode,\n  candidate: ExprNode,\n): 'agree' | 'disagree' | 'insufficient' {\n  const leaves = [...new Set(nonNumericSymbols(original))].filter(\n    (n) => !(n in CONSTANTS),\n  );\n  let finiteProbes = 0;\n  for (const mult of PROBE_MULTIPLIERS) {\n    const values: Record<string, number> = {};\n    leaves.forEach((leaf, i) => {\n      values[leaf] = PROBE_VALUES[i % PROBE_VALUES.length] * mult;\n    });\n    let a: number;\n    let b: number;\n    try {\n      a = evalExpr(original, values);\n      b = evalExpr(candidate, values);\n    } catch {\n      continue; // a probe drove evalExpr non-finite — skip it\n    }\n    if (!Number.isFinite(a) || !Number.isFinite(b)) continue;\n    finiteProbes++;\n    if (Math.abs(a - b) / Math.abs(b || 1) > 1e-9) return 'disagree';\n  }\n  return finiteProbes >= 2 ? 'agree' : 'insufficient';\n}\n\n// ---------------------------------------------------------------------------\n// Public entry points.\n// ---------------------------------------------------------------------------\n\n/** The result of attempting to simplify an expression. */\ninterface SimplifyResult {\n  readonly expr: ExprNode;\n  /** True iff MathTS was present AND produced a guard-passing, distinct form. */\n  readonly simplified: boolean;\n}\n\n/**\n * Whether the optional MathTS simplifier peer is installed AND passes its\n * smoke test.\n *\n * {@link simplifyExpr} returns `simplified: false` both when the peer is absent\n * and when it is present but could not reduce the expression, so a caller that\n * must report WHY nothing happened (the atlas witness runner's `peer-absent`\n * versus `not-simplified`) needs this separate signal. Shares the same cached\n * detection, so it costs nothing after the first call.\n *\n * @internal\n */\nexport async function isSimplifierAvailable(): Promise<boolean> {\n  return (await loadSimplifier()) !== null;\n}\n\n/**\n * Simplify a scalar `ExprNode` via MathTS, guarded. Returns the original\n * unchanged (`simplified:false`) when the peer is absent or the result cannot\n * be represented/verified; THROWS {@link SimplificationError} only when a\n * representable result disagrees dimensionally/numerically. See module docs.\n *\n * @internal\n */\nexport async function simplifyExpr(expr: ExprNode): Promise<SimplifyResult> {\n  const mod = await loadSimplifier();\n  if (!mod) return { expr, simplified: false };\n\n  const gensymOf = new Map<string, string>();\n  const meta = new Map<string, LeafMeta>();\n  let candidate: ExprNode;\n  try {\n    const str = renderGensym(expr, gensymOf, meta);\n    // The peer can THROW on some forms (e.g. a known mathts `simplify` BigInt\n    // bug on nested `a/(b/c²)`); that, like an unsupported node, is a graceful\n    // no-op, not an error. The console is not touched here: the peer's first\n    // use already ran inside `detect`'s load window.\n    const simplifiedNode = mod.simplify(mod.parse(str));\n    candidate = walkBack(simplifiedNode, meta);\n  } catch {\n    return { expr, simplified: false }; // unsupported / unrepresentable / peer threw\n  }\n\n  // Guard 1 — dimensional. Inability to validate ⇒ no-op; a CHANGED dimension\n  // is a representable disagreement ⇒ throw.\n  const origDim = validate(expr).inferredDimension;\n  // A literal ZERO carries every dimension: `x − x` with `x` a length is a zero\n  // LENGTH, but the CAS hands back a bare dimensionless `0`. Re-stamp it with\n  // the original dimension, or this guard would reject every exact\n  // cancellation of a dimensioned expression as a \"changed dimension\".\n  if (\n    origDim !== null &&\n    candidate.kind === 'symbol' &&\n    candidate.name.trim() !== '' &&\n    Number(candidate.name) === 0\n  ) {\n    candidate = { kind: 'symbol', name: '0', dim: origDim };\n  }\n  const newResult = validate(candidate);\n  if (origDim === null || !newResult.ok || newResult.inferredDimension === null) {\n    return { expr, simplified: false };\n  }\n  if (!equals(origDim, newResult.inferredDimension)) {\n    throw new SimplificationError(\n      `simplifyExpr: the simplified form changed dimension — a CAS or ` +\n        `walk-back error.`,\n    );\n  }\n\n  // Guard 2 — structural subset (no non-numeric leaf invented).\n  const origSyms = new Set(nonNumericSymbols(expr));\n  for (const s of nonNumericSymbols(candidate)) {\n    if (!origSyms.has(s)) return { expr, simplified: false }; // suspicious ⇒ no-op\n  }\n\n  // Guard 3 — numeric agreement.\n  const verdict = numericAgreement(expr, candidate);\n  if (verdict === 'disagree') {\n    throw new SimplificationError(\n      `simplifyExpr: the simplified form disagrees numerically with the ` +\n        `original — a CAS or walk-back error.`,\n    );\n  }\n  if (verdict === 'insufficient') return { expr, simplified: false };\n\n  // Identical-structure ⇒ nothing gained; report not simplified.\n  const changed = symbolNames(candidate).length !== symbolNames(expr).length;\n  return { expr: candidate, simplified: changed };\n}\n\n/**\n * Simplify a composed {@link Observable}: returns a freshly-RECONSTRUCTED\n * Observable (new strict `evaluate` closure over the simplified `expr` +\n * recomputed `leaves`) when simplification succeeds, else the original\n * unchanged. See module docs.\n *\n * @internal\n */\nexport async function simplifyObservable(obs: Observable): Promise<Observable> {\n  const { expr, simplified } = await simplifyExpr(obs.expr);\n  if (!simplified) return obs;\n  return makeObservable(obs.name, obs.symbol, obs.dim, expr);\n}\n"]}
+{"version":3,"file":"expr-simplify.js","sourceRoot":"","sources":["../../src/composition/expr-simplify.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AAGH,OAAO,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AACvD,OAAO,EAAE,MAAM,EAAE,MAAM,2BAA2B,CAAC;AAEnD,OAAO,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AACxD,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC1C,OAAO,EAAE,iBAAiB,EAAE,gBAAgB,EAAE,MAAM,8BAA8B,CAAC;AACnF,OAAO,EAAE,oBAAoB,EAAE,MAAM,sCAAsC,CAAC;AAE5E,OAAO,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,EAAE,gBAAgB,EAAE,MAAM,4BAA4B,CAAC;AAC9D,OAAO,EAAE,KAAK,IAAI,WAAW,EAAE,QAAQ,IAAI,cAAc,EAAE,MAAM,iCAAiC,CAAC;AACnG,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAEhD;4DAC4D;AAC5D,MAAM,mBAAoB,SAAQ,KAAK;IACrC,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,qBAAqB,CAAC;IACpC,CAAC;CACF;AAkBD;wDACwD;AACxD,MAAM,WAAY,SAAQ,KAAK;CAAG;AAElC,8EAA8E;AAC9E,yEAAyE;AACzE,8EAA8E;AAE9E,IAAI,MAAwC,CAAC;AAE7C;;;;;;GAMG;AACH,SAAS,cAAc;IACrB,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,MAAM,CAAC;IACxC,MAAM,GAAG,GAAyB;QAChC,KAAK,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,WAAW,CAAC,IAAI,CAAwB;QACzD,QAAQ,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,cAAc,CAAC,IAAa,CAAwB;KACzE,CAAC;IACF,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,WAAW,CAAC,GAAG,EAAE,CAAC,kBAAkB,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,kBAAkB,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;IAC1F,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;QACzC,MAAM,IAAI,KAAK,CAAC,4EAA4E,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACxH,CAAC;IACD,MAAM,GAAG,GAAG,CAAC;IACb,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,kBAAkB,CAAC,CAAW,EAAE,GAAgB;IACvD,IAAI,CAAC,CAAC,IAAI,KAAK,YAAY,IAAI,CAAC,CAAC,IAAI;QAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACvD,IAAI,CAAC,CAAC,OAAO;QAAE,kBAAkB,CAAC,CAAC,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;IAClD,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,IAAI,EAAE;QAAE,kBAAkB,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;AAC3D,CAAC;AAYD,MAAM,SAAS,GAAG,gBAAgB,CAAC;AAEnC;;;;;;;;GAQG;AACH,MAAM,UAAU,YAAY,CAC1B,IAAc,EACd,QAA6B,EAC7B,IAA2B;IAE3B,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,QAAQ;YACX,OAAO,gBAAgB,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;QAChD,KAAK,IAAI,EAAE,CAAC;YACV,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;gBACpB,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACzB,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC1D,MAAM,IAAI,WAAW,EAAE,CAAC;gBAC1B,CAAC;gBACD,OAAO,IAAI,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,KAAK,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/E,CAAC;YACD,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;gBAAE,MAAM,IAAI,WAAW,EAAE,CAAC;YACpD,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC3B,MAAM,GAAG,GAAG,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAE,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;gBACxD,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG;oBAAE,OAAO,MAAM,GAAG,IAAI,CAAC;gBAC1C,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG;oBAAE,OAAO,IAAI,GAAG,GAAG,CAAC;YACzC,CAAC;YACD,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,YAAY,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;YAC3E,OAAO,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC;QACpC,CAAC;QACD;YACE,MAAM,IAAI,WAAW,EAAE,CAAC,CAAC,sCAAsC;IACnE,CAAC;AACH,CAAC;AAED,MAAM,GAAG,GAAG,CAAC,CAAS,EAAY,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,aAAa,EAAE,CAAC,CAAC;AAE/F;;wCAEwC;AACxC,SAAS,QAAQ,CAAC,IAAc,EAAE,IAA2B;IAC3D,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,cAAc,EAAE,CAAC;YACpB,IAAI,OAAO,IAAI,CAAC,KAAK,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACnE,MAAM,IAAI,WAAW,EAAE,CAAC;YAC1B,CAAC;YACD,OAAO,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACzB,CAAC;QACD,KAAK,YAAY,EAAE,CAAC;YAClB,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YACpE,IAAI,CAAC,CAAC;gBAAE,MAAM,IAAI,WAAW,EAAE,CAAC,CAAC,4BAA4B;YAC7D,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC;QACtD,CAAC;QACD,KAAK,iBAAiB;YACpB,IAAI,CAAC,IAAI,CAAC,OAAO;gBAAE,MAAM,IAAI,WAAW,EAAE,CAAC;YAC3C,OAAO,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QACtC,KAAK,cAAc,EAAE,CAAC;YACpB,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;YACnB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;YAC7B,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;gBACf,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;oBAAE,MAAM,IAAI,WAAW,EAAE,CAAC;gBAC/C,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;gBACpB,IACE,GAAG,CAAC,IAAI,KAAK,cAAc;oBAC3B,OAAO,GAAG,CAAC,KAAK,KAAK,QAAQ;oBAC7B,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAC5B,CAAC;oBACD,MAAM,IAAI,WAAW,EAAE,CAAC,CAAC,yCAAyC;gBACpE,CAAC;gBACD,OAAO;oBACL,IAAI,EAAE,IAAI;oBACV,EAAE,EAAE,GAAG;oBACP,IAAI,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;iBAChD,CAAC;YACJ,CAAC;YACD,IAAI,EAAE,KAAK,GAAG,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACpC,2BAA2B;gBAC3B,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC;YAC3E,CAAC;YACD,IAAI,EAAE,KAAK,GAAG,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,6BAA6B;YAClG,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;gBACzD,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;oBAAE,MAAM,IAAI,WAAW,EAAE,CAAC;gBAC7C,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC;YACtE,CAAC;YACD,MAAM,IAAI,WAAW,EAAE,CAAC;QAC1B,CAAC;QACD;YACE,MAAM,IAAI,WAAW,EAAE,CAAC,CAAC,kCAAkC;IAC/D,CAAC;AACH,CAAC;AAED,8EAA8E;AAC9E,UAAU;AACV,8EAA8E;AAE9E,SAAS,WAAW,CAAC,IAAc,EAAE,GAAG,GAAa,EAAE;IACrD,iBAAiB,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,EAAE,gBAAgB,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC;IACzG,OAAO,GAAG,CAAC;AACb,CAAC;AAED,MAAM,iBAAiB,GAAG,CAAC,IAAc,EAAY,EAAE,CACrD,WAAW,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;AAEjD,MAAM,YAAY,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;AAClE,MAAM,iBAAiB,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;AAE9C;;;uBAGuB;AACvB,SAAS,gBAAgB,CACvB,QAAkB,EAClB,SAAmB;IAEnB,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAC7D,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAChC,CAAC;IACF,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,KAAK,MAAM,IAAI,IAAI,iBAAiB,EAAE,CAAC;QACrC,MAAM,MAAM,GAA2B,EAAE,CAAC;QAC1C,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;YACzB,MAAM,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC;QAC9D,CAAC,CAAC,CAAC;QACH,IAAI,CAAS,CAAC;QACd,IAAI,CAAS,CAAC;QACd,IAAI,CAAC;YACH,CAAC,GAAG,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;YAC/B,CAAC,GAAG,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;QAClC,CAAC;QAAC,MAAM,CAAC;YACP,SAAS,CAAC,8CAA8C;QAC1D,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,SAAS;QACzD,YAAY,EAAE,CAAC;QACf,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI;YAAE,OAAO,UAAU,CAAC;IACnE,CAAC;IACD,OAAO,YAAY,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,cAAc,CAAC;AACtD,CAAC;AAaD;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,qBAAqB;IACzC,cAAc,EAAE,CAAC;IACjB,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,YAAY,CAAC,IAAc;IAC/C,MAAM,GAAG,GAAG,cAAc,EAAE,CAAC;IAE7B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAoB,CAAC;IACzC,IAAI,SAAmB,CAAC;IACxB,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,YAAY,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;QAC/C,wEAAwE;QACxE,2EAA2E;QAC3E,sEAAsE;QACtE,gDAAgD;QAChD,MAAM,cAAc,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;QACpD,SAAS,GAAG,QAAQ,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;IAC7C,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,CAAC,+CAA+C;IACrF,CAAC;IAED,4EAA4E;IAC5E,2CAA2C;IAC3C,MAAM,OAAO,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,iBAAiB,CAAC;IACjD,8EAA8E;IAC9E,4EAA4E;IAC5E,iEAAiE;IACjE,qEAAqE;IACrE,IACE,OAAO,KAAK,IAAI;QAChB,SAAS,CAAC,IAAI,KAAK,QAAQ;QAC3B,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE;QAC5B,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,EAC5B,CAAC;QACD,SAAS,GAAG,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,OAAO,EAAE,CAAC;IAC1D,CAAC;IACD,MAAM,SAAS,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC;IACtC,IAAI,OAAO,KAAK,IAAI,IAAI,CAAC,SAAS,CAAC,EAAE,IAAI,SAAS,CAAC,iBAAiB,KAAK,IAAI,EAAE,CAAC;QAC9E,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC;IACrC,CAAC;IACD,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,SAAS,CAAC,iBAAiB,CAAC,EAAE,CAAC;QAClD,MAAM,IAAI,mBAAmB,CAC3B,iEAAiE;YAC/D,kBAAkB,CACrB,CAAC;IACJ,CAAC;IAED,8DAA8D;IAC9D,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC;IAClD,KAAK,MAAM,CAAC,IAAI,iBAAiB,CAAC,SAAS,CAAC,EAAE,CAAC;QAC7C,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,CAAC,qBAAqB;IACjF,CAAC;IAED,+BAA+B;IAC/B,MAAM,OAAO,GAAG,gBAAgB,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IAClD,IAAI,OAAO,KAAK,UAAU,EAAE,CAAC;QAC3B,MAAM,IAAI,mBAAmB,CAC3B,mEAAmE;YACjE,sCAAsC,CACzC,CAAC;IACJ,CAAC;IACD,IAAI,OAAO,KAAK,cAAc;QAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC;IAEnE,+DAA+D;IAC/D,MAAM,OAAO,GAAG,WAAW,CAAC,SAAS,CAAC,CAAC,MAAM,KAAK,WAAW,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC;IAC3E,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC;AAClD,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CAAC,GAAe;IACtD,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,GAAG,MAAM,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC1D,IAAI,CAAC,UAAU;QAAE,OAAO,GAAG,CAAC;IAC5B,OAAO,cAAc,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;AAC7D,CAAC","sourcesContent":["/**\n * Symbolic simplification of a scalar `ExprNode` through MathTS, a supplement\n * to symbolic composition.\n *\n * Composing two bridges' symbolic forms leaves an UNSIMPLIFIED AST — CT-1 is\n * `k_B·(ℏc³/8πG·mass·k_B)·ln2`, with `k_B` uncancelled. This folds it to the\n * canonical `ℏc³·ln2/(8πG·mass)` using `@danielsimonjr/mathts-functions`'\n * `simplify`, a required dependency.\n *\n * Pipeline (Adam+Eve-vetted — docs/planning/v0.12.0-Symbolic-Simplification-\n * Design.md): GENSYM every non-exponent leaf to a mathjs-safe identifier\n * (shared by name, so repeated leaves cancel), render FULLY-PARENTHESIZED\n * (EVE-A — no precedence ambiguity), `parse`+`simplify`, walk the result back\n * (un-gensym, INTEGER-exponent-strict — EVE/Adam HIGH-1). Three guards make a\n * black-box CAS safe to trust:\n *   1. dimensional — `validate(simplified)` dim `equals` the original's;\n *   2. structural — non-numeric symbols of the result ⊆ those of the original\n *      (no leaf invented — Adam HIGH-2 / EVE-B);\n *   3. numeric    — `evalExpr` agrees over ≥2 finite synthesized probes at\n *      rel tol 1e-9 (Adam CRITICAL-2 / EVE-C).\n * A representable result that DISAGREES dimensionally/numerically THROWS (a\n * bug to surface); anything we cannot represent or verify degrades to a\n * graceful no-op (return the original, `simplified:false`).\n *\n * INTERNAL — surfaced via `upt symbolic --simplify`.\n *\n * @module composition/expr-simplify\n */\n\nimport type { ExprNode } from '../dimensional/validator.js';\nimport { validate } from '../dimensional/validator.js';\nimport { equals } from '../dimensional/algebra.js';\nimport type { Dimension } from '../dimensional/types.js';\nimport { DIMENSIONLESS } from '../dimensional/types.js';\nimport { evalExpr } from './expr-eval.js';\nimport { forEachScalarLeaf, isDecimalLiteral } from '../dimensional/ast-leaves.js';\nimport { isRegisteredConstant } from '../dimensional/symbolic-constants.js';\nimport type { Observable } from './compose-symbolic.js';\nimport { makeObservable } from './compose-symbolic.js';\nimport { renderScalarLeaf } from './mathts-scalar-symbols.js';\nimport { parse as mathtsParse, simplify as mathtsSimplify } from '@danielsimonjr/mathts-functions';\nimport { quietlySync } from './mathts-quiet.js';\n\n/** A simplification completed but produced a dimensionally/numerically wrong\n *  result (a real bug — not a graceful no-op). @internal */\nclass SimplificationError extends Error {\n  constructor(message: string) {\n    super(message);\n    this.name = 'SimplificationError';\n  }\n}\n\n/** The bits of a MathTS (mathjs-style) AST node the walk-back reads — pinned\n *  + runtime-verified (Adam CRITICAL-1). */\ninterface MathNode {\n  readonly type?: string;\n  readonly op?: string;\n  readonly name?: string;\n  readonly value?: unknown;\n  readonly args?: MathNode[];\n  readonly content?: MathNode;\n  toString(): string;\n}\ninterface MathtsSimplifyModule {\n  parse(expr: string): MathNode;\n  simplify(node: MathNode): MathNode;\n}\n\n/** Thrown internally when a node cannot be rendered/walked — caught and turned\n *  into a graceful no-op (never escapes the module). */\nclass Unsupported extends Error {}\n\n// ---------------------------------------------------------------------------\n// The MathTS simplifier: a static import, bound once after a smoke test.\n// ---------------------------------------------------------------------------\n\nlet cached: MathtsSimplifyModule | undefined;\n\n/**\n * `parse` and `simplify`, bound once after a smoke test that `simplify`\n * CANCELS (`(g0)*((g1)/(g0))` must come back as `g1` alone). The smoke is the\n * first use, so it runs inside the one console window (`mathts-quiet.ts`).\n * MathTS is a required dependency, so a failed smoke is a defect of that\n * dependency and throws; it is not read as an absent simplifier.\n */\nfunction loadSimplifier(): MathtsSimplifyModule {\n  if (cached !== undefined) return cached;\n  const mod: MathtsSimplifyModule = {\n    parse: (text) => mathtsParse(text) as unknown as MathNode,\n    simplify: (node) => mathtsSimplify(node as never) as unknown as MathNode,\n  };\n  const names = new Set<string>();\n  quietlySync(() => collectMathSymbols(mod.simplify(mod.parse('(g0)*((g1)/(g0))')), names));\n  if (names.size !== 1 || !names.has('g1')) {\n    throw new Error(`expr-simplify: MathTS simplify did not cancel g0 in the smoke test (left ${[...names].join(', ')})`);\n  }\n  cached = mod;\n  return cached;\n}\n\nfunction collectMathSymbols(n: MathNode, out: Set<string>): void {\n  if (n.type === 'SymbolNode' && n.name) out.add(n.name);\n  if (n.content) collectMathSymbols(n.content, out);\n  for (const a of n.args ?? []) collectMathSymbols(a, out);\n}\n\n// ---------------------------------------------------------------------------\n// ExprNode → gensym string (fully parenthesized) and back.\n// ---------------------------------------------------------------------------\n\n/** The leaf a gensym stands for: its name and dimension. @internal */\nexport interface LeafMeta {\n  readonly name: string;\n  readonly dim: Dimension;\n}\n\nconst isLiteral = isDecimalLiteral;\n\n/**\n * Render a scalar ExprNode to a mathjs-safe, fully-parenthesized string,\n * gensym'ing each non-literal leaf by NAME (so repeats share an identifier\n * and can cancel). Throws on a non-scalar arm and on a non-literal exponent;\n * `algebraic-equivalence.ts` renders both sides of a quotient through one\n * gensym table with it.\n *\n * @internal\n */\nexport function renderGensym(\n  expr: ExprNode,\n  gensymOf: Map<string, string>,\n  meta: Map<string, LeafMeta>,\n): string {\n  switch (expr.kind) {\n    case 'symbol':\n      return renderScalarLeaf(expr, gensymOf, meta);\n    case 'op': {\n      if (expr.op === '^') {\n        const exp = expr.args[1];\n        if (!exp || exp.kind !== 'symbol' || !isLiteral(exp.name)) {\n          throw new Unsupported();\n        }\n        return `(${renderGensym(expr.args[0], gensymOf, meta)})^${Number(exp.name)}`;\n      }\n      if (expr.args.length === 0) throw new Unsupported();\n      if (expr.args.length === 1) {\n        const arg = renderGensym(expr.args[0]!, gensymOf, meta);\n        if (expr.op === '-') return `(-(${arg}))`;\n        if (expr.op === '+') return `(${arg})`;\n      }\n      const parts = expr.args.map((a) => `(${renderGensym(a, gensymOf, meta)})`);\n      return `(${parts.join(expr.op)})`;\n    }\n    default:\n      throw new Unsupported(); // integral / derivative / tensor arms\n  }\n}\n\nconst lit = (v: number): ExprNode => ({ kind: 'symbol', name: String(v), dim: DIMENSIONLESS });\n\n/** Walk a simplified MathTS node back to an ExprNode, un-gensym'ing leaves and\n *  rejecting anything outside UPT's integer-exponent scalar model (→ throws\n *  `Unsupported`, a graceful no-op). */\nfunction walkBack(node: MathNode, meta: Map<string, LeafMeta>): ExprNode {\n  switch (node.type) {\n    case 'ConstantNode': {\n      if (typeof node.value !== 'number' || !Number.isFinite(node.value)) {\n        throw new Unsupported();\n      }\n      return lit(node.value);\n    }\n    case 'SymbolNode': {\n      const m = node.name !== undefined ? meta.get(node.name) : undefined;\n      if (!m) throw new Unsupported(); // a symbol we did not issue\n      return { kind: 'symbol', name: m.name, dim: m.dim };\n    }\n    case 'ParenthesisNode':\n      if (!node.content) throw new Unsupported();\n      return walkBack(node.content, meta);\n    case 'OperatorNode': {\n      const op = node.op;\n      const args = node.args ?? [];\n      if (op === '^') {\n        if (args.length !== 2) throw new Unsupported();\n        const exp = args[1];\n        if (\n          exp.type !== 'ConstantNode' ||\n          typeof exp.value !== 'number' ||\n          !Number.isInteger(exp.value)\n        ) {\n          throw new Unsupported(); // non-integer exponent — not in ℤ⁷ model\n        }\n        return {\n          kind: 'op',\n          op: '^',\n          args: [walkBack(args[0], meta), lit(exp.value)],\n        };\n      }\n      if (op === '-' && args.length === 1) {\n        // unary minus → (-1) * arg\n        return { kind: 'op', op: '*', args: [lit(-1), walkBack(args[0], meta)] };\n      }\n      if (op === '+' && args.length === 1) return walkBack(args[0], meta); // unary plus is the argument\n      if (op === '+' || op === '-' || op === '*' || op === '/') {\n        if (args.length < 2) throw new Unsupported();\n        return { kind: 'op', op, args: args.map((a) => walkBack(a, meta)) };\n      }\n      throw new Unsupported();\n    }\n    default:\n      throw new Unsupported(); // FunctionNode (sqrt/cbrt/…) etc.\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Guards.\n// ---------------------------------------------------------------------------\n\nfunction symbolNames(expr: ExprNode, out: string[] = []): string[] {\n  forEachScalarLeaf(expr, (leaf) => out.push(leaf.name), { integral: 'over+integrand', derivative: true });\n  return out;\n}\n\nconst nonNumericSymbols = (expr: ExprNode): string[] =>\n  symbolNames(expr).filter((n) => !isLiteral(n));\n\nconst PROBE_VALUES = [2.3, 3.7, 5.1, 7.9, 11.3, 13.1, 17.9, 19.3];\nconst PROBE_MULTIPLIERS = [1, 1.7, 0.41, 2.9];\n\n/** Numeric agreement of `original` and `candidate` over synthesized probes.\n *  Free (non-constant) leaves get distinct, mutually-incommensurate values to\n *  avoid accidental cancellation. <2 finite probes ⇒ 'insufficient' (cannot\n *  verify — EVE-C). */\nfunction numericAgreement(\n  original: ExprNode,\n  candidate: ExprNode,\n): 'agree' | 'disagree' | 'insufficient' {\n  const leaves = [...new Set(nonNumericSymbols(original))].filter(\n    (n) => !isRegisteredConstant(n),\n  );\n  let finiteProbes = 0;\n  for (const mult of PROBE_MULTIPLIERS) {\n    const values: Record<string, number> = {};\n    leaves.forEach((leaf, i) => {\n      values[leaf] = PROBE_VALUES[i % PROBE_VALUES.length] * mult;\n    });\n    let a: number;\n    let b: number;\n    try {\n      a = evalExpr(original, values);\n      b = evalExpr(candidate, values);\n    } catch {\n      continue; // a probe drove evalExpr non-finite — skip it\n    }\n    if (!Number.isFinite(a) || !Number.isFinite(b)) continue;\n    finiteProbes++;\n    if (Math.abs(a - b) / Math.abs(b || 1) > 1e-9) return 'disagree';\n  }\n  return finiteProbes >= 2 ? 'agree' : 'insufficient';\n}\n\n// ---------------------------------------------------------------------------\n// Public entry points.\n// ---------------------------------------------------------------------------\n\n/** The result of attempting to simplify an expression. */\ninterface SimplifyResult {\n  readonly expr: ExprNode;\n  /** True iff MathTS was present AND produced a guard-passing, distinct form. */\n  readonly simplified: boolean;\n}\n\n/**\n * Whether the MathTS simplifier is usable. MathTS is a required dependency, so\n * the answer is true; a simplifier that fails its smoke test throws instead.\n * The atlas witness runner reads it to choose between the simplifier and its\n * `peer-absent` path, which a caller still reaches by passing `null`.\n *\n * @internal\n */\nexport async function isSimplifierAvailable(): Promise<boolean> {\n  loadSimplifier();\n  return true;\n}\n\n/**\n * Simplify a scalar `ExprNode` via MathTS, guarded. Returns the original\n * unchanged (`simplified:false`) when the result cannot be represented or\n * verified; THROWS {@link SimplificationError} only when a\n * representable result disagrees dimensionally/numerically. See module docs.\n *\n * @internal\n */\nexport async function simplifyExpr(expr: ExprNode): Promise<SimplifyResult> {\n  const mod = loadSimplifier();\n\n  const gensymOf = new Map<string, string>();\n  const meta = new Map<string, LeafMeta>();\n  let candidate: ExprNode;\n  try {\n    const str = renderGensym(expr, gensymOf, meta);\n    // MathTS can THROW on some forms (e.g. a known mathts `simplify` BigInt\n    // bug on nested `a/(b/c²)`); that, like an unsupported node, is a graceful\n    // no-op, not an error. The console is not touched here: the first use\n    // already ran inside `loadSimplifier`'s window.\n    const simplifiedNode = mod.simplify(mod.parse(str));\n    candidate = walkBack(simplifiedNode, meta);\n  } catch {\n    return { expr, simplified: false }; // unsupported / unrepresentable / MathTS threw\n  }\n\n  // Guard 1 — dimensional. Inability to validate ⇒ no-op; a CHANGED dimension\n  // is a representable disagreement ⇒ throw.\n  const origDim = validate(expr).inferredDimension;\n  // A literal ZERO carries every dimension: `x − x` with `x` a length is a zero\n  // LENGTH, but the CAS hands back a bare dimensionless `0`. Re-stamp it with\n  // the original dimension, or this guard would reject every exact\n  // cancellation of a dimensioned expression as a \"changed dimension\".\n  if (\n    origDim !== null &&\n    candidate.kind === 'symbol' &&\n    candidate.name.trim() !== '' &&\n    Number(candidate.name) === 0\n  ) {\n    candidate = { kind: 'symbol', name: '0', dim: origDim };\n  }\n  const newResult = validate(candidate);\n  if (origDim === null || !newResult.ok || newResult.inferredDimension === null) {\n    return { expr, simplified: false };\n  }\n  if (!equals(origDim, newResult.inferredDimension)) {\n    throw new SimplificationError(\n      `simplifyExpr: the simplified form changed dimension — a CAS or ` +\n        `walk-back error.`,\n    );\n  }\n\n  // Guard 2 — structural subset (no non-numeric leaf invented).\n  const origSyms = new Set(nonNumericSymbols(expr));\n  for (const s of nonNumericSymbols(candidate)) {\n    if (!origSyms.has(s)) return { expr, simplified: false }; // suspicious ⇒ no-op\n  }\n\n  // Guard 3 — numeric agreement.\n  const verdict = numericAgreement(expr, candidate);\n  if (verdict === 'disagree') {\n    throw new SimplificationError(\n      `simplifyExpr: the simplified form disagrees numerically with the ` +\n        `original — a CAS or walk-back error.`,\n    );\n  }\n  if (verdict === 'insufficient') return { expr, simplified: false };\n\n  // Identical-structure ⇒ nothing gained; report not simplified.\n  const changed = symbolNames(candidate).length !== symbolNames(expr).length;\n  return { expr: candidate, simplified: changed };\n}\n\n/**\n * Simplify a composed {@link Observable}: returns a freshly-RECONSTRUCTED\n * Observable (new strict `evaluate` closure over the simplified `expr` +\n * recomputed `leaves`) when simplification succeeds, else the original\n * unchanged. See module docs.\n *\n * @internal\n */\nexport async function simplifyObservable(obs: Observable): Promise<Observable> {\n  const { expr, simplified } = await simplifyExpr(obs.expr);\n  if (!simplified) return obs;\n  return makeObservable(obs.name, obs.symbol, obs.dim, expr);\n}\n"]}

package/dist/composition/formula-shape.d.ts

@@ -9,14 +9,33 @@
  *
  * @module composition/formula-shape
  */
+import { Fraction } from '@danielsimonjr/mathts-core';
 import type { ExprNode } from '../dimensional/ast-types.js';
 /** `monomial` is a product of powers. `dimensional-sum` adds dimensionful terms. */
 type FormulaShape = 'monomial' | 'dimensional-sum';
 /**
- * Exponents of every symbol in a product, quotient, or literal integer power.
- * Undefined for a sum or any node that is not that monomial. The one reader
- * of a monomial's exponents: the canonical graph reads a count's exponent
- * from it, and a composed edge reads the junction's exponent from it.
+ * The rational a literal exponent stands for: a bounded-denominator scan at
+ * the fit's tolerance reads `0.3333333333333333` as `1/3`; a decimal that
+ * is no such rational (`0.3333`) is kept as the exact decimal it spells.
+ *
+ * @internal
+ */
+export declare function rationalExponentOf(name: string): Fraction | undefined;
+/**
+ * Exact exponents of every symbol in a product, quotient, or literal power,
+ * as core `Fraction`s. Undefined for a sum or any node that is not that
+ * monomial. A cancellation is an exact zero: `(x^(1/3))^3 / x` carries `x`
+ * at `0`, not at `2.2e-16`.
+ *
+ * @internal
+ */
+export declare function monomialExponentsExact(node: ExprNode | undefined): Map<string, Fraction> | undefined;
+/**
+ * Exponents of every symbol in a product, quotient, or literal power, as
+ * numbers: the projection of {@link monomialExponentsExact}. Undefined for a
+ * sum or any node that is not that monomial. The canonical graph reads a
+ * count's exponent from it, and a composed edge reads the junction's
+ * exponent from it.
  *
  * @internal
  */

package/dist/composition/formula-shape.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"formula-shape.d.ts","sourceRoot":"","sources":["../../src/composition/formula-shape.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AAK5D,oFAAoF;AACpF,KAAK,YAAY,GAAG,UAAU,GAAG,iBAAiB,CAAC;AAInD;;;;;;;GAOG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,QAAQ,GAAG,SAAS,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,SAAS,CAiC7F;AAuFD;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,QAAQ,GAAG,YAAY,CAEzD"}
+{"version":3,"file":"formula-shape.d.ts","sourceRoot":"","sources":["../../src/composition/formula-shape.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,4BAA4B,CAAC;AACtD,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AAO5D,oFAAoF;AACpF,KAAK,YAAY,GAAG,UAAU,GAAG,iBAAiB,CAAC;AAEnD;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,MAAM,GAAG,QAAQ,GAAG,SAAS,CAWrE;AAED;;;;;;;GAOG;AACH,wBAAgB,sBAAsB,CAAC,IAAI,EAAE,QAAQ,GAAG,SAAS,GAAG,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,GAAG,SAAS,CAiCpG;AAED;;;;;;;;GAQG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,QAAQ,GAAG,SAAS,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,SAAS,CAI7F;AAuFD;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,QAAQ,GAAG,YAAY,CAEzD"}

package/dist/composition/formula-shape.js

@@ -9,44 +9,69 @@
  *
  * @module composition/formula-shape
  */
+import { Fraction } from '@danielsimonjr/mathts-core';
+import { isDecimalLiteral } from '../dimensional/ast-leaves.js';
 import { divide, equals, multiply, power } from '../dimensional/algebra.js';
 import { DIMENSIONLESS } from '../dimensional/types.js';
-const NUMERIC_NAME = /^[+-]?(?:\d+(?:\.\d+)?|\.\d+)$/;
+import { fractionToNumber, rationalize } from './rational-exponent.js';
 /**
- * Exponents of every symbol in a product, quotient, or literal integer power.
- * Undefined for a sum or any node that is not that monomial. The one reader
- * of a monomial's exponents: the canonical graph reads a count's exponent
- * from it, and a composed edge reads the junction's exponent from it.
+ * The rational a literal exponent stands for: a bounded-denominator scan at
+ * the fit's tolerance reads `0.3333333333333333` as `1/3`; a decimal that
+ * is no such rational (`0.3333`) is kept as the exact decimal it spells.
  *
  * @internal
  */
-export function monomialExponents(node) {
+export function rationalExponentOf(name) {
+    if (!isDecimalLiteral(name))
+        return undefined;
+    const value = Number(name);
+    if (!Number.isFinite(value))
+        return undefined;
+    const scanned = rationalize(value);
+    if (scanned !== undefined)
+        return scanned;
+    try {
+        return Fraction.parse(name);
+    }
+    catch {
+        return Fraction.fromNumber(value);
+    }
+}
+/**
+ * Exact exponents of every symbol in a product, quotient, or literal power,
+ * as core `Fraction`s. Undefined for a sum or any node that is not that
+ * monomial. A cancellation is an exact zero: `(x^(1/3))^3 / x` carries `x`
+ * at `0`, not at `2.2e-16`.
+ *
+ * @internal
+ */
+export function monomialExponentsExact(node) {
     if (node === undefined)
         return undefined;
     if (node.kind === 'symbol')
-        return new Map([[node.name, 1]]);
+        return new Map([[node.name, new Fraction(1)]]);
     if (node.kind !== 'op')
         return undefined;
     if (node.op === '*') {
         const acc = new Map();
         for (const arg of node.args) {
-            const part = monomialExponents(arg);
+            const part = monomialExponentsExact(arg);
             if (part === undefined)
                 return undefined;
             for (const [name, exp] of part)
-                acc.set(name, (acc.get(name) ?? 0) + exp);
+                acc.set(name, (acc.get(name) ?? new Fraction(0)).add(exp));
         }
         return acc;
     }
     if (node.op === '/') {
         if (node.args.length !== 2)
             return undefined;
-        const numerator = monomialExponents(node.args[0]);
-        const denominator = monomialExponents(node.args[1]);
+        const numerator = monomialExponentsExact(node.args[0]);
+        const denominator = monomialExponentsExact(node.args[1]);
         if (numerator === undefined || denominator === undefined)
             return undefined;
         for (const [name, exp] of denominator)
-            numerator.set(name, (numerator.get(name) ?? 0) - exp);
+            numerator.set(name, (numerator.get(name) ?? new Fraction(0)).sub(exp));
         return numerator;
     }
     if (node.op === '^') {
@@ -54,21 +79,36 @@ export function monomialExponents(node) {
         const expNode = node.args[1];
         if (base === undefined || expNode === undefined || expNode.kind !== 'symbol')
             return undefined;
-        const exp = Number(expNode.name);
-        if (!Number.isFinite(exp))
+        const exp = rationalExponentOf(expNode.name);
+        if (exp === undefined)
             return undefined;
-        const inner = monomialExponents(base);
+        const inner = monomialExponentsExact(base);
         if (inner === undefined)
             return undefined;
         for (const [name, innerExp] of inner)
-            inner.set(name, innerExp * exp);
+            inner.set(name, innerExp.multiply(exp));
         return inner;
     }
     return undefined;
 }
+/**
+ * Exponents of every symbol in a product, quotient, or literal power, as
+ * numbers: the projection of {@link monomialExponentsExact}. Undefined for a
+ * sum or any node that is not that monomial. The canonical graph reads a
+ * count's exponent from it, and a composed edge reads the junction's
+ * exponent from it.
+ *
+ * @internal
+ */
+export function monomialExponents(node) {
+    const exact = monomialExponentsExact(node);
+    if (exact === undefined)
+        return undefined;
+    return new Map([...exact].map(([name, exp]) => [name, fractionToNumber(exp)]));
+}
 /** A dimensionless symbol whose name is a number, the way a literal exponent is written. */
 function numericExponent(node) {
-    if (node.kind !== 'symbol' || !NUMERIC_NAME.test(node.name))
+    if (node.kind !== 'symbol' || !isDecimalLiteral(node.name))
         return undefined;
     if (!equals(node.dim, DIMENSIONLESS))
         return undefined;

package/dist/composition/formula-shape.js.map

@@ -1 +1 @@
-{"version":3,"file":"formula-shape.js","sourceRoot":"","sources":["../../src/composition/formula-shape.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAGH,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,2BAA2B,CAAC;AAE5E,OAAO,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AAKxD,MAAM,YAAY,GAAG,gCAAgC,CAAC;AAEtD;;;;;;;GAOG;AACH,MAAM,UAAU,iBAAiB,CAAC,IAA0B;IAC1D,IAAI,IAAI,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IACzC,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ;QAAE,OAAO,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7D,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;QAAE,OAAO,SAAS,CAAC;IACzC,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;QACpB,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;QACtC,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YAC5B,MAAM,IAAI,GAAG,iBAAiB,CAAC,GAAG,CAAC,CAAC;YACpC,IAAI,IAAI,KAAK,SAAS;gBAAE,OAAO,SAAS,CAAC;YACzC,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,IAAI;gBAAE,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;QAC5E,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACD,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;QACpB,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC7C,MAAM,SAAS,GAAG,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAClD,MAAM,WAAW,GAAG,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACpD,IAAI,SAAS,KAAK,SAAS,IAAI,WAAW,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QAC3E,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,WAAW;YAAE,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;QAC7F,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;QACpB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,IAAI,IAAI,KAAK,SAAS,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,CAAC,IAAI,KAAK,QAAQ;YAAE,OAAO,SAAS,CAAC;QAC/F,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACjC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC;YAAE,OAAO,SAAS,CAAC;QAC5C,MAAM,KAAK,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC;QACtC,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QAC1C,KAAK,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,KAAK;YAAE,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,GAAG,GAAG,CAAC,CAAC;QACtE,OAAO,KAAK,CAAC;IACf,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,4FAA4F;AAC5F,SAAS,eAAe,CAAC,IAAc;IACrC,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;QAAE,OAAO,SAAS,CAAC;IAC9E,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,aAAa,CAAC;QAAE,OAAO,SAAS,CAAC;IACvD,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5B,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;AAC5C,CAAC;AAED;;;;GAIG;AACH,SAAS,KAAK,CAAC,IAAc;IAC3B,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC,GAAG,CAAC;IAC5C,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK;QAAE,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAChD,IAAI,IAAI,CAAC,IAAI,KAAK,gBAAgB,EAAE,CAAC;QACnC,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC5B,IAAI,GAAG,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,aAAa,CAAC;YAAE,OAAO,SAAS,CAAC;QACvE,OAAO,aAAa,CAAC;IACvB,CAAC;IACD,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;QAAE,OAAO,SAAS,CAAC;IACzC,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;QACvC,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC7C,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAClC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC;YAAE,OAAO,SAAS,CAAC;QACxD,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAE,CAAC;QACvB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAE,EAAE,KAAK,CAAC,CAAC;YAAE,OAAO,SAAS,CAAC;QAC5D,OAAO,KAAK,CAAC;IACf,CAAC;IACD,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;QACpB,IAAI,GAAG,GAAc,aAAa,CAAC;QACnC,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YAC5B,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;YACrB,IAAI,CAAC,KAAK,SAAS;gBAAE,OAAO,SAAS,CAAC;YACtC,GAAG,GAAG,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACzB,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACD,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;QACpB,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC7C,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC;QACjC,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC;QACjC,IAAI,GAAG,KAAK,SAAS,IAAI,GAAG,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QAC7D,OAAO,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IAC1B,CAAC;IACD,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;QACpB,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC7C,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC;QAClC,MAAM,GAAG,GAAG,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC;QAC3C,IAAI,IAAI,KAAK,SAAS,IAAI,GAAG,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QAC9D,OAAO,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IAC1B,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,uFAAuF;AACvF,SAAS,QAAQ,CAAC,IAAc;IAC9B,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC,IAAI,CAAC;IACzC,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,IAAI,KAAK,gBAAgB,IAAI,IAAI,CAAC,IAAI,KAAK,aAAa;QAAE,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC5G,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;QAC7B,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,IAAI,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC3I,CAAC;IACD,IAAI,IAAI,CAAC,IAAI,KAAK,YAAY;QAAE,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;IAC3D,IAAI,IAAI,CAAC,IAAI,KAAK,wBAAwB;QAAE,OAAO,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5F,OAAO,EAAE,CAAC;AACZ,CAAC;AAED;;;;GAIG;AACH,SAAS,gBAAgB,CAAC,IAAc;IACtC,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,GAAG,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,CAAC;QAAE,OAAO,KAAK,CAAC;IAC7E,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAClC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC;QAAE,OAAO,IAAI,CAAC;IACnD,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,CAAE,EAAE,aAAa,CAAC,CAAC,CAAC;AACtD,CAAC;AAED,SAAS,iBAAiB,CAAC,IAAc;IACvC,IAAI,gBAAgB,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IACxC,OAAO,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;AAChD,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAAC,IAAc;IACzC,OAAO,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,UAAU,CAAC;AAClE,CAAC","sourcesContent":["/**\n * Whether an encoded formula is a product of powers, or a sum of dimensionful terms.\n *\n * Buckingham-π returns a monomial. A formula that adds dimensionful terms is\n * not that monomial, even when a unique monomial exists in the same variables\n * (fast magnetosonic speed: the monomial is the sound speed; the formula is\n * √(c_s² + v_A²)). A sum whose every addend is dimensionless is still a\n * factor in a monomial: (1+R), (1−e²), (1 + E/(kT)).\n *\n * @module composition/formula-shape\n */\n\nimport type { ExprNode } from '../dimensional/ast-types.js';\nimport { divide, equals, multiply, power } from '../dimensional/algebra.js';\nimport type { Dimension } from '../dimensional/types.js';\nimport { DIMENSIONLESS } from '../dimensional/types.js';\n\n/** `monomial` is a product of powers. `dimensional-sum` adds dimensionful terms. */\ntype FormulaShape = 'monomial' | 'dimensional-sum';\n\nconst NUMERIC_NAME = /^[+-]?(?:\\d+(?:\\.\\d+)?|\\.\\d+)$/;\n\n/**\n * Exponents of every symbol in a product, quotient, or literal integer power.\n * Undefined for a sum or any node that is not that monomial. The one reader\n * of a monomial's exponents: the canonical graph reads a count's exponent\n * from it, and a composed edge reads the junction's exponent from it.\n *\n * @internal\n */\nexport function monomialExponents(node: ExprNode | undefined): Map<string, number> | undefined {\n  if (node === undefined) return undefined;\n  if (node.kind === 'symbol') return new Map([[node.name, 1]]);\n  if (node.kind !== 'op') return undefined;\n  if (node.op === '*') {\n    const acc = new Map<string, number>();\n    for (const arg of node.args) {\n      const part = monomialExponents(arg);\n      if (part === undefined) return undefined;\n      for (const [name, exp] of part) acc.set(name, (acc.get(name) ?? 0) + exp);\n    }\n    return acc;\n  }\n  if (node.op === '/') {\n    if (node.args.length !== 2) return undefined;\n    const numerator = monomialExponents(node.args[0]);\n    const denominator = monomialExponents(node.args[1]);\n    if (numerator === undefined || denominator === undefined) return undefined;\n    for (const [name, exp] of denominator) numerator.set(name, (numerator.get(name) ?? 0) - exp);\n    return numerator;\n  }\n  if (node.op === '^') {\n    const base = node.args[0];\n    const expNode = node.args[1];\n    if (base === undefined || expNode === undefined || expNode.kind !== 'symbol') return undefined;\n    const exp = Number(expNode.name);\n    if (!Number.isFinite(exp)) return undefined;\n    const inner = monomialExponents(base);\n    if (inner === undefined) return undefined;\n    for (const [name, innerExp] of inner) inner.set(name, innerExp * exp);\n    return inner;\n  }\n  return undefined;\n}\n\n/** A dimensionless symbol whose name is a number, the way a literal exponent is written. */\nfunction numericExponent(node: ExprNode): number | undefined {\n  if (node.kind !== 'symbol' || !NUMERIC_NAME.test(node.name)) return undefined;\n  if (!equals(node.dim, DIMENSIONLESS)) return undefined;\n  const n = Number(node.name);\n  return Number.isFinite(n) ? n : undefined;\n}\n\n/**\n * Dimension of a scalar node this classifier understands. `undefined` means\n * the node is not a product of powers of dimensioned symbols. A sum that\n * cannot be dimensioned is treated as dimensionful.\n */\nfunction dimOf(node: ExprNode): Dimension | undefined {\n  if (node.kind === 'symbol') return node.dim;\n  if (node.kind === 'abs') return dimOf(node.arg);\n  if (node.kind === 'transcendental') {\n    const arg = dimOf(node.arg);\n    if (arg === undefined || !equals(arg, DIMENSIONLESS)) return undefined;\n    return DIMENSIONLESS;\n  }\n  if (node.kind !== 'op') return undefined;\n  if (node.op === '+' || node.op === '-') {\n    if (node.args.length === 0) return undefined;\n    const dims = node.args.map(dimOf);\n    if (dims.some((d) => d === undefined)) return undefined;\n    const first = dims[0]!;\n    if (!dims.every((d) => equals(d!, first))) return undefined;\n    return first;\n  }\n  if (node.op === '*') {\n    let acc: Dimension = DIMENSIONLESS;\n    for (const arg of node.args) {\n      const d = dimOf(arg);\n      if (d === undefined) return undefined;\n      acc = multiply(acc, d);\n    }\n    return acc;\n  }\n  if (node.op === '/') {\n    if (node.args.length !== 2) return undefined;\n    const num = dimOf(node.args[0]!);\n    const den = dimOf(node.args[1]!);\n    if (num === undefined || den === undefined) return undefined;\n    return divide(num, den);\n  }\n  if (node.op === '^') {\n    if (node.args.length !== 2) return undefined;\n    const base = dimOf(node.args[0]!);\n    const exp = numericExponent(node.args[1]!);\n    if (base === undefined || exp === undefined) return undefined;\n    return power(base, exp);\n  }\n  return undefined;\n}\n\n/** Scalar children. A tensor node this walker does not understand contributes none. */\nfunction children(node: ExprNode): readonly ExprNode[] {\n  if (node.kind === 'op') return node.args;\n  if (node.kind === 'abs' || node.kind === 'transcendental' || node.kind === 'dirac-delta') return [node.arg];\n  if (node.kind === 'integral') {\n    return [node.over, node.integrand, ...(node.lower === undefined ? [] : [node.lower]), ...(node.upper === undefined ? [] : [node.upper])];\n  }\n  if (node.kind === 'derivative') return [node.of, node.wrt];\n  if (node.kind === 'variational-derivative') return [node.functional, node.field, node.over];\n  return [];\n}\n\n/**\n * True when `node` adds terms that are not all dimensionless. An addend whose\n * dimension cannot be read counts as dimensionful: a sum we cannot see is not\n * reported as a monomial.\n */\nfunction isDimensionalSum(node: ExprNode): boolean {\n  if (node.kind !== 'op' || (node.op !== '+' && node.op !== '-')) return false;\n  const dims = node.args.map(dimOf);\n  if (dims.some((d) => d === undefined)) return true;\n  return dims.some((d) => !equals(d!, DIMENSIONLESS));\n}\n\nfunction hasDimensionalSum(node: ExprNode): boolean {\n  if (isDimensionalSum(node)) return true;\n  return children(node).some(hasDimensionalSum);\n}\n\n/**\n * Classify `expr`. A node this walker does not understand, and that is not\n * itself a sum, stays a monomial so an unread tensor equation is not\n * reclassified.\n */\nexport function formulaShape(expr: ExprNode): FormulaShape {\n  return hasDimensionalSum(expr) ? 'dimensional-sum' : 'monomial';\n}\n"]}
+{"version":3,"file":"formula-shape.js","sourceRoot":"","sources":["../../src/composition/formula-shape.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,4BAA4B,CAAC;AAEtD,OAAO,EAAE,gBAAgB,EAAE,MAAM,8BAA8B,CAAC;AAChE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,2BAA2B,CAAC;AAE5E,OAAO,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AACxD,OAAO,EAAE,gBAAgB,EAAE,WAAW,EAAE,MAAM,wBAAwB,CAAC;AAKvE;;;;;;GAMG;AACH,MAAM,UAAU,kBAAkB,CAAC,IAAY;IAC7C,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC;QAAE,OAAO,SAAS,CAAC;IAC9C,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;IAC3B,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IAC9C,MAAM,OAAO,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC;IACnC,IAAI,OAAO,KAAK,SAAS;QAAE,OAAO,OAAO,CAAC;IAC1C,IAAI,CAAC;QACH,OAAO,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC9B,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,QAAQ,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;IACpC,CAAC;AACH,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,sBAAsB,CAAC,IAA0B;IAC/D,IAAI,IAAI,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IACzC,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ;QAAE,OAAO,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3E,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;QAAE,OAAO,SAAS,CAAC;IACzC,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;QACpB,MAAM,GAAG,GAAG,IAAI,GAAG,EAAoB,CAAC;QACxC,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YAC5B,MAAM,IAAI,GAAG,sBAAsB,CAAC,GAAG,CAAC,CAAC;YACzC,IAAI,IAAI,KAAK,SAAS;gBAAE,OAAO,SAAS,CAAC;YACzC,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,IAAI;gBAAE,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAC7F,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACD,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;QACpB,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC7C,MAAM,SAAS,GAAG,sBAAsB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACvD,MAAM,WAAW,GAAG,sBAAsB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACzD,IAAI,SAAS,KAAK,SAAS,IAAI,WAAW,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QAC3E,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,WAAW;YAAE,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9G,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;QACpB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,IAAI,IAAI,KAAK,SAAS,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,CAAC,IAAI,KAAK,QAAQ;YAAE,OAAO,SAAS,CAAC;QAC/F,MAAM,GAAG,GAAG,kBAAkB,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAC7C,IAAI,GAAG,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QACxC,MAAM,KAAK,GAAG,sBAAsB,CAAC,IAAI,CAAC,CAAC;QAC3C,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QAC1C,KAAK,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,KAAK;YAAE,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9E,OAAO,KAAK,CAAC;IACf,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,iBAAiB,CAAC,IAA0B;IAC1D,MAAM,KAAK,GAAG,sBAAsB,CAAC,IAAI,CAAC,CAAC;IAC3C,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IAC1C,OAAO,IAAI,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AACjF,CAAC;AAED,4FAA4F;AAC5F,SAAS,eAAe,CAAC,IAAc;IACrC,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC;QAAE,OAAO,SAAS,CAAC;IAC7E,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,aAAa,CAAC;QAAE,OAAO,SAAS,CAAC;IACvD,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5B,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;AAC5C,CAAC;AAED;;;;GAIG;AACH,SAAS,KAAK,CAAC,IAAc;IAC3B,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC,GAAG,CAAC;IAC5C,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK;QAAE,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAChD,IAAI,IAAI,CAAC,IAAI,KAAK,gBAAgB,EAAE,CAAC;QACnC,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC5B,IAAI,GAAG,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,aAAa,CAAC;YAAE,OAAO,SAAS,CAAC;QACvE,OAAO,aAAa,CAAC;IACvB,CAAC;IACD,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;QAAE,OAAO,SAAS,CAAC;IACzC,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;QACvC,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC7C,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAClC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC;YAAE,OAAO,SAAS,CAAC;QACxD,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAE,CAAC;QACvB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAE,EAAE,KAAK,CAAC,CAAC;YAAE,OAAO,SAAS,CAAC;QAC5D,OAAO,KAAK,CAAC;IACf,CAAC;IACD,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;QACpB,IAAI,GAAG,GAAc,aAAa,CAAC;QACnC,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YAC5B,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;YACrB,IAAI,CAAC,KAAK,SAAS;gBAAE,OAAO,SAAS,CAAC;YACtC,GAAG,GAAG,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACzB,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACD,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;QACpB,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC7C,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC;QACjC,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC;QACjC,IAAI,GAAG,KAAK,SAAS,IAAI,GAAG,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QAC7D,OAAO,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IAC1B,CAAC;IACD,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,EAAE,CAAC;QACpB,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC7C,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC;QAClC,MAAM,GAAG,GAAG,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC;QAC3C,IAAI,IAAI,KAAK,SAAS,IAAI,GAAG,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QAC9D,OAAO,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IAC1B,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,uFAAuF;AACvF,SAAS,QAAQ,CAAC,IAAc;IAC9B,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC,IAAI,CAAC;IACzC,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,IAAI,KAAK,gBAAgB,IAAI,IAAI,CAAC,IAAI,KAAK,aAAa;QAAE,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC5G,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;QAC7B,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,IAAI,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC3I,CAAC;IACD,IAAI,IAAI,CAAC,IAAI,KAAK,YAAY;QAAE,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;IAC3D,IAAI,IAAI,CAAC,IAAI,KAAK,wBAAwB;QAAE,OAAO,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5F,OAAO,EAAE,CAAC;AACZ,CAAC;AAED;;;;GAIG;AACH,SAAS,gBAAgB,CAAC,IAAc;IACtC,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,GAAG,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,CAAC;QAAE,OAAO,KAAK,CAAC;IAC7E,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAClC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC;QAAE,OAAO,IAAI,CAAC;IACnD,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,CAAE,EAAE,aAAa,CAAC,CAAC,CAAC;AACtD,CAAC;AAED,SAAS,iBAAiB,CAAC,IAAc;IACvC,IAAI,gBAAgB,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IACxC,OAAO,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;AAChD,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAAC,IAAc;IACzC,OAAO,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,UAAU,CAAC;AAClE,CAAC","sourcesContent":["/**\n * Whether an encoded formula is a product of powers, or a sum of dimensionful terms.\n *\n * Buckingham-π returns a monomial. A formula that adds dimensionful terms is\n * not that monomial, even when a unique monomial exists in the same variables\n * (fast magnetosonic speed: the monomial is the sound speed; the formula is\n * √(c_s² + v_A²)). A sum whose every addend is dimensionless is still a\n * factor in a monomial: (1+R), (1−e²), (1 + E/(kT)).\n *\n * @module composition/formula-shape\n */\n\nimport { Fraction } from '@danielsimonjr/mathts-core';\nimport type { ExprNode } from '../dimensional/ast-types.js';\nimport { isDecimalLiteral } from '../dimensional/ast-leaves.js';\nimport { divide, equals, multiply, power } from '../dimensional/algebra.js';\nimport type { Dimension } from '../dimensional/types.js';\nimport { DIMENSIONLESS } from '../dimensional/types.js';\nimport { fractionToNumber, rationalize } from './rational-exponent.js';\n\n/** `monomial` is a product of powers. `dimensional-sum` adds dimensionful terms. */\ntype FormulaShape = 'monomial' | 'dimensional-sum';\n\n/**\n * The rational a literal exponent stands for: a bounded-denominator scan at\n * the fit's tolerance reads `0.3333333333333333` as `1/3`; a decimal that\n * is no such rational (`0.3333`) is kept as the exact decimal it spells.\n *\n * @internal\n */\nexport function rationalExponentOf(name: string): Fraction | undefined {\n  if (!isDecimalLiteral(name)) return undefined;\n  const value = Number(name);\n  if (!Number.isFinite(value)) return undefined;\n  const scanned = rationalize(value);\n  if (scanned !== undefined) return scanned;\n  try {\n    return Fraction.parse(name);\n  } catch {\n    return Fraction.fromNumber(value);\n  }\n}\n\n/**\n * Exact exponents of every symbol in a product, quotient, or literal power,\n * as core `Fraction`s. Undefined for a sum or any node that is not that\n * monomial. A cancellation is an exact zero: `(x^(1/3))^3 / x` carries `x`\n * at `0`, not at `2.2e-16`.\n *\n * @internal\n */\nexport function monomialExponentsExact(node: ExprNode | undefined): Map<string, Fraction> | undefined {\n  if (node === undefined) return undefined;\n  if (node.kind === 'symbol') return new Map([[node.name, new Fraction(1)]]);\n  if (node.kind !== 'op') return undefined;\n  if (node.op === '*') {\n    const acc = new Map<string, Fraction>();\n    for (const arg of node.args) {\n      const part = monomialExponentsExact(arg);\n      if (part === undefined) return undefined;\n      for (const [name, exp] of part) acc.set(name, (acc.get(name) ?? new Fraction(0)).add(exp));\n    }\n    return acc;\n  }\n  if (node.op === '/') {\n    if (node.args.length !== 2) return undefined;\n    const numerator = monomialExponentsExact(node.args[0]);\n    const denominator = monomialExponentsExact(node.args[1]);\n    if (numerator === undefined || denominator === undefined) return undefined;\n    for (const [name, exp] of denominator) numerator.set(name, (numerator.get(name) ?? new Fraction(0)).sub(exp));\n    return numerator;\n  }\n  if (node.op === '^') {\n    const base = node.args[0];\n    const expNode = node.args[1];\n    if (base === undefined || expNode === undefined || expNode.kind !== 'symbol') return undefined;\n    const exp = rationalExponentOf(expNode.name);\n    if (exp === undefined) return undefined;\n    const inner = monomialExponentsExact(base);\n    if (inner === undefined) return undefined;\n    for (const [name, innerExp] of inner) inner.set(name, innerExp.multiply(exp));\n    return inner;\n  }\n  return undefined;\n}\n\n/**\n * Exponents of every symbol in a product, quotient, or literal power, as\n * numbers: the projection of {@link monomialExponentsExact}. Undefined for a\n * sum or any node that is not that monomial. The canonical graph reads a\n * count's exponent from it, and a composed edge reads the junction's\n * exponent from it.\n *\n * @internal\n */\nexport function monomialExponents(node: ExprNode | undefined): Map<string, number> | undefined {\n  const exact = monomialExponentsExact(node);\n  if (exact === undefined) return undefined;\n  return new Map([...exact].map(([name, exp]) => [name, fractionToNumber(exp)]));\n}\n\n/** A dimensionless symbol whose name is a number, the way a literal exponent is written. */\nfunction numericExponent(node: ExprNode): number | undefined {\n  if (node.kind !== 'symbol' || !isDecimalLiteral(node.name)) return undefined;\n  if (!equals(node.dim, DIMENSIONLESS)) return undefined;\n  const n = Number(node.name);\n  return Number.isFinite(n) ? n : undefined;\n}\n\n/**\n * Dimension of a scalar node this classifier understands. `undefined` means\n * the node is not a product of powers of dimensioned symbols. A sum that\n * cannot be dimensioned is treated as dimensionful.\n */\nfunction dimOf(node: ExprNode): Dimension | undefined {\n  if (node.kind === 'symbol') return node.dim;\n  if (node.kind === 'abs') return dimOf(node.arg);\n  if (node.kind === 'transcendental') {\n    const arg = dimOf(node.arg);\n    if (arg === undefined || !equals(arg, DIMENSIONLESS)) return undefined;\n    return DIMENSIONLESS;\n  }\n  if (node.kind !== 'op') return undefined;\n  if (node.op === '+' || node.op === '-') {\n    if (node.args.length === 0) return undefined;\n    const dims = node.args.map(dimOf);\n    if (dims.some((d) => d === undefined)) return undefined;\n    const first = dims[0]!;\n    if (!dims.every((d) => equals(d!, first))) return undefined;\n    return first;\n  }\n  if (node.op === '*') {\n    let acc: Dimension = DIMENSIONLESS;\n    for (const arg of node.args) {\n      const d = dimOf(arg);\n      if (d === undefined) return undefined;\n      acc = multiply(acc, d);\n    }\n    return acc;\n  }\n  if (node.op === '/') {\n    if (node.args.length !== 2) return undefined;\n    const num = dimOf(node.args[0]!);\n    const den = dimOf(node.args[1]!);\n    if (num === undefined || den === undefined) return undefined;\n    return divide(num, den);\n  }\n  if (node.op === '^') {\n    if (node.args.length !== 2) return undefined;\n    const base = dimOf(node.args[0]!);\n    const exp = numericExponent(node.args[1]!);\n    if (base === undefined || exp === undefined) return undefined;\n    return power(base, exp);\n  }\n  return undefined;\n}\n\n/** Scalar children. A tensor node this walker does not understand contributes none. */\nfunction children(node: ExprNode): readonly ExprNode[] {\n  if (node.kind === 'op') return node.args;\n  if (node.kind === 'abs' || node.kind === 'transcendental' || node.kind === 'dirac-delta') return [node.arg];\n  if (node.kind === 'integral') {\n    return [node.over, node.integrand, ...(node.lower === undefined ? [] : [node.lower]), ...(node.upper === undefined ? [] : [node.upper])];\n  }\n  if (node.kind === 'derivative') return [node.of, node.wrt];\n  if (node.kind === 'variational-derivative') return [node.functional, node.field, node.over];\n  return [];\n}\n\n/**\n * True when `node` adds terms that are not all dimensionless. An addend whose\n * dimension cannot be read counts as dimensionful: a sum we cannot see is not\n * reported as a monomial.\n */\nfunction isDimensionalSum(node: ExprNode): boolean {\n  if (node.kind !== 'op' || (node.op !== '+' && node.op !== '-')) return false;\n  const dims = node.args.map(dimOf);\n  if (dims.some((d) => d === undefined)) return true;\n  return dims.some((d) => !equals(d!, DIMENSIONLESS));\n}\n\nfunction hasDimensionalSum(node: ExprNode): boolean {\n  if (isDimensionalSum(node)) return true;\n  return children(node).some(hasDimensionalSum);\n}\n\n/**\n * Classify `expr`. A node this walker does not understand, and that is not\n * itself a sum, stays a monomial so an unread tensor equation is not\n * reclassified.\n */\nexport function formulaShape(expr: ExprNode): FormulaShape {\n  return hasDimensionalSum(expr) ? 'dimensional-sum' : 'monomial';\n}\n"]}