‣ AddBiasedWeakFiberProduct( C, F ) | ( operation ) |
‣ AddBiasedWeakFiberProduct( C, F, weight ) | ( operation ) |
Returns: nothing
The arguments are a category \(C\) and a function \(F\). This operation adds the given function \(F\) to the category for the basic operation BiasedWeakFiberProduct. Optionally, a weight (default: 100) can be specified which should roughly correspond to the computational complexity of the function (lower weight = less complex = faster execution). \(F: ( arg2, arg3 ) \mapsto \mathtt{BiasedWeakFiberProduct}(arg2, arg3)\).
‣ AddBiasedWeakPushout( C, F ) | ( operation ) |
‣ AddBiasedWeakPushout( C, F, weight ) | ( operation ) |
Returns: nothing
The arguments are a category \(C\) and a function \(F\). This operation adds the given function \(F\) to the category for the basic operation BiasedWeakPushout. Optionally, a weight (default: 100) can be specified which should roughly correspond to the computational complexity of the function (lower weight = less complex = faster execution). \(F: ( arg2, arg3 ) \mapsto \mathtt{BiasedWeakPushout}(arg2, arg3)\).
‣ AddDirectSumMorphismToWeakBiPushout( C, F ) | ( operation ) |
‣ AddDirectSumMorphismToWeakBiPushout( C, F, weight ) | ( operation ) |
Returns: nothing
The arguments are a category \(C\) and a function \(F\). This operation adds the given function \(F\) to the category for the basic operation DirectSumMorphismToWeakBiPushout. Optionally, a weight (default: 100) can be specified which should roughly correspond to the computational complexity of the function (lower weight = less complex = faster execution). \(F: ( alpha, beta ) \mapsto \mathtt{DirectSumMorphismToWeakBiPushout}(alpha, beta)\).
‣ AddEpimorphismFromSomeProjectiveObjectForKernelObject( C, F ) | ( operation ) |
‣ AddEpimorphismFromSomeProjectiveObjectForKernelObject( C, F, weight ) | ( operation ) |
Returns: nothing
The arguments are a category \(C\) and a function \(F\). This operation adds the given function \(F\) to the category for the basic operation EpimorphismFromSomeProjectiveObjectForKernelObject. Optionally, a weight (default: 100) can be specified which should roughly correspond to the computational complexity of the function (lower weight = less complex = faster execution). \(F: ( alpha ) \mapsto \mathtt{EpimorphismFromSomeProjectiveObjectForKernelObject}(alpha)\).
‣ AddEpimorphismFromSomeProjectiveObjectForKernelObjectWithGivenSomeProjectiveObjectForKernelObject( C, F ) | ( operation ) |
‣ AddEpimorphismFromSomeProjectiveObjectForKernelObjectWithGivenSomeProjectiveObjectForKernelObject( C, F, weight ) | ( operation ) |
Returns: nothing
The arguments are a category \(C\) and a function \(F\). This operation adds the given function \(F\) to the category for the basic operation EpimorphismFromSomeProjectiveObjectForKernelObjectWithGivenSomeProjectiveObjectForKernelObject. Optionally, a weight (default: 100) can be specified which should roughly correspond to the computational complexity of the function (lower weight = less complex = faster execution). \(F: ( alpha, source ) \mapsto \mathtt{EpimorphismFromSomeProjectiveObjectForKernelObjectWithGivenSomeProjectiveObjectForKernelObject}(alpha, source)\).
‣ AddInjectionOfBiasedWeakPushout( C, F ) | ( operation ) |
‣ AddInjectionOfBiasedWeakPushout( C, F, weight ) | ( operation ) |
Returns: nothing
The arguments are a category \(C\) and a function \(F\). This operation adds the given function \(F\) to the category for the basic operation InjectionOfBiasedWeakPushout. Optionally, a weight (default: 100) can be specified which should roughly correspond to the computational complexity of the function (lower weight = less complex = faster execution). \(F: ( a, b ) \mapsto \mathtt{InjectionOfBiasedWeakPushout}(a, b)\).
‣ AddInjectionOfBiasedWeakPushoutWithGivenBiasedWeakPushout( C, F ) | ( operation ) |
‣ AddInjectionOfBiasedWeakPushoutWithGivenBiasedWeakPushout( C, F, weight ) | ( operation ) |
Returns: nothing
The arguments are a category \(C\) and a function \(F\). This operation adds the given function \(F\) to the category for the basic operation InjectionOfBiasedWeakPushoutWithGivenBiasedWeakPushout. Optionally, a weight (default: 100) can be specified which should roughly correspond to the computational complexity of the function (lower weight = less complex = faster execution). \(F: ( a, b, P ) \mapsto \mathtt{InjectionOfBiasedWeakPushoutWithGivenBiasedWeakPushout}(a, b, P)\).
‣ AddInjectionOfFirstCofactorOfWeakBiPushout( C, F ) | ( operation ) |
‣ AddInjectionOfFirstCofactorOfWeakBiPushout( C, F, weight ) | ( operation ) |
Returns: nothing
The arguments are a category \(C\) and a function \(F\). This operation adds the given function \(F\) to the category for the basic operation InjectionOfFirstCofactorOfWeakBiPushout. Optionally, a weight (default: 100) can be specified which should roughly correspond to the computational complexity of the function (lower weight = less complex = faster execution). \(F: ( a, b ) \mapsto \mathtt{InjectionOfFirstCofactorOfWeakBiPushout}(a, b)\).
‣ AddInjectionOfFirstCofactorOfWeakBiPushoutWithGivenWeakBiPushout( C, F ) | ( operation ) |
‣ AddInjectionOfFirstCofactorOfWeakBiPushoutWithGivenWeakBiPushout( C, F, weight ) | ( operation ) |
Returns: nothing
The arguments are a category \(C\) and a function \(F\). This operation adds the given function \(F\) to the category for the basic operation InjectionOfFirstCofactorOfWeakBiPushoutWithGivenWeakBiPushout. Optionally, a weight (default: 100) can be specified which should roughly correspond to the computational complexity of the function (lower weight = less complex = faster execution). \(F: ( a, b, P ) \mapsto \mathtt{InjectionOfFirstCofactorOfWeakBiPushoutWithGivenWeakBiPushout}(a, b, P)\).
‣ AddInjectionOfSecondCofactorOfWeakBiPushout( C, F ) | ( operation ) |
‣ AddInjectionOfSecondCofactorOfWeakBiPushout( C, F, weight ) | ( operation ) |
Returns: nothing
The arguments are a category \(C\) and a function \(F\). This operation adds the given function \(F\) to the category for the basic operation InjectionOfSecondCofactorOfWeakBiPushout. Optionally, a weight (default: 100) can be specified which should roughly correspond to the computational complexity of the function (lower weight = less complex = faster execution). \(F: ( a, b ) \mapsto \mathtt{InjectionOfSecondCofactorOfWeakBiPushout}(a, b)\).
‣ AddInjectionOfSecondCofactorOfWeakBiPushoutWithGivenWeakBiPushout( C, F ) | ( operation ) |
‣ AddInjectionOfSecondCofactorOfWeakBiPushoutWithGivenWeakBiPushout( C, F, weight ) | ( operation ) |
Returns: nothing
The arguments are a category \(C\) and a function \(F\). This operation adds the given function \(F\) to the category for the basic operation InjectionOfSecondCofactorOfWeakBiPushoutWithGivenWeakBiPushout. Optionally, a weight (default: 100) can be specified which should roughly correspond to the computational complexity of the function (lower weight = less complex = faster execution). \(F: ( a, b, P ) \mapsto \mathtt{InjectionOfSecondCofactorOfWeakBiPushoutWithGivenWeakBiPushout}(a, b, P)\).
‣ AddMonomorphismToSomeInjectiveObjectForCokernelObject( C, F ) | ( operation ) |
‣ AddMonomorphismToSomeInjectiveObjectForCokernelObject( C, F, weight ) | ( operation ) |
Returns: nothing
The arguments are a category \(C\) and a function \(F\). This operation adds the given function \(F\) to the category for the basic operation MonomorphismToSomeInjectiveObjectForCokernelObject. Optionally, a weight (default: 100) can be specified which should roughly correspond to the computational complexity of the function (lower weight = less complex = faster execution). \(F: ( alpha ) \mapsto \mathtt{MonomorphismToSomeInjectiveObjectForCokernelObject}(alpha)\).
‣ AddMonomorphismToSomeInjectiveObjectForCokernelObjectWithGivenSomeInjectiveObjectForCokernelObject( C, F ) | ( operation ) |
‣ AddMonomorphismToSomeInjectiveObjectForCokernelObjectWithGivenSomeInjectiveObjectForCokernelObject( C, F, weight ) | ( operation ) |
Returns: nothing
The arguments are a category \(C\) and a function \(F\). This operation adds the given function \(F\) to the category for the basic operation MonomorphismToSomeInjectiveObjectForCokernelObjectWithGivenSomeInjectiveObjectForCokernelObject. Optionally, a weight (default: 100) can be specified which should roughly correspond to the computational complexity of the function (lower weight = less complex = faster execution). \(F: ( alpha, range ) \mapsto \mathtt{MonomorphismToSomeInjectiveObjectForCokernelObjectWithGivenSomeInjectiveObjectForCokernelObject}(alpha, range)\).
‣ AddProjectionInFirstFactorOfWeakBiFiberProduct( C, F ) | ( operation ) |
‣ AddProjectionInFirstFactorOfWeakBiFiberProduct( C, F, weight ) | ( operation ) |
Returns: nothing
The arguments are a category \(C\) and a function \(F\). This operation adds the given function \(F\) to the category for the basic operation ProjectionInFirstFactorOfWeakBiFiberProduct. Optionally, a weight (default: 100) can be specified which should roughly correspond to the computational complexity of the function (lower weight = less complex = faster execution). \(F: ( a, b ) \mapsto \mathtt{ProjectionInFirstFactorOfWeakBiFiberProduct}(a, b)\).
‣ AddProjectionInFirstFactorOfWeakBiFiberProductWithGivenWeakBiFiberProduct( C, F ) | ( operation ) |
‣ AddProjectionInFirstFactorOfWeakBiFiberProductWithGivenWeakBiFiberProduct( C, F, weight ) | ( operation ) |
Returns: nothing
The arguments are a category \(C\) and a function \(F\). This operation adds the given function \(F\) to the category for the basic operation ProjectionInFirstFactorOfWeakBiFiberProductWithGivenWeakBiFiberProduct. Optionally, a weight (default: 100) can be specified which should roughly correspond to the computational complexity of the function (lower weight = less complex = faster execution). \(F: ( a, b, P ) \mapsto \mathtt{ProjectionInFirstFactorOfWeakBiFiberProductWithGivenWeakBiFiberProduct}(a, b, P)\).
‣ AddProjectionInSecondFactorOfWeakBiFiberProduct( C, F ) | ( operation ) |
‣ AddProjectionInSecondFactorOfWeakBiFiberProduct( C, F, weight ) | ( operation ) |
Returns: nothing
The arguments are a category \(C\) and a function \(F\). This operation adds the given function \(F\) to the category for the basic operation ProjectionInSecondFactorOfWeakBiFiberProduct. Optionally, a weight (default: 100) can be specified which should roughly correspond to the computational complexity of the function (lower weight = less complex = faster execution). \(F: ( a, b ) \mapsto \mathtt{ProjectionInSecondFactorOfWeakBiFiberProduct}(a, b)\).
‣ AddProjectionInSecondFactorOfWeakBiFiberProductWithGivenWeakBiFiberProduct( C, F ) | ( operation ) |
‣ AddProjectionInSecondFactorOfWeakBiFiberProductWithGivenWeakBiFiberProduct( C, F, weight ) | ( operation ) |
Returns: nothing
The arguments are a category \(C\) and a function \(F\). This operation adds the given function \(F\) to the category for the basic operation ProjectionInSecondFactorOfWeakBiFiberProductWithGivenWeakBiFiberProduct. Optionally, a weight (default: 100) can be specified which should roughly correspond to the computational complexity of the function (lower weight = less complex = faster execution). \(F: ( a, b, P ) \mapsto \mathtt{ProjectionInSecondFactorOfWeakBiFiberProductWithGivenWeakBiFiberProduct}(a, b, P)\).
‣ AddProjectionOfBiasedWeakFiberProduct( C, F ) | ( operation ) |
‣ AddProjectionOfBiasedWeakFiberProduct( C, F, weight ) | ( operation ) |
Returns: nothing
The arguments are a category \(C\) and a function \(F\). This operation adds the given function \(F\) to the category for the basic operation ProjectionOfBiasedWeakFiberProduct. Optionally, a weight (default: 100) can be specified which should roughly correspond to the computational complexity of the function (lower weight = less complex = faster execution). \(F: ( a, b ) \mapsto \mathtt{ProjectionOfBiasedWeakFiberProduct}(a, b)\).
‣ AddProjectionOfBiasedWeakFiberProductWithGivenBiasedWeakFiberProduct( C, F ) | ( operation ) |
‣ AddProjectionOfBiasedWeakFiberProductWithGivenBiasedWeakFiberProduct( C, F, weight ) | ( operation ) |
Returns: nothing
The arguments are a category \(C\) and a function \(F\). This operation adds the given function \(F\) to the category for the basic operation ProjectionOfBiasedWeakFiberProductWithGivenBiasedWeakFiberProduct. Optionally, a weight (default: 100) can be specified which should roughly correspond to the computational complexity of the function (lower weight = less complex = faster execution). \(F: ( a, b, P ) \mapsto \mathtt{ProjectionOfBiasedWeakFiberProductWithGivenBiasedWeakFiberProduct}(a, b, P)\).
‣ AddSomeInjectiveObjectForCokernelObject( C, F ) | ( operation ) |
‣ AddSomeInjectiveObjectForCokernelObject( C, F, weight ) | ( operation ) |
Returns: nothing
The arguments are a category \(C\) and a function \(F\). This operation adds the given function \(F\) to the category for the basic operation SomeInjectiveObjectForCokernelObject. Optionally, a weight (default: 100) can be specified which should roughly correspond to the computational complexity of the function (lower weight = less complex = faster execution). \(F: ( arg2 ) \mapsto \mathtt{SomeInjectiveObjectForCokernelObject}(arg2)\).
‣ AddSomeProjectiveObjectForKernelObject( C, F ) | ( operation ) |
‣ AddSomeProjectiveObjectForKernelObject( C, F, weight ) | ( operation ) |
Returns: nothing
The arguments are a category \(C\) and a function \(F\). This operation adds the given function \(F\) to the category for the basic operation SomeProjectiveObjectForKernelObject. Optionally, a weight (default: 100) can be specified which should roughly correspond to the computational complexity of the function (lower weight = less complex = faster execution). \(F: ( arg2 ) \mapsto \mathtt{SomeProjectiveObjectForKernelObject}(arg2)\).
‣ AddUniversalMorphismFromBiasedWeakPushout( C, F ) | ( operation ) |
‣ AddUniversalMorphismFromBiasedWeakPushout( C, F, weight ) | ( operation ) |
Returns: nothing
The arguments are a category \(C\) and a function \(F\). This operation adds the given function \(F\) to the category for the basic operation UniversalMorphismFromBiasedWeakPushout. Optionally, a weight (default: 100) can be specified which should roughly correspond to the computational complexity of the function (lower weight = less complex = faster execution). \(F: ( a, b, t ) \mapsto \mathtt{UniversalMorphismFromBiasedWeakPushout}(a, b, t)\).
‣ AddUniversalMorphismFromBiasedWeakPushoutWithGivenBiasedWeakPushout( C, F ) | ( operation ) |
‣ AddUniversalMorphismFromBiasedWeakPushoutWithGivenBiasedWeakPushout( C, F, weight ) | ( operation ) |
Returns: nothing
The arguments are a category \(C\) and a function \(F\). This operation adds the given function \(F\) to the category for the basic operation UniversalMorphismFromBiasedWeakPushoutWithGivenBiasedWeakPushout. Optionally, a weight (default: 100) can be specified which should roughly correspond to the computational complexity of the function (lower weight = less complex = faster execution). \(F: ( a, b, t, P ) \mapsto \mathtt{UniversalMorphismFromBiasedWeakPushoutWithGivenBiasedWeakPushout}(a, b, t, P)\).
‣ AddUniversalMorphismFromWeakBiPushout( C, F ) | ( operation ) |
‣ AddUniversalMorphismFromWeakBiPushout( C, F, weight ) | ( operation ) |
Returns: nothing
The arguments are a category \(C\) and a function \(F\). This operation adds the given function \(F\) to the category for the basic operation UniversalMorphismFromWeakBiPushout. Optionally, a weight (default: 100) can be specified which should roughly correspond to the computational complexity of the function (lower weight = less complex = faster execution). \(F: ( a, b, t, s ) \mapsto \mathtt{UniversalMorphismFromWeakBiPushout}(a, b, t, s)\).
‣ AddUniversalMorphismFromWeakBiPushoutWithGivenWeakBiPushout( C, F ) | ( operation ) |
‣ AddUniversalMorphismFromWeakBiPushoutWithGivenWeakBiPushout( C, F, weight ) | ( operation ) |
Returns: nothing
The arguments are a category \(C\) and a function \(F\). This operation adds the given function \(F\) to the category for the basic operation UniversalMorphismFromWeakBiPushoutWithGivenWeakBiPushout. Optionally, a weight (default: 100) can be specified which should roughly correspond to the computational complexity of the function (lower weight = less complex = faster execution). \(F: ( a, b, t, s, P ) \mapsto \mathtt{UniversalMorphismFromWeakBiPushoutWithGivenWeakBiPushout}(a, b, t, s, P)\).
‣ AddUniversalMorphismIntoBiasedWeakFiberProduct( C, F ) | ( operation ) |
‣ AddUniversalMorphismIntoBiasedWeakFiberProduct( C, F, weight ) | ( operation ) |
Returns: nothing
The arguments are a category \(C\) and a function \(F\). This operation adds the given function \(F\) to the category for the basic operation UniversalMorphismIntoBiasedWeakFiberProduct. Optionally, a weight (default: 100) can be specified which should roughly correspond to the computational complexity of the function (lower weight = less complex = faster execution). \(F: ( a, b, t ) \mapsto \mathtt{UniversalMorphismIntoBiasedWeakFiberProduct}(a, b, t)\).
‣ AddUniversalMorphismIntoBiasedWeakFiberProductWithGivenBiasedWeakFiberProduct( C, F ) | ( operation ) |
‣ AddUniversalMorphismIntoBiasedWeakFiberProductWithGivenBiasedWeakFiberProduct( C, F, weight ) | ( operation ) |
Returns: nothing
The arguments are a category \(C\) and a function \(F\). This operation adds the given function \(F\) to the category for the basic operation UniversalMorphismIntoBiasedWeakFiberProductWithGivenBiasedWeakFiberProduct. Optionally, a weight (default: 100) can be specified which should roughly correspond to the computational complexity of the function (lower weight = less complex = faster execution). \(F: ( a, b, t, P ) \mapsto \mathtt{UniversalMorphismIntoBiasedWeakFiberProductWithGivenBiasedWeakFiberProduct}(a, b, t, P)\).
‣ AddUniversalMorphismIntoWeakBiFiberProduct( C, F ) | ( operation ) |
‣ AddUniversalMorphismIntoWeakBiFiberProduct( C, F, weight ) | ( operation ) |
Returns: nothing
The arguments are a category \(C\) and a function \(F\). This operation adds the given function \(F\) to the category for the basic operation UniversalMorphismIntoWeakBiFiberProduct. Optionally, a weight (default: 100) can be specified which should roughly correspond to the computational complexity of the function (lower weight = less complex = faster execution). \(F: ( a, b, t, s ) \mapsto \mathtt{UniversalMorphismIntoWeakBiFiberProduct}(a, b, t, s)\).
‣ AddUniversalMorphismIntoWeakBiFiberProductWithGivenWeakBiFiberProduct( C, F ) | ( operation ) |
‣ AddUniversalMorphismIntoWeakBiFiberProductWithGivenWeakBiFiberProduct( C, F, weight ) | ( operation ) |
Returns: nothing
The arguments are a category \(C\) and a function \(F\). This operation adds the given function \(F\) to the category for the basic operation UniversalMorphismIntoWeakBiFiberProductWithGivenWeakBiFiberProduct. Optionally, a weight (default: 100) can be specified which should roughly correspond to the computational complexity of the function (lower weight = less complex = faster execution). \(F: ( a, b, t, s, P ) \mapsto \mathtt{UniversalMorphismIntoWeakBiFiberProductWithGivenWeakBiFiberProduct}(a, b, t, s, P)\).
‣ AddWeakBiFiberProduct( C, F ) | ( operation ) |
‣ AddWeakBiFiberProduct( C, F, weight ) | ( operation ) |
Returns: nothing
The arguments are a category \(C\) and a function \(F\). This operation adds the given function \(F\) to the category for the basic operation WeakBiFiberProduct. Optionally, a weight (default: 100) can be specified which should roughly correspond to the computational complexity of the function (lower weight = less complex = faster execution). \(F: ( arg2, arg3 ) \mapsto \mathtt{WeakBiFiberProduct}(arg2, arg3)\).
‣ AddWeakBiFiberProductMorphismToDirectSum( C, F ) | ( operation ) |
‣ AddWeakBiFiberProductMorphismToDirectSum( C, F, weight ) | ( operation ) |
Returns: nothing
The arguments are a category \(C\) and a function \(F\). This operation adds the given function \(F\) to the category for the basic operation WeakBiFiberProductMorphismToDirectSum. Optionally, a weight (default: 100) can be specified which should roughly correspond to the computational complexity of the function (lower weight = less complex = faster execution). \(F: ( alpha, beta ) \mapsto \mathtt{WeakBiFiberProductMorphismToDirectSum}(alpha, beta)\).
‣ AddWeakBiPushout( C, F ) | ( operation ) |
‣ AddWeakBiPushout( C, F, weight ) | ( operation ) |
Returns: nothing
The arguments are a category \(C\) and a function \(F\). This operation adds the given function \(F\) to the category for the basic operation WeakBiPushout. Optionally, a weight (default: 100) can be specified which should roughly correspond to the computational complexity of the function (lower weight = less complex = faster execution). \(F: ( arg2, arg3 ) \mapsto \mathtt{WeakBiPushout}(arg2, arg3)\).
‣ AddWeakCokernelColift( C, F ) | ( operation ) |
‣ AddWeakCokernelColift( C, F, weight ) | ( operation ) |
Returns: nothing
The arguments are a category \(C\) and a function \(F\). This operation adds the given function \(F\) to the category for the basic operation WeakCokernelColift. Optionally, a weight (default: 100) can be specified which should roughly correspond to the computational complexity of the function (lower weight = less complex = faster execution). \(F: ( alpha, tau ) \mapsto \mathtt{WeakCokernelColift}(alpha, tau)\).
‣ AddWeakCokernelColiftWithGivenWeakCokernelObject( C, F ) | ( operation ) |
‣ AddWeakCokernelColiftWithGivenWeakCokernelObject( C, F, weight ) | ( operation ) |
Returns: nothing
The arguments are a category \(C\) and a function \(F\). This operation adds the given function \(F\) to the category for the basic operation WeakCokernelColiftWithGivenWeakCokernelObject. Optionally, a weight (default: 100) can be specified which should roughly correspond to the computational complexity of the function (lower weight = less complex = faster execution). \(F: ( alpha, tau, K ) \mapsto \mathtt{WeakCokernelColiftWithGivenWeakCokernelObject}(alpha, tau, K)\).
‣ AddWeakCokernelObject( C, F ) | ( operation ) |
‣ AddWeakCokernelObject( C, F, weight ) | ( operation ) |
Returns: nothing
The arguments are a category \(C\) and a function \(F\). This operation adds the given function \(F\) to the category for the basic operation WeakCokernelObject. Optionally, a weight (default: 100) can be specified which should roughly correspond to the computational complexity of the function (lower weight = less complex = faster execution). \(F: ( arg2 ) \mapsto \mathtt{WeakCokernelObject}(arg2)\).
‣ AddWeakCokernelProjection( C, F ) | ( operation ) |
‣ AddWeakCokernelProjection( C, F, weight ) | ( operation ) |
Returns: nothing
The arguments are a category \(C\) and a function \(F\). This operation adds the given function \(F\) to the category for the basic operation WeakCokernelProjection. Optionally, a weight (default: 100) can be specified which should roughly correspond to the computational complexity of the function (lower weight = less complex = faster execution). \(F: ( alpha ) \mapsto \mathtt{WeakCokernelProjection}(alpha)\).
‣ AddWeakCokernelProjectionWithGivenWeakCokernelObject( C, F ) | ( operation ) |
‣ AddWeakCokernelProjectionWithGivenWeakCokernelObject( C, F, weight ) | ( operation ) |
Returns: nothing
The arguments are a category \(C\) and a function \(F\). This operation adds the given function \(F\) to the category for the basic operation WeakCokernelProjectionWithGivenWeakCokernelObject. Optionally, a weight (default: 100) can be specified which should roughly correspond to the computational complexity of the function (lower weight = less complex = faster execution). \(F: ( alpha, K ) \mapsto \mathtt{WeakCokernelProjectionWithGivenWeakCokernelObject}(alpha, K)\).
‣ AddWeakKernelEmbedding( C, F ) | ( operation ) |
‣ AddWeakKernelEmbedding( C, F, weight ) | ( operation ) |
Returns: nothing
The arguments are a category \(C\) and a function \(F\). This operation adds the given function \(F\) to the category for the basic operation WeakKernelEmbedding. Optionally, a weight (default: 100) can be specified which should roughly correspond to the computational complexity of the function (lower weight = less complex = faster execution). \(F: ( alpha ) \mapsto \mathtt{WeakKernelEmbedding}(alpha)\).
‣ AddWeakKernelEmbeddingWithGivenWeakKernelObject( C, F ) | ( operation ) |
‣ AddWeakKernelEmbeddingWithGivenWeakKernelObject( C, F, weight ) | ( operation ) |
Returns: nothing
The arguments are a category \(C\) and a function \(F\). This operation adds the given function \(F\) to the category for the basic operation WeakKernelEmbeddingWithGivenWeakKernelObject. Optionally, a weight (default: 100) can be specified which should roughly correspond to the computational complexity of the function (lower weight = less complex = faster execution). \(F: ( alpha, K ) \mapsto \mathtt{WeakKernelEmbeddingWithGivenWeakKernelObject}(alpha, K)\).
‣ AddWeakKernelLift( C, F ) | ( operation ) |
‣ AddWeakKernelLift( C, F, weight ) | ( operation ) |
Returns: nothing
The arguments are a category \(C\) and a function \(F\). This operation adds the given function \(F\) to the category for the basic operation WeakKernelLift. Optionally, a weight (default: 100) can be specified which should roughly correspond to the computational complexity of the function (lower weight = less complex = faster execution). \(F: ( alpha, tau ) \mapsto \mathtt{WeakKernelLift}(alpha, tau)\).
‣ AddWeakKernelLiftWithGivenWeakKernelObject( C, F ) | ( operation ) |
‣ AddWeakKernelLiftWithGivenWeakKernelObject( C, F, weight ) | ( operation ) |
Returns: nothing
The arguments are a category \(C\) and a function \(F\). This operation adds the given function \(F\) to the category for the basic operation WeakKernelLiftWithGivenWeakKernelObject. Optionally, a weight (default: 100) can be specified which should roughly correspond to the computational complexity of the function (lower weight = less complex = faster execution). \(F: ( alpha, tau, K ) \mapsto \mathtt{WeakKernelLiftWithGivenWeakKernelObject}(alpha, tau, K)\).
‣ AddWeakKernelObject( C, F ) | ( operation ) |
‣ AddWeakKernelObject( C, F, weight ) | ( operation ) |
Returns: nothing
The arguments are a category \(C\) and a function \(F\). This operation adds the given function \(F\) to the category for the basic operation WeakKernelObject. Optionally, a weight (default: 100) can be specified which should roughly correspond to the computational complexity of the function (lower weight = less complex = faster execution). \(F: ( arg2 ) \mapsto \mathtt{WeakKernelObject}(arg2)\).
generated by GAPDoc2HTML