Datenvertragswerk
set functor grothendieck category
Construct the Grothendieck category of elements of a supplied COVARIANT finite Set-valued functor F:C->Set. Base objects are0..n-1 from fiber_sizes; arrows are0..m-1 from source/target; identities[c] names id_c. composition[g][f] means g AFTER f; it must be null exactly when target[f]!=source[g]. maps[f][x] is F(f)(x). Validate all category source/target, identity and associativity laws, all finite-map domains/codomains, and functor identity/composition laws before construction. Element.
POST https://datenvertrag.halowerk.com/v1/set-functor-grothendieck-categoryInputs
| Field | Type | Required | Description |
|---|---|---|---|
| fiber_sizes | array | Yes | |
| source | array | Yes | |
| target | array | Yes | |
| identities | array | Yes | |
| composition | array | Yes | |
| maps | array | Yes |
Show full input schema
{
"type": "object",
"properties": {
"fiber_sizes": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"maxItems": 3
},
"source": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"maxItems": 6
},
"target": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"maxItems": 6
},
"identities": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 5
},
"maxItems": 3
},
"composition": {
"type": "array",
"items": {
"type": "array",
"items": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 5
},
{
"type": "null"
}
]
},
"maxItems": 6
},
"maxItems": 6
},
"maps": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"maxItems": 3
},
"maxItems": 6
}
},
"required": [
"fiber_sizes",
"source",
"target",
"identities",
"composition",
"maps"
],
"additionalProperties": false
}Published input example
{
"fiber_sizes": [
2,
1
],
"source": [
0,
1,
0
],
"target": [
0,
1,
1
],
"identities": [
0,
1
],
"composition": [
[
0,
null,
null
],
[
null,
1,
2
],
[
2,
null,
null
]
],
"maps": [
[
0,
1
],
[
0
],
[
0,
0
]
]
}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.