Datenvertragswerk
finite category grothendieck construction
From a completely supplied strict covariant diagram of finite categories, construct its whole Grothendieck total category. Keep original base and fiber labels. Objects are pairs(b,x); arrows(f,phi) have phi:F(f)x to y. Composition transports the first fiber morphism along the second base functor before composing inside the target fiber. Return every object and arrow, the entire identity/composition table, explicit projection and canonical opcartesian lifts(f,id). Nonidentity internal fiber.
POST https://datenvertrag.halowerk.com/v1/finite-category-grothendieck-constructionInputs
| Field | Type | Required | Description |
|---|---|---|---|
| base | See schema | Yes | |
| fibers | See schema | Yes | |
| functors | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"base": {
"anyOf": [
{
"type": "object",
"properties": {
"objects": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"source": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 1
},
"minItems": 0,
"maxItems": 3
},
"target": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 1
},
"minItems": 0,
"maxItems": 3
},
"identities": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 0,
"maxItems": 2
},
"composition": {
"type": "array",
"items": {
"type": "array",
"items": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 2
},
{
"type": "null"
}
]
},
"minItems": 0,
"maxItems": 3
},
"minItems": 0,
"maxItems": 3
}
},
"required": [
"objects",
"source",
"target",
"identities",
"composition"
],
"additionalProperties": false
},
{
"type": "null"
}
]
},
"fibers": {
"anyOf": [
{
"type": "array",
"items": {
"type": "object",
"properties": {
"objects": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"source": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 1
},
"minItems": 0,
"maxItems": 3
},
"target": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 1
},
"minItems": 0,
"maxItems": 3
},
"identities": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 0,
"maxItems": 2
},
"composition": {
"type": "array",
"items": {
"type": "array",
"items": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 2
},
{
"type": "null"
}
]
},
"minItems": 0,
"maxItems": 3
},
"minItems": 0,
"maxItems": 3
}
},
"required": [
"objects",
"source",
"target",
"identities",
"composition"
],
"additionalProperties": false
},
"minItems": 0,
"maxItems": 2
},
{
"type": "null"
}
]
},
"functors": {
"anyOf": [
{
"type": "array",
"items": {
"type": "object",
"properties": {
"on_objects": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 1
},
"minItems": 0,
"maxItems": 2
},
"on_arrows": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 0,
"maxItems": 3
}
},
"required": [
"on_objects",
"on_arrows"
],
"additionalProperties": false
},
"minItems": 0,
"maxItems": 3
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"objects": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 1
},
"minItems": 2,
"maxItems": 2
},
"minItems": 0,
"maxItems": 4
},
"arrows": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 17
},
"minItems": 4,
"maxItems": 4
},
"minItems": 0,
"maxItems": 18
},
"identities": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 17
},
"minItems": 0,
"maxItems": 4
},
"composition": {
"type": "array",
"items": {
"type": "array",
"items": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 17
},
{
"type": "null"
}
]
},
"minItems": 0,
"maxItems": 18
},
"minItems": 0,
"maxItems": 18
},
"projection_objects": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 1
},
"minItems": 0,
"maxItems": 4
},
"projection_arrows": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 0,
"maxItems": 18
},
"opcartesian_lifts": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 17
},
"minItems": 3,
"maxItems": 3
},
"minItems": 0,
"maxItems": 6
}
},
"required": [
"objects",
"arrows",
"identities",
"composition",
"projection_objects",
"projection_arrows",
"opcartesian_lifts"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"base",
"fibers",
"functors",
"claim"
],
"additionalProperties": false
}Published input example
{
"base": {
"objects": 1,
"source": [
0
],
"target": [
0
],
"identities": [
0
],
"composition": [
[
0
]
]
},
"fibers": [
{
"objects": 1,
"source": [
0,
0
],
"target": [
0,
0
],
"identities": [
0
],
"composition": [
[
0,
1
],
[
1,
0
]
]
}
],
"functors": [
{
"on_objects": [
0
],
"on_arrows": [
0,
1
]
}
],
"claim": null
}Result & documentation
Machine-readable documentation of this hub
Source of this page: the published HALOWERK catalog. Updated: 2026-11-17 UTC.
More endpoints in this hub
- Datenvertragswerk0.003 USDC
acyclic automata probabilistic refinement witness
POSThttps://datenvertrag.halowerk.com/v1/acyclic-automata-probabilistic-refinement-witnessFor two finite action-labelled nondeterministic probabilistic automata return the WHOLE greatest DIRECTED STRONG SIMULATION relation, canonical single-transition matching couplings and exhaustive local negative Hall obstructions. Each of 1.
- Datenvertragswerk0.003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n in 1..5 and a monic degree-n integer polynomial det(xI-A), returns every labelled simple undirected graph on vertices 0..n-1 with exactly that adjacency characteristic polynomial. Coefficients are in descending degree order, n+1 ent
- Datenvertragswerk0.003 USDC
adjacent swap permutation tour
POSThttps://datenvertrag.halowerk.com/v1/adjacent-swap-permutation-tourFor 0 to 5 labels starting at zero, construct the whole Steinhaus-Johnson-Trotter permutation tour from identity. Each transition swaps the largest mobile value with its adjacent smaller neighbor, then reverses directions of greater values.