@stevenvo780/st-lang 4.5.1 → 4.6.0

package/dist/categorical/functor.js

@@ -0,0 +1,139 @@
+"use strict";
+// ============================================================
+// ST Categorical — Functor y NaturalTransformation
+// ============================================================
+// Wrappers genéricos para construir functores entre categorías
+// arbitrarias y verificar sus leyes vía muestreo sobre los
+// morfismos del dominio.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.mkFunctor = mkFunctor;
+exports.identityFunctor = identityFunctor;
+exports.composeFunctors = composeFunctors;
+exports.mkNaturalTransformation = mkNaturalTransformation;
+exports.identityNT = identityNT;
+/**
+ * Crea un functor verificable. El cliente pasa los mapeos a
+ * objetos/morfismos; las verificaciones de leyes se derivan
+ * recorriendo los `morphisms` de la categoría fuente.
+ */
+function mkFunctor(opts) {
+    const { name, source, target, onObjects, onMorphisms } = opts;
+    function verifyIdentityPreservation() {
+        for (const o of source.objects) {
+            const idC = source.identity(o);
+            const Fid = onMorphisms(idC);
+            const idDFo = target.identity(onObjects(o));
+            if (!target.eqMor(Fid, idDFo))
+                return false;
+        }
+        return true;
+    }
+    function verifyComposition(sample = 50) {
+        const ms = Array.from(source.morphisms.values());
+        let checked = 0;
+        for (const f of ms) {
+            for (const g of ms) {
+                if (!source.eqObj(source.target(f), source.source(g)))
+                    continue;
+                const gf = source.compose(g, f);
+                const Fgf = onMorphisms(gf);
+                const Fg = onMorphisms(g);
+                const Ff = onMorphisms(f);
+                const FgFf = target.compose(Fg, Ff);
+                if (!target.eqMor(Fgf, FgFf))
+                    return false;
+                if (++checked >= sample)
+                    return true;
+            }
+        }
+        return true;
+    }
+    return {
+        name,
+        source,
+        target,
+        onObjects,
+        onMorphisms,
+        verifyIdentityPreservation,
+        verifyComposition,
+    };
+}
+/**
+ * Functor identidad `Id_C : C → C`. Útil para tests y como elemento
+ * neutro de la composición de functores.
+ */
+function identityFunctor(cat) {
+    return mkFunctor({
+        name: `Id_${cat.name}`,
+        source: cat,
+        target: cat,
+        onObjects: (o) => o,
+        onMorphisms: (m) => m,
+    });
+}
+/**
+ * Composición de functores F ; G = G ∘ F. La firma respeta la
+ * categoría source/target original sin perder información de tipos.
+ */
+function composeFunctors(G, F) {
+    if (F.target !== G.source) {
+        // Permitido si son la misma categoría por valor; pero como las
+        // categorías son objetos, exigimos identidad referencial.
+        throw new Error(`composeFunctors: F.target (${F.target.name}) !== G.source (${G.source.name})`);
+    }
+    return mkFunctor({
+        name: `${G.name}∘${F.name}`,
+        source: F.source,
+        target: G.target,
+        onObjects: (o) => G.onObjects(F.onObjects(o)),
+        onMorphisms: (m) => G.onMorphisms(F.onMorphisms(m)),
+    });
+}
+/**
+ * Crea una transformación natural η : F ⇒ G verificando su
+ * naturalidad por muestreo. El cliente pasa la familia de
+ * componentes `component(a) : F(a) → G(a)`.
+ */
+function mkNaturalTransformation(opts) {
+    const { name, source: F, target: G, component } = opts;
+    if (F.source !== G.source || F.target !== G.target) {
+        throw new Error('mkNaturalTransformation: F and G must be parallel functors');
+    }
+    const C = F.source;
+    const D = F.target;
+    function verifyNaturality(sample = 50) {
+        const ms = Array.from(C.morphisms.values());
+        let checked = 0;
+        for (const f of ms) {
+            const a = C.source(f);
+            const b = C.target(f);
+            const etaA = component(a);
+            const etaB = component(b);
+            const Gf = G.onMorphisms(f);
+            const Ff = F.onMorphisms(f);
+            // G(f) ∘ η_a vs η_b ∘ F(f)
+            const left = D.compose(Gf, etaA);
+            const right = D.compose(etaB, Ff);
+            if (!D.eqMor(left, right))
+                return false;
+            if (++checked >= sample)
+                return true;
+        }
+        return true;
+    }
+    return { name, source: F, target: G, component, verifyNaturality };
+}
+/**
+ * Transformación natural identidad `id_F : F ⇒ F` con componentes
+ * `id_{F(a)}`. Sirve como elemento neutro de composición vertical.
+ */
+function identityNT(F) {
+    return mkNaturalTransformation({
+        name: `id_${F.name}`,
+        source: F,
+        target: F,
+        component: (a) => F.target.identity(F.onObjects(a)),
+    });
+}
+//# sourceMappingURL=functor.js.map

package/dist/categorical/functor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"functor.js","sourceRoot":"","sources":["../../src/categorical/functor.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,mDAAmD;AACnD,+DAA+D;AAC/D,+DAA+D;AAC/D,2DAA2D;AAC3D,yBAAyB;AACzB,+DAA+D;;AAS/D,8BA8CC;AAMD,0CAQC;AAMD,0CAgBC;AAOD,0DAiCC;AAMD,gCASC;AA9ID;;;;GAIG;AACH,SAAgB,SAAS,CAAiB,IAMzC;IACC,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,WAAW,EAAE,GAAG,IAAI,CAAC;IAE9D,SAAS,0BAA0B;QACjC,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;YAC/B,MAAM,GAAG,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC/B,MAAM,GAAG,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;YAC7B,MAAM,KAAK,GAAG,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5C,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;QAC9C,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,SAAS,iBAAiB,CAAC,MAAM,GAAG,EAAE;QACpC,MAAM,EAAE,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC;QACjD,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;YACnB,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;gBACnB,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;oBAAE,SAAS;gBAChE,MAAM,EAAE,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBAChC,MAAM,GAAG,GAAG,WAAW,CAAC,EAAE,CAAC,CAAC;gBAC5B,MAAM,EAAE,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;gBAC1B,MAAM,EAAE,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;gBAC1B,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;gBACpC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC;oBAAE,OAAO,KAAK,CAAC;gBAC3C,IAAI,EAAE,OAAO,IAAI,MAAM;oBAAE,OAAO,IAAI,CAAC;YACvC,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO;QACL,IAAI;QACJ,MAAM;QACN,MAAM;QACN,SAAS;QACT,WAAW;QACX,0BAA0B;QAC1B,iBAAiB;KAClB,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,SAAgB,eAAe,CAAO,GAAmB;IACvD,OAAO,SAAS,CAAC;QACf,IAAI,EAAE,MAAM,GAAG,CAAC,IAAI,EAAE;QACtB,MAAM,EAAE,GAAG;QACX,MAAM,EAAE,GAAG;QACX,SAAS,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACnB,WAAW,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;KACtB,CAAC,CAAC;AACL,CAAC;AAED;;;GAGG;AACH,SAAgB,eAAe,CAC7B,CAA0B,EAC1B,CAA0B;IAE1B,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;QAC1B,+DAA+D;QAC/D,0DAA0D;QAC1D,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAC,MAAM,CAAC,IAAI,mBAAmB,CAAC,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;IAClG,CAAC;IACD,OAAO,SAAS,CAAC;QACf,IAAI,EAAE,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,EAAE;QAC3B,MAAM,EAAE,CAAC,CAAC,MAAM;QAChB,MAAM,EAAE,CAAC,CAAC,MAAM;QAChB,SAAS,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAC7C,WAAW,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;KACpD,CAAC,CAAC;AACL,CAAC;AAED;;;;GAIG;AACH,SAAgB,uBAAuB,CAAiB,IAKvD;IACC,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,SAAS,EAAE,GAAG,IAAI,CAAC;IACvD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;QACnD,MAAM,IAAI,KAAK,CAAC,4DAA4D,CAAC,CAAC;IAChF,CAAC;IACD,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACnB,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IAEnB,SAAS,gBAAgB,CAAC,MAAM,GAAG,EAAE;QACnC,MAAM,EAAE,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC;QAC5C,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;YACnB,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACtB,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACtB,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,EAAE,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,EAAE,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;YAC5B,2BAA2B;YAC3B,MAAM,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YACjC,MAAM,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YAClC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YACxC,IAAI,EAAE,OAAO,IAAI,MAAM;gBAAE,OAAO,IAAI,CAAC;QACvC,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,SAAS,EAAE,gBAAgB,EAAE,CAAC;AACrE,CAAC;AAED;;;GAGG;AACH,SAAgB,UAAU,CACxB,CAA0B;IAE1B,OAAO,uBAAuB,CAAC;QAC7B,IAAI,EAAE,MAAM,CAAC,CAAC,IAAI,EAAE;QACpB,MAAM,EAAE,CAAC;QACT,MAAM,EAAE,CAAC;QACT,SAAS,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;KACpD,CAAC,CAAC;AACL,CAAC"}

package/dist/categorical/index.d.ts

@@ -0,0 +1,11 @@
+export type { Category, Functor, NaturalTransformation, Cone, Cocone, Diagram, MonoidalCategory, MorId, } from './types';
+export { FinSet, mkFinSetMor } from './fin-set';
+export type { FinSetObj, FinSetMor } from './fin-set';
+export { Poset } from './poset';
+export type { PosetMor } from './poset';
+export { Free } from './free';
+export type { FreeMor } from './free';
+export { mkFunctor, identityFunctor, composeFunctors, mkNaturalTransformation, identityNT, } from './functor';
+export { isCone, isLimit, product, coproduct, equalizer, coequalizer } from './limits';
+export { FinSetMonoidal } from './monoidal';
+//# sourceMappingURL=index.d.ts.map

package/dist/categorical/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/categorical/index.ts"],"names":[],"mappings":"AAQA,YAAY,EACV,QAAQ,EACR,OAAO,EACP,qBAAqB,EACrB,IAAI,EACJ,MAAM,EACN,OAAO,EACP,gBAAgB,EAChB,KAAK,GACN,MAAM,SAAS,CAAC;AAEjB,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,WAAW,CAAC;AAChD,YAAY,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AAEtD,OAAO,EAAE,KAAK,EAAE,MAAM,SAAS,CAAC;AAChC,YAAY,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAExC,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAC9B,YAAY,EAAE,OAAO,EAAE,MAAM,QAAQ,CAAC;AAEtC,OAAO,EACL,SAAS,EACT,eAAe,EACf,eAAe,EACf,uBAAuB,EACvB,UAAU,GACX,MAAM,WAAW,CAAC;AAEnB,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,WAAW,EAAE,MAAM,UAAU,CAAC;AAEvF,OAAO,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC"}

package/dist/categorical/index.js

@@ -0,0 +1,33 @@
+"use strict";
+// ============================================================
+// ST Categorical — Punto de entrada público
+// ============================================================
+// Re-exporta primitivas de teoría de categorías: Category,
+// Functor, NaturalTransformation, límites/colímites concretos
+// en FinSet, y estructura monoidal estricta sobre FinSet.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.FinSetMonoidal = exports.coequalizer = exports.equalizer = exports.coproduct = exports.product = exports.isLimit = exports.isCone = exports.identityNT = exports.mkNaturalTransformation = exports.composeFunctors = exports.identityFunctor = exports.mkFunctor = exports.Free = exports.Poset = exports.mkFinSetMor = exports.FinSet = void 0;
+var fin_set_1 = require("./fin-set");
+Object.defineProperty(exports, "FinSet", { enumerable: true, get: function () { return fin_set_1.FinSet; } });
+Object.defineProperty(exports, "mkFinSetMor", { enumerable: true, get: function () { return fin_set_1.mkFinSetMor; } });
+var poset_1 = require("./poset");
+Object.defineProperty(exports, "Poset", { enumerable: true, get: function () { return poset_1.Poset; } });
+var free_1 = require("./free");
+Object.defineProperty(exports, "Free", { enumerable: true, get: function () { return free_1.Free; } });
+var functor_1 = require("./functor");
+Object.defineProperty(exports, "mkFunctor", { enumerable: true, get: function () { return functor_1.mkFunctor; } });
+Object.defineProperty(exports, "identityFunctor", { enumerable: true, get: function () { return functor_1.identityFunctor; } });
+Object.defineProperty(exports, "composeFunctors", { enumerable: true, get: function () { return functor_1.composeFunctors; } });
+Object.defineProperty(exports, "mkNaturalTransformation", { enumerable: true, get: function () { return functor_1.mkNaturalTransformation; } });
+Object.defineProperty(exports, "identityNT", { enumerable: true, get: function () { return functor_1.identityNT; } });
+var limits_1 = require("./limits");
+Object.defineProperty(exports, "isCone", { enumerable: true, get: function () { return limits_1.isCone; } });
+Object.defineProperty(exports, "isLimit", { enumerable: true, get: function () { return limits_1.isLimit; } });
+Object.defineProperty(exports, "product", { enumerable: true, get: function () { return limits_1.product; } });
+Object.defineProperty(exports, "coproduct", { enumerable: true, get: function () { return limits_1.coproduct; } });
+Object.defineProperty(exports, "equalizer", { enumerable: true, get: function () { return limits_1.equalizer; } });
+Object.defineProperty(exports, "coequalizer", { enumerable: true, get: function () { return limits_1.coequalizer; } });
+var monoidal_1 = require("./monoidal");
+Object.defineProperty(exports, "FinSetMonoidal", { enumerable: true, get: function () { return monoidal_1.FinSetMonoidal; } });
+//# sourceMappingURL=index.js.map

package/dist/categorical/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/categorical/index.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,4CAA4C;AAC5C,+DAA+D;AAC/D,2DAA2D;AAC3D,8DAA8D;AAC9D,0DAA0D;AAC1D,+DAA+D;;;AAa/D,qCAAgD;AAAvC,iGAAA,MAAM,OAAA;AAAE,sGAAA,WAAW,OAAA;AAG5B,iCAAgC;AAAvB,8FAAA,KAAK,OAAA;AAGd,+BAA8B;AAArB,4FAAA,IAAI,OAAA;AAGb,qCAMmB;AALjB,oGAAA,SAAS,OAAA;AACT,0GAAA,eAAe,OAAA;AACf,0GAAA,eAAe,OAAA;AACf,kHAAA,uBAAuB,OAAA;AACvB,qGAAA,UAAU,OAAA;AAGZ,mCAAuF;AAA9E,gGAAA,MAAM,OAAA;AAAE,iGAAA,OAAO,OAAA;AAAE,iGAAA,OAAO,OAAA;AAAE,mGAAA,SAAS,OAAA;AAAE,mGAAA,SAAS,OAAA;AAAE,qGAAA,WAAW,OAAA;AAEpE,uCAA4C;AAAnC,0GAAA,cAAc,OAAA"}

package/dist/categorical/limits.d.ts

@@ -0,0 +1,64 @@
+import type { Category, Cone, Diagram } from './types';
+import { type FinSetMor, type FinSetObj } from './fin-set';
+/**
+ * Verifica que `cone` sea un cono sobre `diagram` en `cat`:
+ * para cada arista `e: i→j` del diagrama, `e ∘ leg(i) = leg(j)`.
+ */
+export declare function isCone<O, M>(cat: Category<O, M>, diagram: Diagram<O, M>, cone: Cone<O, M>): boolean;
+/**
+ * Comprueba si `cone` es límite del diagrama: para cada otro cono
+ * candidato sobre el diagrama, existe un único morfismo `u : apex' → apex`
+ * que conmuta con las patas. La búsqueda es por enumeración sobre
+ * los morfismos registrados en `cat`; sirve bien para categorías finitas
+ * pequeñas (FinSet con objetos chicos).
+ */
+export declare function isLimit<O, M>(cat: Category<O, M>, diagram: Diagram<O, M>, cone: Cone<O, M>): boolean;
+/**
+ * Producto binario en FinSet: A×B con proyecciones π1, π2.
+ * Construye el objeto producto como un nuevo `FinSetObj` con
+ * elementos `(a,b)` codificados como `"a∥b"` y lo registra en `cat`.
+ *
+ * Devuelve `null` si los objetos no pertenecen a la categoría.
+ *
+ * Nota: la categoría `cat` debe poder admitir nuevos objetos. Para
+ * nuestro uso pedimos que sea una `FinSet`-categoría construida con
+ * los carriers explícitos. En lugar de mutar `cat`, esta función
+ * regresa el producto + las proyecciones y deja al cliente
+ * reconstruir una categoría extendida si lo necesita.
+ */
+export declare function product(cat: Category<FinSetObj, FinSetMor>, a: FinSetObj, b: FinSetObj): {
+    obj: FinSetObj;
+    pi1: FinSetMor;
+    pi2: FinSetMor;
+    cat: Category<FinSetObj, FinSetMor>;
+} | null;
+/**
+ * Coproducto binario en FinSet: unión disjunta A⊔B. Usa prefijos
+ * `L:` y `R:` para tag-ear los elementos y produce las inyecciones
+ * canónicas in1, in2.
+ */
+export declare function coproduct(cat: Category<FinSetObj, FinSetMor>, a: FinSetObj, b: FinSetObj): {
+    obj: FinSetObj;
+    in1: FinSetMor;
+    in2: FinSetMor;
+    cat: Category<FinSetObj, FinSetMor>;
+} | null;
+/**
+ * Igualador en FinSet de un par paralelo `f, g : A → B`. El igualador
+ * es el subconjunto `E = { x ∈ A | f(x) = g(x) }` con inclusión `eq : E ↪ A`.
+ */
+export declare function equalizer(cat: Category<FinSetObj, FinSetMor>, f: FinSetMor, g: FinSetMor): {
+    obj: FinSetObj;
+    eq: FinSetMor;
+    cat: Category<FinSetObj, FinSetMor>;
+} | null;
+/**
+ * Coigualador (colimite dual): cociente A/~ donde x ~ y si existe
+ * z ∈ S con f(z)=x ∧ g(z)=y (cierre transitivo-simétrico).
+ */
+export declare function coequalizer(cat: Category<FinSetObj, FinSetMor>, f: FinSetMor, g: FinSetMor): {
+    obj: FinSetObj;
+    q: FinSetMor;
+    cat: Category<FinSetObj, FinSetMor>;
+} | null;
+//# sourceMappingURL=limits.d.ts.map

package/dist/categorical/limits.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"limits.d.ts","sourceRoot":"","sources":["../../src/categorical/limits.ts"],"names":[],"mappings":"AAaA,OAAO,KAAK,EAAE,QAAQ,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,SAAS,CAAC;AACvD,OAAO,EAAuB,KAAK,SAAS,EAAE,KAAK,SAAS,EAAE,MAAM,WAAW,CAAC;AAEhF;;;GAGG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,CAAC,EACzB,GAAG,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,EACnB,OAAO,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EACtB,IAAI,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,GACf,OAAO,CAYT;AAED;;;;;;GAMG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,CAAC,EAC1B,GAAG,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,EACnB,OAAO,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EACtB,IAAI,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,GACf,OAAO,CA2BT;AAgCD;;;;;;;;;;;;GAYG;AACH,wBAAgB,OAAO,CACrB,GAAG,EAAE,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC,EACnC,CAAC,EAAE,SAAS,EACZ,CAAC,EAAE,SAAS,GACX;IAAE,GAAG,EAAE,SAAS,CAAC;IAAC,GAAG,EAAE,SAAS,CAAC;IAAC,GAAG,EAAE,SAAS,CAAC;IAAC,GAAG,EAAE,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC,CAAA;CAAE,GAAG,IAAI,CAuBhG;AAED;;;;GAIG;AACH,wBAAgB,SAAS,CACvB,GAAG,EAAE,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC,EACnC,CAAC,EAAE,SAAS,EACZ,CAAC,EAAE,SAAS,GACX;IAAE,GAAG,EAAE,SAAS,CAAC;IAAC,GAAG,EAAE,SAAS,CAAC;IAAC,GAAG,EAAE,SAAS,CAAC;IAAC,GAAG,EAAE,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC,CAAA;CAAE,GAAG,IAAI,CAsBhG;AAED;;;GAGG;AACH,wBAAgB,SAAS,CACvB,GAAG,EAAE,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC,EACnC,CAAC,EAAE,SAAS,EACZ,CAAC,EAAE,SAAS,GACX;IAAE,GAAG,EAAE,SAAS,CAAC;IAAC,EAAE,EAAE,SAAS,CAAC;IAAC,GAAG,EAAE,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC,CAAA;CAAE,GAAG,IAAI,CAkB/E;AAED;;;GAGG;AACH,wBAAgB,WAAW,CACzB,GAAG,EAAE,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC,EACnC,CAAC,EAAE,SAAS,EACZ,CAAC,EAAE,SAAS,GACX;IAAE,GAAG,EAAE,SAAS,CAAC;IAAC,CAAC,EAAE,SAAS,CAAC;IAAC,GAAG,EAAE,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC,CAAA;CAAE,GAAG,IAAI,CAkC9E"}

package/dist/categorical/limits.js

@@ -0,0 +1,248 @@
+"use strict";
+// ============================================================
+// ST Categorical — Límites y colímites
+// ============================================================
+// Construcciones universales en FinSet (las más usadas):
+//   • product(a, b)    — producto binario A×B
+//   • coproduct(a, b)  — coproducto binario A⊔B
+//   • equalizer(f, g)  — igualador de un par paralelo
+//
+// Para casos generales también exponemos `isLimit` que recibe un
+// diagrama y un cono y verifica la propiedad universal por
+// muestreo sobre los conos candidatos del diagrama.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.isCone = isCone;
+exports.isLimit = isLimit;
+exports.product = product;
+exports.coproduct = coproduct;
+exports.equalizer = equalizer;
+exports.coequalizer = coequalizer;
+const fin_set_1 = require("./fin-set");
+/**
+ * Verifica que `cone` sea un cono sobre `diagram` en `cat`:
+ * para cada arista `e: i→j` del diagrama, `e ∘ leg(i) = leg(j)`.
+ */
+function isCone(cat, diagram, cone) {
+    for (const v of diagram.vertices.keys()) {
+        if (!cone.legs.has(v))
+            return false;
+    }
+    for (const { from, to, mor } of diagram.edges) {
+        const legFrom = cone.legs.get(from);
+        const legTo = cone.legs.get(to);
+        if (!legFrom || !legTo)
+            return false;
+        const composed = cat.compose(mor, legFrom);
+        if (!cat.eqMor(composed, legTo))
+            return false;
+    }
+    return true;
+}
+/**
+ * Comprueba si `cone` es límite del diagrama: para cada otro cono
+ * candidato sobre el diagrama, existe un único morfismo `u : apex' → apex`
+ * que conmuta con las patas. La búsqueda es por enumeración sobre
+ * los morfismos registrados en `cat`; sirve bien para categorías finitas
+ * pequeñas (FinSet con objetos chicos).
+ */
+function isLimit(cat, diagram, cone) {
+    if (!isCone(cat, diagram, cone))
+        return false;
+    // Enumerar otros conos candidatos: para cada objeto X en cat,
+    // todos los tuples de morfismos X→vertices que respeten edges.
+    for (const X of cat.objects) {
+        const candidates = enumerateCones(cat, diagram, X);
+        for (const cand of candidates) {
+            // Buscar u : X → apex tal que ∀ v: leg(v) ∘ u = cand.legs(v)
+            const candidatesU = cat.hom(X, cone.apex);
+            let found = 0;
+            for (const u of candidatesU) {
+                let ok = true;
+                for (const [v, leg] of cone.legs) {
+                    const composed = cat.compose(leg, u);
+                    const expected = cand.legs.get(v);
+                    if (!cat.eqMor(composed, expected)) {
+                        ok = false;
+                        break;
+                    }
+                }
+                if (ok)
+                    found++;
+                if (found > 1)
+                    return false; // no único
+            }
+            if (found !== 1)
+                return false;
+        }
+    }
+    return true;
+}
+function enumerateCones(cat, diagram, apex) {
+    const vNames = Array.from(diagram.vertices.keys());
+    // Para cada vértice, lista de posibles legs apex→vertice.
+    const optionsPerVertex = vNames.map((v) => {
+        const obj = diagram.vertices.get(v);
+        return cat.hom(apex, obj).map((leg) => ({ vName: v, leg }));
+    });
+    // Producto cartesiano. Para diagramas pequeños es manejable.
+    let combos = [new Map()];
+    for (const opts of optionsPerVertex) {
+        const next = [];
+        for (const partial of combos) {
+            for (const o of opts) {
+                const nm = new Map(partial);
+                nm.set(o.vName, o.leg);
+                next.push(nm);
+            }
+        }
+        combos = next;
+    }
+    const out = [];
+    for (const legs of combos) {
+        const cand = { apex, legs };
+        if (isCone(cat, diagram, cand))
+            out.push(cand);
+    }
+    return out;
+}
+// ── Construcciones concretas en FinSet ───────────────────────
+/**
+ * Producto binario en FinSet: A×B con proyecciones π1, π2.
+ * Construye el objeto producto como un nuevo `FinSetObj` con
+ * elementos `(a,b)` codificados como `"a∥b"` y lo registra en `cat`.
+ *
+ * Devuelve `null` si los objetos no pertenecen a la categoría.
+ *
+ * Nota: la categoría `cat` debe poder admitir nuevos objetos. Para
+ * nuestro uso pedimos que sea una `FinSet`-categoría construida con
+ * los carriers explícitos. En lugar de mutar `cat`, esta función
+ * regresa el producto + las proyecciones y deja al cliente
+ * reconstruir una categoría extendida si lo necesita.
+ */
+function product(cat, a, b) {
+    if (!cat.objects.has(a) || !cat.objects.has(b))
+        return null;
+    const sep = '∥';
+    const elements = [];
+    const pi1Table = {};
+    const pi2Table = {};
+    for (const x of a.elements) {
+        for (const y of b.elements) {
+            const tag = `${x}${sep}${y}`;
+            elements.push(tag);
+            pi1Table[tag] = x;
+            pi2Table[tag] = y;
+        }
+    }
+    const prod = { name: `${a.name}×${b.name}`, elements };
+    const extendedObjs = [...cat.objects, prod];
+    // Construimos categoría extendida con los morfismos previos como
+    // generadores + π1, π2.
+    const oldGens = Array.from(cat.morphisms.values()).filter((m) => !m.id.endsWith(':id'));
+    const pi1 = (0, fin_set_1.mkFinSetMor)('π1', prod, a, pi1Table);
+    const pi2 = (0, fin_set_1.mkFinSetMor)('π2', prod, b, pi2Table);
+    const newCat = (0, fin_set_1.FinSet)(extendedObjs, [...oldGens, pi1, pi2]);
+    return { obj: prod, pi1, pi2, cat: newCat };
+}
+/**
+ * Coproducto binario en FinSet: unión disjunta A⊔B. Usa prefijos
+ * `L:` y `R:` para tag-ear los elementos y produce las inyecciones
+ * canónicas in1, in2.
+ */
+function coproduct(cat, a, b) {
+    if (!cat.objects.has(a) || !cat.objects.has(b))
+        return null;
+    const elements = [];
+    const in1Table = {};
+    const in2Table = {};
+    for (const x of a.elements) {
+        const tag = `L:${x}`;
+        elements.push(tag);
+        in1Table[x] = tag;
+    }
+    for (const y of b.elements) {
+        const tag = `R:${y}`;
+        elements.push(tag);
+        in2Table[y] = tag;
+    }
+    const cop = { name: `${a.name}⊔${b.name}`, elements };
+    const extendedObjs = [...cat.objects, cop];
+    const oldGens = Array.from(cat.morphisms.values()).filter((m) => !m.id.endsWith(':id'));
+    const in1 = (0, fin_set_1.mkFinSetMor)('in1', a, cop, in1Table);
+    const in2 = (0, fin_set_1.mkFinSetMor)('in2', b, cop, in2Table);
+    const newCat = (0, fin_set_1.FinSet)(extendedObjs, [...oldGens, in1, in2]);
+    return { obj: cop, in1, in2, cat: newCat };
+}
+/**
+ * Igualador en FinSet de un par paralelo `f, g : A → B`. El igualador
+ * es el subconjunto `E = { x ∈ A | f(x) = g(x) }` con inclusión `eq : E ↪ A`.
+ */
+function equalizer(cat, f, g) {
+    if (f.src !== g.src || f.tgt !== g.tgt)
+        return null;
+    const aObj = Array.from(cat.objects).find((o) => o.name === f.src);
+    if (!aObj)
+        return null;
+    const elements = [];
+    const eqTable = {};
+    for (const x of aObj.elements) {
+        if (f.fn.get(x) === g.fn.get(x)) {
+            elements.push(x);
+            eqTable[x] = x;
+        }
+    }
+    const eObj = { name: `Eq(${f.id},${g.id})`, elements };
+    const extendedObjs = [...cat.objects, eObj];
+    const oldGens = Array.from(cat.morphisms.values()).filter((m) => !m.id.endsWith(':id'));
+    const eq = (0, fin_set_1.mkFinSetMor)('eq', eObj, aObj, eqTable);
+    const newCat = (0, fin_set_1.FinSet)(extendedObjs, [...oldGens, eq]);
+    return { obj: eObj, eq, cat: newCat };
+}
+/**
+ * Coigualador (colimite dual): cociente A/~ donde x ~ y si existe
+ * z ∈ S con f(z)=x ∧ g(z)=y (cierre transitivo-simétrico).
+ */
+function coequalizer(cat, f, g) {
+    if (f.src !== g.src || f.tgt !== g.tgt)
+        return null;
+    const aObj = Array.from(cat.objects).find((o) => o.name === f.src);
+    const bObj = Array.from(cat.objects).find((o) => o.name === f.tgt);
+    if (!aObj || !bObj)
+        return null;
+    // Union-find sobre elementos de B
+    const parent = new Map();
+    for (const y of bObj.elements)
+        parent.set(y, y);
+    function find(x) {
+        let p = parent.get(x);
+        while (p !== parent.get(p))
+            p = parent.get(p);
+        parent.set(x, p);
+        return p;
+    }
+    function union(x, y) {
+        const px = find(x);
+        const py = find(y);
+        if (px !== py)
+            parent.set(px, py);
+    }
+    for (const z of aObj.elements) {
+        union(f.fn.get(z), g.fn.get(z));
+    }
+    // Clases canónicas
+    const reps = new Set();
+    for (const y of bObj.elements)
+        reps.add(find(y));
+    const elements = Array.from(reps).sort();
+    const qTable = {};
+    for (const y of bObj.elements)
+        qTable[y] = find(y);
+    const cObj = { name: `Coeq(${f.id},${g.id})`, elements };
+    const extendedObjs = [...cat.objects, cObj];
+    const oldGens = Array.from(cat.morphisms.values()).filter((m) => !m.id.endsWith(':id'));
+    const q = (0, fin_set_1.mkFinSetMor)('q', bObj, cObj, qTable);
+    const newCat = (0, fin_set_1.FinSet)(extendedObjs, [...oldGens, q]);
+    return { obj: cObj, q, cat: newCat };
+}
+//# sourceMappingURL=limits.js.map

package/dist/categorical/limits.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"limits.js","sourceRoot":"","sources":["../../src/categorical/limits.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,uCAAuC;AACvC,+DAA+D;AAC/D,yDAAyD;AACzD,8CAA8C;AAC9C,gDAAgD;AAChD,sDAAsD;AACtD,EAAE;AACF,iEAAiE;AACjE,2DAA2D;AAC3D,oDAAoD;AACpD,+DAA+D;;AAS/D,wBAgBC;AASD,0BA+BC;AA6CD,0BA2BC;AAOD,8BA0BC;AAMD,8BAsBC;AAMD,kCAsCC;AA/OD,uCAAgF;AAEhF;;;GAGG;AACH,SAAgB,MAAM,CACpB,GAAmB,EACnB,OAAsB,EACtB,IAAgB;IAEhB,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC;QACxC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;IACtC,CAAC;IACD,KAAK,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;QAC9C,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACpC,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAChC,IAAI,CAAC,OAAO,IAAI,CAAC,KAAK;YAAE,OAAO,KAAK,CAAC;QACrC,MAAM,QAAQ,GAAG,GAAG,CAAC,OAAO,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;QAC3C,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;IAChD,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,OAAO,CACrB,GAAmB,EACnB,OAAsB,EACtB,IAAgB;IAEhB,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,OAAO,EAAE,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC;IAC9C,8DAA8D;IAC9D,+DAA+D;IAC/D,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC;QAC5B,MAAM,UAAU,GAAG,cAAc,CAAC,GAAG,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC;QACnD,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;YAC9B,6DAA6D;YAC7D,MAAM,WAAW,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;YAC1C,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;gBAC5B,IAAI,EAAE,GAAG,IAAI,CAAC;gBACd,KAAK,MAAM,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;oBACjC,MAAM,QAAQ,GAAG,GAAG,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;oBACrC,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC;oBACnC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,CAAC;wBACnC,EAAE,GAAG,KAAK,CAAC;wBACX,MAAM;oBACR,CAAC;gBACH,CAAC;gBACD,IAAI,EAAE;oBAAE,KAAK,EAAE,CAAC;gBAChB,IAAI,KAAK,GAAG,CAAC;oBAAE,OAAO,KAAK,CAAC,CAAC,WAAW;YAC1C,CAAC;YACD,IAAI,KAAK,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;QAChC,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,cAAc,CAAO,GAAmB,EAAE,OAAsB,EAAE,IAAO;IAChF,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC;IACnD,0DAA0D;IAC1D,MAAM,gBAAgB,GAA4C,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QACjF,MAAM,GAAG,GAAG,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC;QACrC,OAAO,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;IAC9D,CAAC,CAAC,CAAC;IACH,6DAA6D;IAC7D,IAAI,MAAM,GAA0B,CAAC,IAAI,GAAG,EAAa,CAAC,CAAC;IAC3D,KAAK,MAAM,IAAI,IAAI,gBAAgB,EAAE,CAAC;QACpC,MAAM,IAAI,GAA0B,EAAE,CAAC;QACvC,KAAK,MAAM,OAAO,IAAI,MAAM,EAAE,CAAC;YAC7B,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;gBACrB,MAAM,EAAE,GAAG,IAAI,GAAG,CAAY,OAAO,CAAC,CAAC;gBACvC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;gBACvB,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAChB,CAAC;QACH,CAAC;QACD,MAAM,GAAG,IAAI,CAAC;IAChB,CAAC;IACD,MAAM,GAAG,GAAiB,EAAE,CAAC;IAC7B,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;QAC1B,MAAM,IAAI,GAAe,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;QACxC,IAAI,MAAM,CAAC,GAAG,EAAE,OAAO,EAAE,IAAI,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjD,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,gEAAgE;AAEhE;;;;;;;;;;;;GAYG;AACH,SAAgB,OAAO,CACrB,GAAmC,EACnC,CAAY,EACZ,CAAY;IAEZ,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IAC5D,MAAM,GAAG,GAAG,GAAG,CAAC;IAChB,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,MAAM,QAAQ,GAA2B,EAAE,CAAC;IAC5C,MAAM,QAAQ,GAA2B,EAAE,CAAC;IAC5C,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;QAC3B,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;YAC3B,MAAM,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,CAAC;YAC7B,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACnB,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAClB,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IACD,MAAM,IAAI,GAAc,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,QAAQ,EAAE,CAAC;IAClE,MAAM,YAAY,GAAG,CAAC,GAAG,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;IAC5C,iEAAiE;IACjE,wBAAwB;IACxB,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;IACxF,MAAM,GAAG,GAAG,IAAA,qBAAW,EAAC,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;IACjD,MAAM,GAAG,GAAG,IAAA,qBAAW,EAAC,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;IACjD,MAAM,MAAM,GAAG,IAAA,gBAAM,EAAC,YAAY,EAAE,CAAC,GAAG,OAAO,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IAC5D,OAAO,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC;AAC9C,CAAC;AAED;;;;GAIG;AACH,SAAgB,SAAS,CACvB,GAAmC,EACnC,CAAY,EACZ,CAAY;IAEZ,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IAC5D,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,MAAM,QAAQ,GAA2B,EAAE,CAAC;IAC5C,MAAM,QAAQ,GAA2B,EAAE,CAAC;IAC5C,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAG,KAAK,CAAC,EAAE,CAAC;QACrB,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACnB,QAAQ,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;IACpB,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAG,KAAK,CAAC,EAAE,CAAC;QACrB,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACnB,QAAQ,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;IACpB,CAAC;IACD,MAAM,GAAG,GAAc,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,QAAQ,EAAE,CAAC;IACjE,MAAM,YAAY,GAAG,CAAC,GAAG,GAAG,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;IAC3C,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;IACxF,MAAM,GAAG,GAAG,IAAA,qBAAW,EAAC,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;IACjD,MAAM,GAAG,GAAG,IAAA,qBAAW,EAAC,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;IACjD,MAAM,MAAM,GAAG,IAAA,gBAAM,EAAC,YAAY,EAAE,CAAC,GAAG,OAAO,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IAC5D,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC;AAC7C,CAAC;AAED;;;GAGG;AACH,SAAgB,SAAS,CACvB,GAAmC,EACnC,CAAY,EACZ,CAAY;IAEZ,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG;QAAE,OAAO,IAAI,CAAC;IACpD,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;IACnE,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,CAAC;IACvB,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,MAAM,OAAO,GAA2B,EAAE,CAAC;IAC3C,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;QAC9B,IAAI,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAChC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjB,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACjB,CAAC;IACH,CAAC;IACD,MAAM,IAAI,GAAc,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,GAAG,EAAE,QAAQ,EAAE,CAAC;IAClE,MAAM,YAAY,GAAG,CAAC,GAAG,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;IAC5C,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;IACxF,MAAM,EAAE,GAAG,IAAA,qBAAW,EAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;IAClD,MAAM,MAAM,GAAG,IAAA,gBAAM,EAAC,YAAY,EAAE,CAAC,GAAG,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC;IACtD,OAAO,EAAE,GAAG,EAAE,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC;AACxC,CAAC;AAED;;;GAGG;AACH,SAAgB,WAAW,CACzB,GAAmC,EACnC,CAAY,EACZ,CAAY;IAEZ,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG;QAAE,OAAO,IAAI,CAAC;IACpD,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;IACnE,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;IACnE,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,CAAC;IAChC,kCAAkC;IAClC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ;QAAE,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAChD,SAAS,IAAI,CAAC,CAAS;QACrB,IAAI,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC;QACvB,OAAO,CAAC,KAAK,MAAM,CAAC,GAAG,CAAC,CAAC,CAAE;YAAE,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC;QAChD,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACjB,OAAO,CAAC,CAAC;IACX,CAAC;IACD,SAAS,KAAK,CAAC,CAAS,EAAE,CAAS;QACjC,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,EAAE,KAAK,EAAE;YAAE,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACpC,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;QAC9B,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAE,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC;IACpC,CAAC;IACD,mBAAmB;IACnB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ;QAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACjD,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;IACzC,MAAM,MAAM,GAA2B,EAAE,CAAC;IAC1C,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ;QAAE,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IACnD,MAAM,IAAI,GAAc,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,GAAG,EAAE,QAAQ,EAAE,CAAC;IACpE,MAAM,YAAY,GAAG,CAAC,GAAG,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;IAC5C,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;IACxF,MAAM,CAAC,GAAG,IAAA,qBAAW,EAAC,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;IAC/C,MAAM,MAAM,GAAG,IAAA,gBAAM,EAAC,YAAY,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC;IACrD,OAAO,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC;AACvC,CAAC"}

package/dist/categorical/monoidal.d.ts

@@ -0,0 +1,14 @@
+import type { MonoidalCategory } from './types';
+import { type FinSetMor, type FinSetObj } from './fin-set';
+/**
+ * Construye la categoría monoidal (FinSet, ×, 1). Recibe la lista
+ * de objetos generadores; añade automáticamente la unidad 1.
+ *
+ * Esta versión es estricta hasta isomorfismo canónico: los unitores
+ * y asociador se comprueban por igualdad estructural de los
+ * elementos serializados (`x` vs `*∥x` vs `x∥*`), siguiendo la
+ * convención `mkProductObj`. En lugar de verificar conmutatividad
+ * de diagramas complejos, comparamos los carriers normalizados.
+ */
+export declare function FinSetMonoidal(objs: ReadonlyArray<FinSetObj>, generators?: ReadonlyArray<FinSetMor>): MonoidalCategory<FinSetObj, FinSetMor>;
+//# sourceMappingURL=monoidal.d.ts.map

package/dist/categorical/monoidal.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"monoidal.d.ts","sourceRoot":"","sources":["../../src/categorical/monoidal.ts"],"names":[],"mappings":"AAUA,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,SAAS,CAAC;AAChD,OAAO,EAAuB,KAAK,SAAS,EAAE,KAAK,SAAS,EAAE,MAAM,WAAW,CAAC;AAEhF;;;;;;;;;GASG;AACH,wBAAgB,cAAc,CAC5B,IAAI,EAAE,aAAa,CAAC,SAAS,CAAC,EAC9B,UAAU,GAAE,aAAa,CAAC,SAAS,CAAM,GACxC,gBAAgB,CAAC,SAAS,EAAE,SAAS,CAAC,CA+HxC"}