Skip to content
Symi Docs
Swift
On this page

Complete placement index

AssumptionProposition.and#

UniffiAssumptionProposition method

func and(other: UniffiAssumptionProposition) -> UniffiAssumptionProposition

Provides the and operation on this mobile object.

AssumptionProposition.congruence_modulus#

UniffiAssumptionProposition method

func congruenceModulus() -> UniffiExpression?

Provides the congruence_modulus operation on this mobile object.

AssumptionProposition.left_operand#

UniffiAssumptionProposition method

func leftOperand() -> UniffiExpression?

Provides the left_operand operation on this mobile object.

AssumptionProposition.membership_element#

UniffiAssumptionProposition method

func membershipElement() -> UniffiExpression?

Provides the membership_element operation on this mobile object.

AssumptionProposition.membership_set#

UniffiAssumptionProposition method

func membershipSet() -> UniffiExpression?

Provides the membership_set operation on this mobile object.

AssumptionProposition.not#

UniffiAssumptionProposition method

func not() -> UniffiAssumptionProposition

Provides the not operation on this mobile object.

AssumptionProposition.or#

UniffiAssumptionProposition method

func or(other: UniffiAssumptionProposition) -> UniffiAssumptionProposition

Provides the or operation on this mobile object.

AssumptionProposition.plain_text#

UniffiAssumptionProposition method

func plainText() -> String

The canonical plain-text form of this assumption proposition.

AssumptionProposition.relation_kind#

UniffiAssumptionProposition method

func relationKind() -> String?

Provides the relation_kind operation on this mobile object.

AssumptionProposition.right_operand#

UniffiAssumptionProposition method

func rightOperand() -> UniffiExpression?

Provides the right_operand operation on this mobile object.

AssumptionProposition.serialize#

UniffiAssumptionProposition method

func serialize() -> String

Provides the serialize operation on this mobile object.

CylindricalAlgebraicDecomposition.cell_count#

UniffiCylindricalAlgebraicDecomposition method

func cellCount() -> UInt64

The number of full-dimensional cells partitioning Rn\mathbb{R}^n.

CylindricalAlgebraicDecomposition.cell_dimension#

UniffiCylindricalAlgebraicDecomposition method

func cellDimension(index: UInt64) -> UInt64

The geometric dimension of the full cell as a subset of Rn\mathbb{R}^n (the number of sector coordinates along its cylindrical stack).

CylindricalAlgebraicDecomposition.cell_kind#

UniffiCylindricalAlgebraicDecomposition method

func cellKind(index: UInt64) -> UniffiCadCellKind

"section" or "sector" — whether the cell is a root section or an open interval in its top variable.

CylindricalAlgebraicDecomposition.cell_sample_point#

UniffiCylindricalAlgebraicDecomposition method

func cellSamplePoint(index: UInt64) -> [Double]

The coordinates of the full cell's sample point as floats — a numeric view via the multi-precision evaluator, not a decision.

CylindricalAlgebraicDecomposition.cell_sign_vector#

UniffiCylindricalAlgebraicDecomposition method

func cellSignVector(index: UInt64) -> [Int64]

The exact sign (−1-1, 00, or +1+1) of each input polynomial on the full cell, in input order.

CylindricalAlgebraicDecomposition.projection_operator_used#

UniffiCylindricalAlgebraicDecomposition method

func projectionOperatorUsed() -> String

The projection operator the decomposition was built with: "brown" for the well-oriented fast path, "lazard" when the well-orientedness guard forced the complete fallback, "equational_constraint" for an equational-constraint CAD.

Eigenpair.eigenvalue#

UniffiEigenpair method

func eigenvalue() -> UniffiExpression

The eigenvalue of the pair.

Eigenpair.vectors#

UniffiEigenpair method

func vectors() -> [UniffiMatrix]

A basis of the eigenspace, as column matrices.

HermiteNormalFormDecomposition.hermite#

UniffiHermiteNormalFormDecomposition method

func hermite() -> UniffiMatrix

The Hermite normal form H.

HermiteNormalFormDecomposition.pivot_columns#

UniffiHermiteNormalFormDecomposition method

func pivotColumns() -> [UInt64]

The rank getter reuses the matrix rank heading above.

HermiteNormalFormDecomposition.rank#

UniffiHermiteNormalFormDecomposition method

func rank() -> UInt64

Rank via Bareiss fraction-free elimination.

HermiteNormalFormDecomposition.transformation#

UniffiHermiteNormalFormDecomposition method

func transformation() -> UniffiMatrix

The unimodular transformation U satisfying U * matrix == H.

IntegerCokernelData.free_rank#

UniffiIntegerCokernelData method

func freeRank() -> UInt64

Rank of the free part of the cokernel.

IntegerCokernelData.torsion_invariant_factors#

UniffiIntegerCokernelData method

func torsionInvariantFactors() -> [UniffiExpression]

The invariant factors of the torsion part of the cokernel.

IsolatingInterval.lower#

UniffiIsolatingInterval method

func lower() -> UniffiExpression

Lower endpoint of the isolating interval.

IsolatingInterval.upper#

UniffiIsolatingInterval method

func upper() -> UniffiExpression

Upper endpoint of the isolating interval.

JordanBlock.eigenvalue#

UniffiJordanBlock method

func eigenvalue() -> UniffiExpression

The eigenvalue this Jordan block belongs to.

JordanBlock.size#

UniffiJordanBlock method

func size() -> UInt64

The size of this Jordan block.

JordanDecomposition.blocks#

UniffiJordanDecomposition method

func blocks() -> [UniffiJordanBlock]

The Jordan blocks, in the order they appear on the diagonal.

JordanDecomposition.jordan_form#

UniffiJordanDecomposition method

func jordanForm() -> UniffiMatrix

The Jordan form J of the decomposed matrix.

JordanDecomposition.similarity#

UniffiJordanDecomposition method

func similarity() -> UniffiMatrix

The change of basis S, satisfying matrix * S == S * jordan_form.

Matrix.add#

UniffiMatrix method

func add(other: UniffiMatrix) -> UniffiMatrix

Entrywise sum of two matrices of the same shape.

Matrix.adjugate#

UniffiMatrix method

func adjugate() -> UniffiMatrix

The classical adjoint (transpose of the cofactor matrix); satisfies Madj⁡(M)=det⁡(M)IM\operatorname{adj}(M) = \det(M) I.

Matrix.characteristic_polynomial#

UniffiMatrix method

func characteristicPolynomial(variable: String) -> UniffiExpression

det⁡(λI−M)\det(\lambda I - M) as a polynomial in the named variable.

Matrix.cofactor_matrix#

UniffiMatrix method

func cofactorMatrix() -> UniffiMatrix

The matrix of cofactors, whose transpose is the adjugate.

Matrix.column_hermite_normal_form#

UniffiMatrix method

func columnHermiteNormalForm() -> UniffiHermiteNormalFormDecomposition

The transpose-dual column form, returning H, a unimodular V satisfying MV=HM V = H, the rank, and pivot metadata. Notes: WASM returns a hermite_normal_form_decomposition object.

Matrix.columns#

UniffiMatrix method

func columns() -> UInt64

Number of columns.

Matrix.cosine#

UniffiMatrix method

func cosine() -> UniffiMatrix

The primary matrix cosine cos(M), evaluated exactly through the certified Jordan decomposition and the trigonometric identity certificate.

Matrix.determinant#

UniffiMatrix method

func determinant() -> UniffiExpression

Fraction-free (Berkowitz/Bareiss) determinant of a square matrix.

Matrix.eigenvalues#

UniffiMatrix method

func eigenvalues() -> [UniffiExpression]

Eigenvalues with multiplicity, via the characteristic polynomial and the root finder; eigenvalues the root finder cannot close remain as exact first-class polynomial_root values.

Matrix.eigenvectors#

UniffiMatrix method

func eigenvectors() -> [UniffiEigenpair]

For each eigenvalue, a basis of its eigenspace as column matrices. Notes: WASM returns eigenpair objects with eigenvalue/vectors getters.

Matrix.entry#

UniffiMatrix method

func entry(row: UInt64, column: UInt64) -> UniffiExpression

Element access. Notes: Python uses indexing m[row, column] instead.

Matrix.execute#

UniffiMatrix method

func execute() -> UniffiMatrix

Re-dispatch every unevaluated node (integral, derivative, summation, transform, ODE/recurrence placeholder) in the expression; useful after substitution has changed the inputs.

Matrix.exponential#

UniffiMatrix method

func exponential() -> UniffiMatrix

The matrix exponential exp(M), evaluated through the certified Jordan decomposition. Declines on inputs whose eigenvalues cannot be certified exactly.

Matrix.has_complex_entries#

UniffiMatrix method

func hasComplexEntries() -> UniffiTruthValue

Query whether every entry is finite complex.

Matrix.has_integer_entries#

UniffiMatrix method

func hasIntegerEntries() -> UniffiTruthValue

Query whether every entry is an integer.

Matrix.has_real_entries#

UniffiMatrix method

func hasRealEntries() -> UniffiTruthValue

Query whether every entry is real.

Matrix.hermite_normal_form#

UniffiMatrix method

func hermiteNormalForm() -> UniffiHermiteNormalFormDecomposition

Returns the canonical row-oriented Hermite normal form H, a unimodular transformation U satisfying UM=HU M = H, the rank, and the strictly increasing pivot-column indices. Entries must be exact integers. Every result is verified for Hermite shape, the certificate identity, and unimodularity before return. Notes: WASM returns a hermite_normal_form_decomposition object carrying the same four results as getters.

Matrix.hyperbolic_cosine#

UniffiMatrix method

func hyperbolicCosine() -> UniffiMatrix

The primary hyperbolic matrix cosine cosh(M), evaluated exactly through the certified Jordan decomposition and the hyperbolic identity certificate.

Matrix.hyperbolic_sine#

UniffiMatrix method

func hyperbolicSine() -> UniffiMatrix

The primary hyperbolic matrix sine sinh(M), evaluated exactly through the certified Jordan decomposition. The result is certified together with the hyperbolic matrix cosine by cosh(M)^2 - sinh(M)^2 = I.

Matrix.integer_cokernel_structure#

UniffiMatrix method

func integerCokernelStructure() -> UniffiIntegerCokernelData

Returns the free rank and nontrivial torsion invariant factors of Z^m / M Z^n.

Matrix.integer_image_lattice_basis#

UniffiMatrix method

func integerImageLatticeBasis() -> [UniffiMatrix]

The nonzero columns of the column Hermite form, returned as column matrices; these form the canonical basis of M Z^n.

Matrix.integer_kernel_basis#

UniffiMatrix method

func integerKernelBasis() -> [UniffiMatrix]

A canonical basis of the integer kernel {x∈Zn:Mx=0}\{x \in \mathbb{Z}^n : M x = 0\}, returned as column matrices.

Matrix.integer_row_lattice_basis#

UniffiMatrix method

func integerRowLatticeBasis() -> [UniffiMatrix]

The nonzero rows of the row Hermite form, returned as row matrices; these form the canonical basis of the integer row lattice.

Matrix.inverse#

UniffiMatrix method

func inverse() -> UniffiMatrix

Inverse via the adjugate; raises on singular input.

Matrix.is_diagonal_matrix#

UniffiMatrix method

func isDiagonalMatrix() -> UniffiTruthValue

Query whether this matrix is diagonal.

Matrix.is_equality#

UniffiMatrix method

func isEquality() -> Bool

Always false: a matrix is never an equal relation node.

Matrix.is_finite_set#

UniffiMatrix method

func isFiniteSet() -> Bool

Always false: a matrix is never a finite set.

Matrix.is_full_rank_matrix#

UniffiMatrix method

func isFullRankMatrix() -> UniffiTruthValue

Query whether this matrix has full rank.

Matrix.is_hermitian_matrix#

UniffiMatrix method

func isHermitianMatrix() -> UniffiTruthValue

Query whether this matrix is Hermitian.

Matrix.is_identity_matrix#

UniffiMatrix method

func isIdentityMatrix() -> UniffiTruthValue

Query whether this matrix is the identity matrix.

Matrix.is_image_set#

UniffiMatrix method

func isImageSet() -> Bool

Always false: a matrix is never an image set.

Matrix.is_integral#

UniffiMatrix method

func isIntegral() -> Bool

Always false: a matrix is never an unevaluated integral node.

Matrix.is_invertible_matrix#

UniffiMatrix method

func isInvertibleMatrix() -> UniffiTruthValue

Query whether this matrix is invertible.

Matrix.is_matrix#

UniffiMatrix method

func isMatrix() -> Bool

Always False on expressions and True on matrix objects, so mixed result streams can be discriminated.

Matrix.is_normal_matrix#

UniffiMatrix method

func isNormalMatrix() -> UniffiTruthValue

Query whether this matrix is normal.

Matrix.is_orthogonal_matrix#

UniffiMatrix method

func isOrthogonalMatrix() -> UniffiTruthValue

Query whether this matrix is orthogonal.

Matrix.is_positive#

UniffiMatrix method

func isPositive() -> Bool?

Always None: positivity is a property of the entries, not of the matrix.

Matrix.is_positive_definite_matrix#

UniffiMatrix method

func isPositiveDefiniteMatrix() -> UniffiTruthValue

Query whether this matrix is positive definite.

Matrix.is_positive_semidefinite_matrix#

UniffiMatrix method

func isPositiveSemidefiniteMatrix() -> UniffiTruthValue

Query whether this matrix is positive semidefinite.

Matrix.is_real#

UniffiMatrix method

func isReal() -> Bool?

Always None: realness is a property of the entries, not of the matrix.

Matrix.is_singular_matrix#

UniffiMatrix method

func isSingularMatrix() -> UniffiTruthValue

Query whether this matrix is singular.

Matrix.is_square#

UniffiMatrix method

func isSquare() -> UniffiTruthValue

Query whether this matrix is square.

Matrix.is_stale#

UniffiMatrix method

func isStale() -> Bool

Reports whether resetting the owning context invalidated the expression. All other operations reject a stale receiver with an actionable error.

Matrix.is_symmetric_matrix#

UniffiMatrix method

func isSymmetricMatrix() -> UniffiTruthValue

Query whether this matrix is symmetric.

Matrix.is_union#

UniffiMatrix method

func isUnion() -> Bool

Always false: a matrix is never a union of sets.

Matrix.is_unitary_matrix#

UniffiMatrix method

func isUnitaryMatrix() -> UniffiTruthValue

Query whether this matrix is unitary.

Matrix.is_zero_matrix#

UniffiMatrix method

func isZeroMatrix() -> UniffiTruthValue

Query whether this matrix is the zero matrix.

Matrix.jordan_decomposition#

UniffiMatrix method

func jordanDecomposition() -> UniffiJordanDecomposition

The Jordan decomposition returned as (similarity, jordan_form, blocks) with similarity⁡jordan_form⁡similarity⁡−1=M\operatorname{similarity} \operatorname{jordan\_form} \operatorname{similarity}^{-1} = M, where blocks lists each Jordan block as an (eigenvalue, size) pair. Every root is certified over an exact algebraic field. Notes: WASM returns a jordan_decomposition result class with similarity/jordan_form/blocks getters, each block a jordan_block with eigenvalue/size getters.

Matrix.logarithm#

UniffiMatrix method

func logarithm() -> UniffiMatrix

The principal matrix logarithm log(M).

Matrix.lower_upper_decomposition#

UniffiMatrix method

func lowerUpperDecomposition() -> UniffiMatrixMatrixMatrixTuple

Partial-pivoting LU decomposition returned as (permutation, lower, upper) with permutation⁡M=lower⁡ upper⁡\operatorname{permutation} M = \operatorname{lower}\,\operatorname{upper}.

Matrix.minimal_polynomial#

UniffiMatrix method

func minimalPolynomial(variable: String) -> UniffiExpression

The monic minimal polynomial over the rationals. The matrix must have rational entries.

Matrix.multiply#

UniffiMatrix method

func multiply(other: UniffiMatrix) -> UniffiMatrix

Matrix product; inner dimensions must agree.

Matrix.nullspace_basis#

UniffiMatrix method

func nullspaceBasis() -> [UniffiMatrix]

A basis of the kernel, as column matrices; empty list for full column rank.

Matrix.rank#

UniffiMatrix method

func rank() -> UInt64

Rank via Bareiss fraction-free elimination.

Matrix.rational_canonical_form#

UniffiMatrix method

func rationalCanonicalForm(variable: String) -> UniffiRationalCanonicalForm

Returns the certified Frobenius canonical form over the rationals. Its invariant factors are monic and ordered by divisibility, and similarity satisfies matrix⁡ similarity⁡=similarity⁡ canonical_form⁡\operatorname{matrix}\,\operatorname{similarity} = \operatorname{similarity}\,\operatorname{canonical\_form} exactly.

Matrix.row_reduce#

UniffiMatrix method

func rowReduce() -> UniffiMatrix

Bareiss row-reduced form (fraction-free; pivots remain on the diagonal).

Matrix.rows#

UniffiMatrix method

func rows() -> UInt64

Number of rows.

Matrix.scalar_multiply#

UniffiMatrix method

func scalarMultiply(scalar: UniffiExpression) -> UniffiMatrix

Scale every entry by scalar.

Matrix.sine#

UniffiMatrix method

func sine() -> UniffiMatrix

The primary matrix sine sin(M), evaluated exactly through the certified Jordan decomposition. The result is certified together with the matrix cosine by sin(M)^2 + cos(M)^2 = I.

Matrix.smith_normal_form#

UniffiMatrix method

func smithNormalForm() -> UniffiSmithNormalFormDecomposition

Returns the canonical integer Smith normal form D, unimodular transformations U and V satisfying UMV=DU M V = D, the rank, and the invariant factors including trailing zeros. The nonnegative positive prefix is divisibility-ordered. Every result is verified for diagonal shape, divisibility, the exact certificate, and unimodularity of both transformations before return. Notes: WASM returns a smith_normal_form_decomposition object carrying the same results as getters.

Matrix.square_root#

UniffiMatrix method

func squareRoot() -> UniffiMatrix

The principal matrix square root sqrt(M); the result is verified to square back to M.

Matrix.subtract#

UniffiMatrix method

func subtract(other: UniffiMatrix) -> UniffiMatrix

Entrywise difference of two matrices of the same shape.

Matrix.summary#

UniffiMatrix method

func summary() -> String

A one-line summary listing the entries row by row, Matrix([[a, b], [c, d]]). A matrix with more than eight rows or columns lists its leading eight of each, marks every elided run with ..., and states its full shape first.

Matrix.trace#

UniffiMatrix method

func trace() -> UniffiExpression

Sum of the diagonal entries of a square matrix.

Matrix.transpose#

UniffiMatrix method

func transpose() -> UniffiMatrix

The transpose, with rows and columns exchanged.

RationalCanonicalForm.canonical_form#

UniffiRationalCanonicalForm method

func canonicalForm() -> UniffiMatrix

The Frobenius canonical form of the decomposed matrix.

RationalCanonicalForm.characteristic_polynomial#

UniffiRationalCanonicalForm method

func characteristicPolynomial() -> UniffiExpression

det⁡(λI−M)\det(\lambda I - M) as a polynomial in the named variable.

RationalCanonicalForm.invariant_factors#

UniffiRationalCanonicalForm method

func invariantFactors() -> [UniffiExpression]

The certified invariant factors, monic and ordered by divisibility.

RationalCanonicalForm.minimal_polynomial#

UniffiRationalCanonicalForm method

func minimalPolynomial() -> UniffiExpression

The monic minimal polynomial over the rationals. The matrix must have rational entries.

RationalCanonicalForm.similarity#

UniffiRationalCanonicalForm method

func similarity() -> UniffiMatrix

The certified change of basis S, satisfying matrix * S == S * canonical_form.

SmithNormalFormDecomposition.column_transformation#

UniffiSmithNormalFormDecomposition method

func columnTransformation() -> UniffiMatrix

The unimodular column transformation V satisfying U * matrix * V == S.

SmithNormalFormDecomposition.invariant_factors#

UniffiSmithNormalFormDecomposition method

func invariantFactors() -> [UniffiExpression]

The certified invariant factors, monic and ordered by divisibility.

SmithNormalFormDecomposition.rank#

UniffiSmithNormalFormDecomposition method

func rank() -> UInt64

Rank via Bareiss fraction-free elimination.

SmithNormalFormDecomposition.row_transformation#

UniffiSmithNormalFormDecomposition method

func rowTransformation() -> UniffiMatrix

The unimodular row transformation U satisfying U * matrix * V == S.

SmithNormalFormDecomposition.smith#

UniffiSmithNormalFormDecomposition method

func smith() -> UniffiMatrix

The Smith normal form S.

add_assumptions#

Explicit context

func addAssumptions(proposition: UniffiAssumptionProposition) -> Void

Provides the add_assumptions operation on this mobile object.

algebraic_assumption#

Explicit context

func algebraicAssumption(subject: UniffiExpression) -> UniffiAssumptionProposition

Provides the algebraic_assumption operation on this mobile object.

ask#

Explicit context

func ask(proposition: UniffiAssumptionProposition) -> UniffiTruthValue

Provides the ask operation on this mobile object.

Calling forms and variants

Variant using local assumptions — UniffiAssumptionScope method: UniffiAssumptionScope.ask

func ask(proposition: UniffiAssumptionProposition) -> UniffiTruthValue

assuming#

Explicit context

func assuming(proposition: UniffiAssumptionProposition) -> UniffiAssumptionScope

Provides the assuming operation on this mobile object.

Calling forms and variants

Variant using local assumptions — UniffiAssumptionScope method: UniffiAssumptionScope.assuming

func assuming(proposition: UniffiAssumptionProposition) -> UniffiAssumptionScope

assumption_proposition_from_logical_expression#

Explicit context

func assumptionPropositionFromLogicalExpression(logicalExpression: UniffiExpression) -> UniffiAssumptionProposition

Provides the assumption_proposition_from_logical_expression operation on this mobile object.

change_monomial_order#

Explicit context

func changeMonomialOrder(
    basis: [UniffiExpression],
    variables: [String],
    sourceOrder: UniffiMonomialOrdering,
    targetOrder: UniffiMonomialOrdering,
) -> [UniffiExpression]?

Convert a Gröbner basis of a zero-dimensional ideal from source_order to target_order by FGLM (Faugère–Gianni–Lazard–Mora) — linear algebra in the finite-dimensional quotient ring Q[variables]/I\mathbb{Q}[\text{variables}]/I, far cheaper than computing the target basis directly (the msolve route to a lexicographic basis is a cheap degrevlex basis followed by this conversion).

clear_all_assumptions#

Explicit context

func clearAllAssumptions() -> Void

Provides the clear_all_assumptions operation on this mobile object.

coefficient#

Explicit context

func coefficient(
    inputExpression: UniffiExpression,
    variable: String,
    power: UInt64,
) -> UniffiExpression

Coefficient of variable^power; integer 0 when the term is absent. Errors on non-polynomial input.

complex_assumption#

Explicit context

func complexAssumption(subject: UniffiExpression) -> UniffiAssumptionProposition

Provides the complex_assumption operation on this mobile object.

complex_entries#

Explicit context

func complexEntries(subject: UniffiMatrix) -> UniffiAssumptionProposition

Provides the complex_entries operation on this mobile object.

composite_assumption#

Explicit context

func compositeAssumption(subject: UniffiExpression) -> UniffiAssumptionProposition

Provides the composite_assumption operation on this mobile object.

congruent_assumption#

Explicit context

func congruentAssumption(
    left: UniffiExpression,
    right: UniffiExpression,
    modulus: UniffiExpression,
) -> UniffiAssumptionProposition

Provides the congruent_assumption operation on this mobile object.

could_hold#

Explicit context

func couldHold(proposition: UniffiAssumptionProposition) -> UniffiTruthValue

Provides the could_hold operation on this mobile object.

Calling forms and variants

Variant using local assumptions — UniffiAssumptionScope method: UniffiAssumptionScope.couldHold

func couldHold(proposition: UniffiAssumptionProposition) -> UniffiTruthValue

cylindrical_algebraic_decomposition#

Explicit context

func cylindricalAlgebraicDecomposition(
    expressions: [UniffiExpression],
    variables: [String],
    equationalConstraints: [UInt64],
) -> UniffiCylindricalAlgebraicDecomposition

Construct the CAD of the polynomials in the given variable order x1,…,xnx_1,\ldots,x_n; projection eliminates xnx_n first).

defined_assumption#

Explicit context

func definedAssumption(subject: UniffiExpression) -> UniffiAssumptionProposition

Provides the defined_assumption operation on this mobile object.

degree#

Explicit context

func degree(
    inputExpression: UniffiExpression,
    variable: String,
) -> UInt64?

Degree in variable.

deserialize_assumption_proposition#

Explicit context

func deserializeAssumptionProposition(text: String) -> UniffiAssumptionProposition

Provides the deserialize_assumption_proposition operation on this mobile object.

diagonal_matrix#

Explicit context

func diagonalMatrix(subject: UniffiMatrix) -> UniffiAssumptionProposition

Provides the diagonal_matrix operation on this mobile object.

elimination_ideal#

Explicit context

func eliminationIdeal(
    generators: [UniffiExpression],
    variables: [String],
    eliminate: [String],
) -> [UniffiExpression]?

A Gröbner basis of the elimination ideal ⟨generators⁡⟩∩Q[surviving variables]\langle\operatorname{generators}\rangle \cap \mathbb{Q}[\text{surviving variables}], projecting away the variables named in eliminate via the Elimination Theorem (a block order ranks the eliminated variables high and the generators free of them are kept).

equal_assumption#

Explicit context

func equalAssumption(
    left: UniffiExpression,
    right: UniffiExpression,
) -> UniffiAssumptionProposition

Provides the equal_assumption operation on this mobile object.

even_assumption#

Explicit context

func evenAssumption(subject: UniffiExpression) -> UniffiAssumptionProposition

Provides the even_assumption operation on this mobile object.

extended_real_assumption#

Explicit context

func extendedRealAssumption(subject: UniffiExpression) -> UniffiAssumptionProposition

Provides the extended_real_assumption operation on this mobile object.

finite_assumption#

Explicit context

func finiteAssumption(subject: UniffiExpression) -> UniffiAssumptionProposition

Provides the finite_assumption operation on this mobile object.

full_rank_matrix#

Explicit context

func fullRankMatrix(subject: UniffiMatrix) -> UniffiAssumptionProposition

Provides the full_rank_matrix operation on this mobile object.

greater_assumption#

Explicit context

func greaterAssumption(
    left: UniffiExpression,
    right: UniffiExpression,
) -> UniffiAssumptionProposition

Provides the greater_assumption operation on this mobile object.

greater_or_equal_assumption#

Explicit context

func greaterOrEqualAssumption(
    left: UniffiExpression,
    right: UniffiExpression,
) -> UniffiAssumptionProposition

Provides the greater_or_equal_assumption operation on this mobile object.

groebner_basis#

Explicit context

func groebnerBasis(
    generators: [UniffiExpression],
    variables: [String],
    order: UniffiMonomialOrdering,
) -> [UniffiExpression]?

The canonical reduced Gröbner basis of the ideal <generators> under the named monomial order — monic, autoreduced, and sorted, so it is unique for the (ideal, order) pair. None when any generator is outside Q[variables]\mathbb{Q}[\text{variables}].

hermitian_matrix#

Explicit context

func hermitianMatrix(subject: UniffiMatrix) -> UniffiAssumptionProposition

Provides the hermitian_matrix operation on this mobile object.

ideal_intersection#

Explicit context

func idealIntersection(
    generatorsLeft: [UniffiExpression],
    generatorsRight: [UniffiExpression],
    variables: [String],
    order: UniffiMonomialOrdering,
) -> [UniffiExpression]?

A generating set of the ideal intersection I∩JI \cap J, computed by the standard tag-variable elimination construction tI+(1−t)Jt I + (1-t) J.

ideal_membership#

Explicit context

func idealMembership(
    element: UniffiExpression,
    generators: [UniffiExpression],
    variables: [String],
    order: UniffiMonomialOrdering,
) -> Bool?

Whether element lies in the ideal <generators>, decided by reducing it to its normal form modulo the Gröbner basis (zero exactly when it is a member).

ideal_product#

Explicit context

func idealProduct(
    generatorsLeft: [UniffiExpression],
    generatorsRight: [UniffiExpression],
    variables: [String],
    order: UniffiMonomialOrdering,
) -> [UniffiExpression]?

A Gröbner basis of the ideal product IJI J, generated by all pairwise products of the two generator lists. None on a non-Q[variables]\mathbb{Q}[\text{variables}] generator.

ideal_sum#

Explicit context

func idealSum(
    generatorsLeft: [UniffiExpression],
    generatorsRight: [UniffiExpression],
    variables: [String],
    order: UniffiMonomialOrdering,
) -> [UniffiExpression]?

A Gröbner basis of the ideal sum I + J, the ideal generated by the two generator lists together. None on a non-Q[variables]\mathbb{Q}[\text{variables}] generator.

identity_matrix#

Explicit context

func identityMatrix(subject: UniffiMatrix) -> UniffiAssumptionProposition

Provides the identity_matrix operation on this mobile object.

implicitize#

Explicit context

func implicitize(
    coordinates: [String],
    parameters: [String],
    parametricExpressions: [UniffiExpression],
) -> [UniffiExpression]?

The implicit ideal of a parametric curve or surface xi=fi(parameters⁡)x_i = f_i(\operatorname{parameters}) (the i-th coordinate paired with the i-th parametric expression), returned as a generator list over Q[coordinates]\mathbb{Q}[\text{coordinates}] — the elimination of the parameters (Cox–Little–O'Shea ch. 3).

infinite_assumption#

Explicit context

func infiniteAssumption(subject: UniffiExpression) -> UniffiAssumptionProposition

Provides the infinite_assumption operation on this mobile object.

integer_assumption#

Explicit context

func integerAssumption(subject: UniffiExpression) -> UniffiAssumptionProposition

Provides the integer_assumption operation on this mobile object.

integer_entries#

Explicit context

func integerEntries(subject: UniffiMatrix) -> UniffiAssumptionProposition

Provides the integer_entries operation on this mobile object.

invertible_matrix#

Explicit context

func invertibleMatrix(subject: UniffiMatrix) -> UniffiAssumptionProposition

Provides the invertible_matrix operation on this mobile object.

irrational_assumption#

Explicit context

func irrationalAssumption(subject: UniffiExpression) -> UniffiAssumptionProposition

Provides the irrational_assumption operation on this mobile object.

isolate_real_roots#

Explicit context

func isolateRealRoots(
    inputExpression: UniffiExpression,
    variable: String,
) -> [UniffiIsolatingInterval]

One (lower, upper) rational isolating interval per distinct real root, sorted ascending; a collapsed pair (r, r) marks an exact rational root. Requires a non-zero univariate polynomial with rational coefficients. Notes: WASM returns isolating_interval objects with lower/upper getters.

leading_coefficient#

Explicit context

func leadingCoefficient(
    inputExpression: UniffiExpression,
    variable: String,
) -> UniffiExpression

Coefficient of the highest power of variable; may contain the other free variables. Errors on non-polynomial or zero input.

less_assumption#

Explicit context

func lessAssumption(
    left: UniffiExpression,
    right: UniffiExpression,
) -> UniffiAssumptionProposition

Provides the less_assumption operation on this mobile object.

less_or_equal_assumption#

Explicit context

func lessOrEqualAssumption(
    left: UniffiExpression,
    right: UniffiExpression,
) -> UniffiAssumptionProposition

Provides the less_or_equal_assumption operation on this mobile object.

lower_triangular_matrix#

Explicit context

func lowerTriangularMatrix(subject: UniffiMatrix) -> UniffiAssumptionProposition

Provides the lower_triangular_matrix operation on this mobile object.

matrix#

Explicit context

func matrix(rows: [[UniffiExpression]]) -> UniffiMatrix

Build a matrix from ordered rows. Direct Python construction and the facade module function use the shared default context. The raw wasm-bindgen compatibility layer retains (rows, columns, flat_entries); new JavaScript code should use the nested facade form.

matrix_diagonal#

Explicit context

func matrixDiagonal(entries: [UniffiExpression]) -> UniffiMatrix

Square matrix with the given main diagonal and zeros elsewhere; the empty list raises.

matrix_identity#

Explicit context

func matrixIdentity(size: UInt64) -> UniffiMatrix

The size×size\mathit{size}\times\mathit{size} identity; size 0 raises.

matrix_shape#

Explicit context

func matrixShape(
    subject: UniffiMatrix,
    rows: UInt64,
    columns: UInt64,
) -> UniffiAssumptionProposition

Provides the matrix_shape operation on this mobile object.

matrix_zero#

Explicit context

func matrixZero(rows: UInt64, columns: UInt64) -> UniffiMatrix

The rows×columns\mathit{rows}\times\mathit{columns} zero matrix.

member_assumption#

Explicit context

func memberAssumption(
    element: UniffiExpression,
    setExpression: UniffiExpression,
) -> UniffiAssumptionProposition

Provides the member_assumption operation on this mobile object.

natural_assumption#

Explicit context

func naturalAssumption(subject: UniffiExpression) -> UniffiAssumptionProposition

Provides the natural_assumption operation on this mobile object.

negative_assumption#

Explicit context

func negativeAssumption(subject: UniffiExpression) -> UniffiAssumptionProposition

Provides the negative_assumption operation on this mobile object.

nonnegative_assumption#

Explicit context

func nonnegativeAssumption(subject: UniffiExpression) -> UniffiAssumptionProposition

Provides the nonnegative_assumption operation on this mobile object.

nonpositive_assumption#

Explicit context

func nonpositiveAssumption(subject: UniffiExpression) -> UniffiAssumptionProposition

Provides the nonpositive_assumption operation on this mobile object.

nonzero_assumption#

Explicit context

func nonzeroAssumption(subject: UniffiExpression) -> UniffiAssumptionProposition

Provides the nonzero_assumption operation on this mobile object.

normal_matrix#

Explicit context

func normalMatrix(subject: UniffiMatrix) -> UniffiAssumptionProposition

Provides the normal_matrix operation on this mobile object.

not_equal_assumption#

Explicit context

func notEqualAssumption(
    left: UniffiExpression,
    right: UniffiExpression,
) -> UniffiAssumptionProposition

Provides the not_equal_assumption operation on this mobile object.

odd_assumption#

Explicit context

func oddAssumption(subject: UniffiExpression) -> UniffiAssumptionProposition

Provides the odd_assumption operation on this mobile object.

orthogonal_matrix#

Explicit context

func orthogonalMatrix(subject: UniffiMatrix) -> UniffiAssumptionProposition

Provides the orthogonal_matrix operation on this mobile object.

plain_text#

Expression method

func plainText() -> String

The canonical plain-text form of this expression.

polynomial_gcd#

Explicit context

func polynomialGcd(
    left: UniffiExpression,
    right: UniffiExpression,
    variable: String,
) -> UniffiExpression

Greatest common divisor of the two expressions as polynomials in variable (primitive, with the core's sign normalisation).

positive_assumption#

Explicit context

func positiveAssumption(subject: UniffiExpression) -> UniffiAssumptionProposition

Provides the positive_assumption operation on this mobile object.

positive_definite_matrix#

Explicit context

func positiveDefiniteMatrix(subject: UniffiMatrix) -> UniffiAssumptionProposition

Provides the positive_definite_matrix operation on this mobile object.

positive_integer_assumption#

Explicit context

func positiveIntegerAssumption(subject: UniffiExpression) -> UniffiAssumptionProposition

Provides the positive_integer_assumption operation on this mobile object.

positive_semidefinite_matrix#

Explicit context

func positiveSemidefiniteMatrix(subject: UniffiMatrix) -> UniffiAssumptionProposition

Provides the positive_semidefinite_matrix operation on this mobile object.

prime_assumption#

Explicit context

func primeAssumption(subject: UniffiExpression) -> UniffiAssumptionProposition

Provides the prime_assumption operation on this mobile object.

rational_assumption#

Explicit context

func rationalAssumption(subject: UniffiExpression) -> UniffiAssumptionProposition

Provides the rational_assumption operation on this mobile object.

real_assumption#

Explicit context

func realAssumption(subject: UniffiExpression) -> UniffiAssumptionProposition

Provides the real_assumption operation on this mobile object.

real_entries#

Explicit context

func realEntries(subject: UniffiMatrix) -> UniffiAssumptionProposition

Provides the real_entries operation on this mobile object.

refine#

Explicit context

func refine(
    target: UniffiExpression,
    assumptions: UniffiAssumptionProposition?,
) -> UniffiExpression

Provides the refine operation on this mobile object.

Calling forms and variants

Expression method: UniffiExpression.refine

func refine(assumptions: UniffiAssumptionProposition?) -> UniffiExpression

Variant using local assumptions — UniffiAssumptionScope method: UniffiAssumptionScope.refine

func refine(target: UniffiExpression) -> UniffiExpression

resultant#

Explicit context

func resultant(
    left: UniffiExpression,
    right: UniffiExpression,
    variable: String,
) -> UniffiExpression

Resultant with respect to variable; zero exactly when the two polynomials share a root (over the algebraic closure).

singular_matrix#

Explicit context

func singularMatrix(subject: UniffiMatrix) -> UniffiAssumptionProposition

Provides the singular_matrix operation on this mobile object.

square_matrix#

Explicit context

func squareMatrix(subject: UniffiMatrix) -> UniffiAssumptionProposition

Provides the square_matrix operation on this mobile object.

symmetric_matrix#

Explicit context

func symmetricMatrix(subject: UniffiMatrix) -> UniffiAssumptionProposition

Provides the symmetric_matrix operation on this mobile object.

transcendental_assumption#

Explicit context

func transcendentalAssumption(subject: UniffiExpression) -> UniffiAssumptionProposition

Provides the transcendental_assumption operation on this mobile object.

unitary_matrix#

Explicit context

func unitaryMatrix(subject: UniffiMatrix) -> UniffiAssumptionProposition

Provides the unitary_matrix operation on this mobile object.

upper_triangular_matrix#

Explicit context

func upperTriangularMatrix(subject: UniffiMatrix) -> UniffiAssumptionProposition

Provides the upper_triangular_matrix operation on this mobile object.

zero_assumption#

Explicit context

func zeroAssumption(subject: UniffiExpression) -> UniffiAssumptionProposition

Provides the zero_assumption operation on this mobile object.

zero_equivalent#

Explicit context

func zeroEquivalent(
    target: UniffiExpression,
    constraint: UniffiExpression?,
) -> UniffiZeroEquivalenceVerdict

Provides the zero_equivalent operation on this mobile object.

Calling forms

Expression method: UniffiExpression.zeroEquivalent

func zeroEquivalent(constraint: UniffiExpression?) -> UniffiZeroEquivalenceVerdict

zero_matrix#

Explicit context

func zeroMatrix(subject: UniffiMatrix) -> UniffiAssumptionProposition

Provides the zero_matrix operation on this mobile object.

DefiniteIntegrationResult.decline_reason#

UniffiDefiniteIntegrationResult method

func declineReason() -> UniffiDefiniteIntegrationDeclineReason?

The reason, present exactly when the verdict is declined.

DefiniteIntegrationResult.divergence_direction#

UniffiDefiniteIntegrationResult method

func divergenceDirection() -> UniffiDefiniteIntegrationDivergenceDirection?

The signed infinity of a divergent request, when a single direction was established.

DefiniteIntegrationResult.interpretation#

UniffiDefiniteIntegrationResult method

func interpretation() -> UniffiDefiniteIntegrationInterpretation

The interpretation under which the request was answered.

DefiniteIntegrationResult.value#

UniffiDefiniteIntegrationResult method

func value() -> UniffiExpression?

The exact value, present exactly when the verdict is evaluated.

DefiniteIntegrationResult.verdict#

UniffiDefiniteIntegrationResult method

func verdict() -> UniffiDefiniteIntegrationVerdict

Whether the request was evaluated, proved divergent, or declined.

LimitResult.decline_reason#

UniffiLimitResult method

func declineReason() -> UniffiLimitDeclineReason?

The reason, present exactly when the status is unknown.

LimitResult.status#

UniffiLimitResult method

func status() -> UniffiLimitStatus

Whether the limit is finite, a signed infinity, proved nonexistent, or undecided.

LimitResult.value#

UniffiLimitResult method

func value() -> UniffiExpression?

The exact limit, present exactly when the status is finite.

complex_limit#

Explicit context

func complexLimit(
    target: UniffiExpression,
    variable: String,
    point: UniffiExpression,
) -> UniffiExpression

complex_limit(expression, variable, point) constructs the deferred limit of an expression as the variable tends to a finite point through a punctured complex disk.

complex_sector_limit#

Explicit context

func complexSectorLimit(
    target: UniffiExpression,
    variable: String,
    lowerAngle: UniffiExpression,
    upperAngle: UniffiExpression,
) -> UniffiExpression

complex_sector_limit(expression, variable, lower_angle, upper_angle) constructs the deferred limit of an expression as the variable tends to infinity inside a closed sector.

continuous_domain#

Explicit context

func continuousDomain(
    target: UniffiExpression,
    variable: String,
) -> UniffiExpression

The subset of the real line on which the expression is continuous in variable, as a set expression. Compound rational square-root radicands are lowered to an exact univariate semialgebraic condition when supported, so, for example, sqrt(x + 1/x - 2) has continuous real domain (0, infinity).

Calling forms and variants

Expression method: UniffiExpression.continuousDomain

func continuousDomain(variable: String) -> UniffiExpression

Variant using local assumptions — UniffiAssumptionScope method: UniffiAssumptionScope.continuousDomain

func continuousDomain(
    target: UniffiExpression,
    variable: String,
) -> UniffiExpression

differentiate#

Explicit context

func differentiate(
    target: UniffiExpression,
    variable: String,
) -> UniffiExpression

Symbolic derivative with respect to variable.

Calling forms

Expression method: UniffiExpression.differentiate

func differentiate(variable: String) -> UniffiExpression

evaluate_complex_limit#

Explicit context

func evaluateComplexLimit(
    target: UniffiExpression,
    variable: String,
    point: UniffiExpression,
) -> UniffiExpression

evaluate_complex_limit(expression, variable, point) evaluates a limit through a punctured complex disk. It returns the deferred complex_limit when the limit is not decided.

evaluate_complex_limit_detailed#

Explicit context

func evaluateComplexLimitDetailed(
    target: UniffiExpression,
    variable: String,
    point: UniffiExpression,
) -> UniffiLimitResult

Classify a limit through a punctured complex disk as finite, proved nonexistent, or undecided, keeping the status apart from the value.

evaluate_complex_sector_limit#

Explicit context

func evaluateComplexSectorLimit(
    target: UniffiExpression,
    variable: String,
    lowerAngle: UniffiExpression,
    upperAngle: UniffiExpression,
) -> UniffiExpression

evaluate_complex_sector_limit(expression, variable, lower_angle, upper_angle) evaluates a limit at infinity inside a closed sector, or returns the deferred complex_sector_limit.

evaluate_complex_sector_limit_detailed#

Explicit context

func evaluateComplexSectorLimitDetailed(
    target: UniffiExpression,
    variable: String,
    lowerAngle: UniffiExpression,
    upperAngle: UniffiExpression,
) -> UniffiLimitResult

Classify a limit at infinity inside a closed sector as finite, proved nonexistent, or undecided, keeping the status apart from the value.

evaluate_joint_limit#

Explicit context

func evaluateJointLimit(
    target: UniffiExpression,
    variables: [String],
    point: [UniffiExpression],
    relativeDomain: UniffiExpression?,
) -> UniffiExpression

evaluate_joint_limit(expression, variables, point, relative_domain=None) evaluates a joint limit of two or more real variables. It returns the deferred joint_limit when the limit is not decided.

evaluate_joint_limit_detailed#

Explicit context

func evaluateJointLimitDetailed(
    target: UniffiExpression,
    variables: [String],
    point: [UniffiExpression],
    relativeDomain: UniffiExpression?,
) -> UniffiLimitResult

Classify a joint limit of two or more real variables as finite, nonexistent or undecided, keeping the status apart from the value.

evaluate_limit#

Explicit context

func evaluateLimit(
    target: UniffiExpression,
    variable: String,
    point: UniffiExpression,
    direction: UniffiLimitDirection,
) -> UniffiExpression

evaluate_limit(expression, variable, point, direction="two_sided") runs the eager limit engine. It returns an unevaluated limit when the engine cannot close the result.

Calling forms and variants

Expression method: UniffiExpression.evaluateLimit

func evaluateLimit(
    variable: String,
    point: UniffiExpression,
    direction: UniffiLimitDirection,
) -> UniffiExpression

Variant using local assumptions — UniffiAssumptionScope method: UniffiAssumptionScope.evaluateLimit

func evaluateLimit(
    target: UniffiExpression,
    variable: String,
    point: UniffiExpression,
    direction: UniffiLimitDirection,
) -> UniffiExpression

evaluate_limit_detailed#

Explicit context

func evaluateLimitDetailed(
    target: UniffiExpression,
    variable: String,
    point: UniffiExpression,
    direction: UniffiLimitDirection,
) -> UniffiLimitResult

Classify a limit as finite, a signed infinity, proved nonexistent, or undecided, keeping the status apart from the value.

evaluate_on_grid#

Explicit context

func evaluateOnGrid(
    inputExpression: UniffiExpression,
    variable: String,
    grid: [Double],
) -> [Double]

Evaluate at each grid point, substituting variable.

evaluate_on_grid_points#

Explicit context

func evaluateOnGridPoints(
    inputExpression: UniffiExpression,
    variables: [String],
    points: [Double],
) -> [Double]

Multi-variable companion to evaluate_on_grid: evaluate at each point of a flat row-major coordinate array (one coordinate per variable, so the points length must be a multiple of the variable count), returning one float per point. Positions where evaluation fails hold NaN. Raises when variables is empty or the lengths disagree. Intended for sampling surfaces and implicit curves.

evaluate_sequence_limit#

Explicit context

func evaluateSequenceLimit(
    target: UniffiExpression,
    index: String,
) -> UniffiExpression

evaluate_sequence_limit(expression, index) evaluates the limit of a sequence as its positive-integer index tends to infinity. It returns the deferred sequence_limit when the engine cannot decide the limit.

Calling forms and variants

Expression method: UniffiExpression.evaluateSequenceLimit

func evaluateSequenceLimit(index: String) -> UniffiExpression

Variant using local assumptions — UniffiAssumptionScope method: UniffiAssumptionScope.evaluateSequenceLimit

func evaluateSequenceLimit(
    target: UniffiExpression,
    index: String,
) -> UniffiExpression

evaluate_sequence_limit_detailed#

Explicit context

func evaluateSequenceLimitDetailed(
    target: UniffiExpression,
    index: String,
) -> UniffiLimitResult

Classify a sequence limit as finite, a signed infinity, proved nonexistent, or undecided, keeping the status apart from the value.

execute#

Explicit context

func execute(target: UniffiExpression) -> UniffiExpression

Re-dispatch every unevaluated node (integral, derivative, summation, transform, ODE/recurrence placeholder) in the expression; useful after substitution has changed the inputs.

Calling forms

Expression method: UniffiExpression.execute

func execute() -> UniffiExpression

fourier_transform#

Explicit context

func fourierTransform(
    target: UniffiExpression,
    timeVariable: String,
    frequencyVariable: String,
) -> UniffiExpression

Forward Fourier transform in the angular-frequency convention F(ω)=∫f(t)e−iωt dtF(\omega) = \int f(t)e^{-i\omega t}\,dt.

Calling forms and variants

Variant using local assumptions — UniffiAssumptionScope method: UniffiAssumptionScope.fourierTransform

func fourierTransform(
    target: UniffiExpression,
    timeVariable: String,
    frequencyVariable: String,
) -> UniffiExpression

integrate#

Explicit context

func integrate(
    target: UniffiExpression,
    variable: String,
) -> UniffiExpression

Indefinite integration (no constant of integration).

Calling forms and variants

Expression method: UniffiExpression.integrate

func integrate(variable: String) -> UniffiExpression

Variant using local assumptions — UniffiAssumptionScope method: UniffiAssumptionScope.integrate

func integrate(
    target: UniffiExpression,
    variable: String,
) -> UniffiExpression

integrate_definite#

Explicit context

func integrateDefinite(
    inputExpression: UniffiExpression,
    variable: String,
    lower: UniffiExpression,
    upper: UniffiExpression,
) -> UniffiExpression

Definite integration over [lower, upper] (bounds may be infinite).

Calling forms and variants

Expression method: UniffiExpression.integrateDefinite

func integrateDefinite(
    variable: String,
    lower: UniffiExpression,
    upper: UniffiExpression,
) -> UniffiExpression

Variant using local assumptions — UniffiAssumptionScope method: UniffiAssumptionScope.integrateDefinite

func integrateDefinite(
    target: UniffiExpression,
    variable: String,
    lowerBound: UniffiExpression,
    upperBound: UniffiExpression,
) -> UniffiExpression

integrate_definite_detailed#

Explicit context

func integrateDefiniteDetailed(
    target: UniffiExpression,
    variable: String,
    lowerBound: UniffiExpression,
    upperBound: UniffiExpression,
    interpretation: UniffiDefiniteIntegrationInterpretation,
    constraint: UniffiExpression?,
) -> UniffiDefiniteIntegrationResult

Evaluate a definite integral under an interpretation and an optional declared region, retaining whether it was evaluated, proved divergent, or declined.

integrate_definite_under_constraint#

Explicit context

func integrateDefiniteUnderConstraint(
    target: UniffiExpression,
    variable: String,
    lowerBound: UniffiExpression,
    upperBound: UniffiExpression,
    constraint: UniffiExpression,
) -> UniffiExpression

Definite integration under a local bounded logical constraint.

Calling forms

Expression method: UniffiExpression.integrateDefiniteUnderConstraint

func integrateDefiniteUnderConstraint(
    variable: String,
    lowerBound: UniffiExpression,
    upperBound: UniffiExpression,
    constraint: UniffiExpression,
) -> UniffiExpression

integrate_iterated#

Explicit context

func integrateIterated(
    inputExpression: UniffiExpression,
    variables: [String],
) -> UniffiExpression

Iterated indefinite integration, applying the single-variable pipeline once per entry of variables in left-to-right order (innermost binder first).

Calling forms

Expression method: UniffiExpression.integrateIterated

func integrateIterated(variables: [String]) -> UniffiExpression

inverse_fourier_transform#

Explicit context

func inverseFourierTransform(
    target: UniffiExpression,
    frequencyVariable: String,
    timeVariable: String,
) -> UniffiExpression

Inverse Fourier transform of the same convention.

inverse_laplace_transform#

Explicit context

func inverseLaplaceTransform(
    target: UniffiExpression,
    frequencyVariable: String,
    timeVariable: String,
) -> UniffiExpression

Inverse Laplace transform; rational inputs route through a partial-fraction reverse lookup.

joint_limit#

Explicit context

func jointLimit(
    target: UniffiExpression,
    variables: [String],
    point: [UniffiExpression],
    relativeDomain: UniffiExpression?,
) -> UniffiExpression

joint_limit(expression, variables, point, relative_domain=None) constructs the deferred joint limit of an expression as the ordered variables tend together to the center, optionally relative to a domain given as a logical expression.

laplace_transform#

Explicit context

func laplaceTransform(
    target: UniffiExpression,
    timeVariable: String,
    frequencyVariable: String,
) -> UniffiExpression

Forward Laplace transform F(s)=∫0∞f(t)e−st dtF(s) = \int_0^\infty f(t)e^{-st}\,dt.

Calling forms and variants

Variant using local assumptions — UniffiAssumptionScope method: UniffiAssumptionScope.laplaceTransform

func laplaceTransform(
    target: UniffiExpression,
    timeVariable: String,
    frequencyVariable: String,
) -> UniffiExpression

laurent_series#

Explicit context

func laurentSeries(
    target: UniffiExpression,
    variable: String,
    center: UniffiExpression,
    order: UInt64,
) -> UniffiExpression

Truncated Laurent expansion at center: every (variable⁡−center⁡)k(\operatorname{variable} - \operatorname{center})^k term with −m≤k<order⁡-m \le k < \operatorname{order}, where m is the pole order. Analytic points degrade to the Taylor expansion. At an essential singularity (where pole_order declines) the result is an unevaluated series_unevaluated(...) placeholder, because no finite truncation of the principal part is correct.

Calling forms

Expression method: UniffiExpression.laurentSeries

func laurentSeries(
    variable: String,
    center: UniffiExpression,
    order: UInt64,
) -> UniffiExpression

limit#

Explicit context

func limit(
    target: UniffiExpression,
    variable: String,
    point: UniffiExpression,
    direction: UniffiLimitDirection,
) -> UniffiExpression

limit(expression, variable, point, direction="two_sided") constructs a deferred limit.

Calling forms

Expression method: UniffiExpression.limit

func limit(
    variable: String,
    point: UniffiExpression,
    direction: UniffiLimitDirection,
) -> UniffiExpression

maclaurin_series#

Explicit context

func maclaurinSeries(
    inputExpression: UniffiExpression,
    variable: String,
    truncationOrder: UInt64,
) -> UniffiExpression

taylor_series specialised to expansion point 0.

Calling forms

Expression method: UniffiExpression.maclaurinSeries

func maclaurinSeries(
    variable: String,
    truncationOrder: UInt64,
) -> UniffiExpression

pole_order#

Explicit context

func poleOrder(
    inputExpression: UniffiExpression,
    variable: String,
    center: UniffiExpression,
) -> Int64?

Order of the singularity at center: 0 for analytic/removable points, m≥1m \ge 1 for a pole of order mm.

Calling forms

Expression method: UniffiExpression.poleOrder

func poleOrder(variable: String, center: UniffiExpression) -> Int64?

residue#

Explicit context

func residue(
    inputExpression: UniffiExpression,
    variable: String,
    center: UniffiExpression,
) -> UniffiExpression

Coefficient of (variable⁡−center⁡)−1(\operatorname{variable} - \operatorname{center})^{-1} in the Laurent expansion at center.

Calling forms

Expression method: UniffiExpression.residue

func residue(
    variable: String,
    center: UniffiExpression,
) -> UniffiExpression

sequence_limit#

Explicit context

func sequenceLimit(
    target: UniffiExpression,
    index: String,
) -> UniffiExpression

sequence_limit(expression, index) constructs the deferred limit of a sequence as its positive-integer index tends to infinity.

Calling forms

Expression method: UniffiExpression.sequenceLimit

func sequenceLimit(index: String) -> UniffiExpression

singularities#

Explicit context

func singularities(
    target: UniffiExpression,
    variable: String,
) -> UniffiExpression

The singular points of the expression in the complex plane, as a set expression (finite set, union, image set for periodic families, …).

Calling forms and variants

Expression method: UniffiExpression.singularities

func singularities(variable: String) -> UniffiExpression

Variant using local assumptions — UniffiAssumptionScope method: UniffiAssumptionScope.singularities

func singularities(
    target: UniffiExpression,
    variable: String,
) -> UniffiExpression

taylor_series#

Explicit context

func taylorSeries(
    target: UniffiExpression,
    variable: String,
    expansionPoint: UniffiExpression,
    truncationOrder: UInt64,
) -> UniffiExpression

Truncated Taylor expansion about expansion_point, keeping terms of degree strictly less than order (the remainder is O((x−a)order⁡)O((x-a)^{\operatorname{order}}).

Calling forms and variants

Expression method: UniffiExpression.taylorSeries

func taylorSeries(
    variable: String,
    expansionPoint: UniffiExpression,
    truncationOrder: UInt64,
) -> UniffiExpression

Variant using local assumptions — UniffiAssumptionScope method: UniffiAssumptionScope.taylorSeries

func taylorSeries(
    target: UniffiExpression,
    variable: String,
    expansionPoint: UniffiExpression,
    truncationOrder: UInt64,
) -> UniffiExpression

e#

Explicit context

func e() -> UniffiExpression

Euler's number ee, the base of the natural logarithm. exp(1) and this constant are the same expression.

euler_gamma#

Explicit context

func eulerGamma() -> UniffiExpression

The Euler–Mascheroni constant γ\gamma.

imaginary_unit#

Explicit context

func imaginaryUnit() -> UniffiExpression

The imaginary unit ii with i2=−1i^2 = -1.

infinity#

Explicit context

func infinity() -> UniffiExpression

Unsigned positive infinity ∞\infty.

pi#

Explicit context

func pi() -> UniffiExpression

The circle constant π\pi.

derivative#

Explicit context

func derivative(
    target: UniffiExpression,
    variable: String,
    order: UInt64,
) -> UniffiExpression

Constructs a deferred derivative. The variable may be a name or a same-context symbol expression. Use execute to evaluate it.

Calling forms

Expression method: UniffiExpression.derivative

func derivative(variable: String, order: UInt64) -> UniffiExpression

derivative_unevaluated#

Explicit context

func derivativeUnevaluated(
    target: UniffiExpression,
    variable: String,
    order: UInt64,
) -> UniffiExpression

Constructs the deferred derivative of the given order without differentiating; execute evaluates it. Use differentiate for the eager derivative.

Calling forms

Expression method: UniffiExpression.derivativeUnevaluated

func derivativeUnevaluated(
    variable: String,
    order: UInt64,
) -> UniffiExpression

integer#

Explicit context

func integer(value: Int64) -> UniffiExpression

Build an arbitrary-precision exact integer. Python bool values are rejected. JavaScript's recommended facade accepts bigint and safe integral number values.

integer_from_string#

Explicit context

func integerFromString(text: String) -> UniffiExpression

Build an arbitrary-precision integer literal from its decimal string.

integral#

Explicit context

func integral(
    integrand: UniffiExpression,
    variable: String,
    lower: UniffiExpression?,
    upper: UniffiExpression?,
) -> UniffiExpression

Build an unevaluated integral node (indefinite when bounds are omitted).

parse#

Explicit context

func parse(text: String) -> UniffiExpression

Parse Symi textual syntax into an expression. Accepts ^ and ** for powers; knows the builtin function names (sin, log, sqrt, …) and the constants pi, e.

parse_latex#

Explicit context

func parseLatex(latex: String) -> UniffiMathematicalObject

Parse a LaTeX string in Symi's canonical input dialect — the inverse of to_latex and the parser the Symi frontend uses. Returns whichever top-level object the input denotes: an ordinary expression, a \begin{matrix}…\end{matrix}, or a geometry figure ((x, y) point, segment, polygon, or circle), wrapped in the matching exported class exactly as parse_serialized_object does. Coverage spans arithmetic, powers, fractions, roots, the elementary and many special functions, comparisons, integrals (including the bare-d differential), Leibniz derivatives (\frac{d}{dx} — differentiated eagerly), limits, summations, products, determinants, and actuarial annuities. The resolution is context-aware in a way parse is not: a bare i is the imaginary unit and a bare e is Euler's number unless the letter is a bound index (a summation / product / limit index shadows the constant), and \mathrm{d} — or a bare d that closes an integral — is the differential operator while a bare d elsewhere is an ordinary variable. Raises on syntax errors.

parse_latex_with_environment#

Explicit context

func parseLatexWithEnvironment(
    latex: String,
    serializedDefinitions: [String],
) -> UniffiMathematicalObject

Parse LaTeX after building an ordered definition environment. Each serialized definition is a string with four fields separated by ASCII Unit Separator (U+001F): kind, name, parameters, and body_latex.

parse_serialized_object#

Explicit context

func parseSerializedObject(text: String) -> UniffiMathematicalObject

Inverse of serialize_object; returns the matching surface class.

product#

Explicit context

func product(
    multiplicand: UniffiExpression,
    index: String,
    lower: UniffiExpression,
    upper: UniffiExpression,
) -> UniffiExpression

Definite indexed product ∏index=loweruppermultiplicand\prod_{\mathit{index}=\mathit{lower}}^{\mathit{upper}} \mathit{multiplicand}, a first-class indexed_product binder (rendered \prod in LaTeX).

product_indefinite#

Explicit context

func productIndefinite(
    multiplicand: UniffiExpression,
    index: String,
) -> UniffiExpression

Indefinite (anti-quotient) product: the P(k) satisfying P(k+1)/P(k) = multiplicand(k), the multiplicative analogue of summation_indefinite.

rational#

Explicit context

func rational(numerator: Int64, denominator: Int64) -> UniffiExpression

Constructs an exact reduced rational from arbitrary-size integers. A zero denominator is an argument error. Python also accepts fractions.Fraction wherever an expression-like input is accepted.

reset_context#

Explicit context

func resetContext() -> Void

Replace the context's entire symbol table and expression store with fresh empty ones. Warning: existing expression/matrix/geometry objects from this context become stale and must not be used afterwards — their symbol identifiers no longer resolve. Deliberately not available at module level: resetting the shared default context would strand every live object, and the weak expression store already keeps memory bounded by live objects (see the default context).

serialize_object#

Explicit context

func serializeObject(object: UniffiMathematicalObject) -> String

Serialize an expression, matrix, or geometry object to the stable Symi serialization format, round-trippable via parse_serialized_object.

Calling forms and variants

Expression method: UniffiExpression.serializeObject

func serializeObject() -> String

Variant for this object — UniffiCircle2d method: UniffiCircle2d.serializeObject

func serializeObject() -> String

Variant for this object — UniffiMatrix method: UniffiMatrix.serializeObject

func serializeObject() -> String

Variant for this object — UniffiPoint2d method: UniffiPoint2d.serializeObject

func serializeObject() -> String

Variant for this object — UniffiPolygon2d method: UniffiPolygon2d.serializeObject

func serializeObject() -> String

Variant for this object — UniffiSegment2d method: UniffiSegment2d.serializeObject

func serializeObject() -> String

Variant for this object — UniffiTriangle2d method: UniffiTriangle2d.serializeObject

func serializeObject() -> String

summation#

Explicit context

func summation(
    summand: UniffiExpression,
    index: String,
    lower: UniffiExpression,
    upper: UniffiExpression,
) -> UniffiExpression

Build a summation node ∑\sum.

summation_indefinite#

Explicit context

func summationIndefinite(
    summand: UniffiExpression,
    index: String,
) -> UniffiExpression

Anti-difference: a closed form FF with F(index⁡+1)−F(index⁡)=summand⁡F(\operatorname{index}+1) - F(\operatorname{index}) = \operatorname{summand}.

Calling forms

Expression method: UniffiExpression.summationIndefinite

func summationIndefinite(index: String) -> UniffiExpression

symbol#

Explicit context

func symbol(name: String) -> UniffiExpression

Intern a symbol and (optionally) attach assumptions used by the assumption engine and the simplifier. Domain flags refine in the order natural →\to integer →\to rational →\to real; positive/negative also set nonzero, and nonzero may be requested independently.

to_latex#

Explicit context

func toLatex(target: UniffiExpression) -> String

Render an expression as LaTeX. Matrices and geometry objects have their own to_latex methods.

Calling forms and variants

Expression method: UniffiExpression.toLatex

func toLatex() -> String

Variant for this object — UniffiCircle2d method: UniffiCircle2d.toLatex

func toLatex() -> String

Variant for this object — UniffiMatrix method: UniffiMatrix.toLatex

func toLatex() -> String

Variant for this object — UniffiPoint2d method: UniffiPoint2d.toLatex

func toLatex() -> String

Variant for this object — UniffiPolygon2d method: UniffiPolygon2d.toLatex

func toLatex() -> String

Variant for this object — UniffiSegment2d method: UniffiSegment2d.toLatex

func toLatex() -> String

Variant for this object — UniffiTriangle2d method: UniffiTriangle2d.toLatex

func toLatex() -> String

to_latex_with_options#

Explicit context

func toLatexWithOptions(
    inputExpression: UniffiExpression,
    options: UniffiLatexPresentationOptions,
) -> String

Render an expression as LaTeX with presentation flags. Each argument is a string naming the choice for one flag; an unrecognized name falls back to that flag's canonical default (so to_latex_with_options(e, "", "", "") equals to_latex(e)):

Calling forms

Expression method: UniffiExpression.toLatexWithOptions

func toLatexWithOptions(options: UniffiLatexPresentationOptions) -> String

assumptions_of#

Explicit context

func assumptionsOf(variable: String) -> [UniffiAssumptionProposition]

Return every assumption declared about one symbol, as a list of proposition texts such as "real(x)" or "prime(n)". The variable may be a name or same-context symbol. The list is what was declared, not what can be proved; use ask for a three-valued verdict.

clear_assumptions#

Explicit context

func clearAssumptions(variable: String) -> Void

Reset one symbol's assumptions to the default (complex domain, every property unknown).

interner_length#

Explicit context

func internerLength() -> UInt64

Number of live expressions currently interned in the context. Dead entries awaiting the amortized sweep are not counted. Useful for observing memory in long-running sessions and in tests that assert the store stays bounded.

IntegerSolutionTuple.coordinates#

UniffiIntegerSolutionTuple method

func coordinates() -> [UniffiExpression]

The coordinates, in the order of the requested unknowns.

IntegerSolveReport.complete#

UniffiIntegerSolveReport method

func complete() -> Bool

Whether the report states the whole integer solution set; false only when declined.

IntegerSolveReport.decline_reason#

UniffiIntegerSolveReport method

func declineReason() -> UniffiIntegerSolveDeclineReason?

The reason, present exactly when the verdict is declined.

IntegerSolveReport.lattice_basis#

UniffiIntegerSolveReport method

func latticeBasis() -> [UniffiIntegerSolutionTuple]

A Hermite-reduced basis of the direction lattice of a lattice_family report.

IntegerSolveReport.lattice_particular#

UniffiIntegerSolveReport method

func latticeParticular() -> UniffiIntegerSolutionTuple?

One point of the solution lattice of a lattice_family report.

IntegerSolveReport.modulus#

UniffiIntegerSolveReport method

func modulus() -> UniffiExpression?

The positive modulus of the residue class of a congruence_family report.

IntegerSolveReport.parameters#

UniffiIntegerSolveReport method

func parameters() -> [UniffiExpression]

The parameters of the solution tuples, each ranging over every integer.

IntegerSolveReport.pell_equation#

UniffiIntegerSolveReport method

func pellEquation() -> UniffiExpression?

The normalized equation x^2 - D*y^2 = N of a pell_orbits report, in the unknowns.

IntegerSolveReport.pell_seeds#

UniffiIntegerSolveReport method

func pellSeeds() -> [UniffiIntegerSolutionTuple]

One seed per orbit, the representative in the fundamental interval of the unit, in the order of the requested unknowns.

IntegerSolveReport.pell_unit#

UniffiIntegerSolveReport method

func pellUnit() -> UniffiIntegerSolutionTuple?

The fundamental solution (u, v) of u^2 - D*v^2 = 1 generating every orbit.

IntegerSolveReport.proof_methods#

UniffiIntegerSolveReport method

func proofMethods() -> [UniffiIntegerSolveProofMethod]

The kinds of exact evidence the result rests on.

IntegerSolveReport.residue#

UniffiIntegerSolveReport method

func residue() -> UniffiExpression?

The least nonnegative member of the residue class of a congruence_family report.

IntegerSolveReport.solutions#

UniffiIntegerSolveReport method

func solutions() -> [UniffiIntegerSolutionTuple]

The solution tuples, exact in the integer parameters.

IntegerSolveReport.undefined_points#

UniffiIntegerSolveReport method

func undefinedPoints() -> [UniffiIntegerSolutionTuple]

The integer points at which some source equation is undefined; no solution is one.

IntegerSolveReport.unknowns#

UniffiIntegerSolveReport method

func unknowns() -> [UniffiExpression]

The requested unknowns, in the order every tuple uses.

IntegerSolveReport.verdict#

UniffiIntegerSolveReport method

func verdict() -> UniffiIntegerSolveVerdict

What the solve established: finite, empty, lattice_family, congruence_family, pell_orbits, or declined.

PrimeFactor.multiplicity#

UniffiRootMultiplicity method

func multiplicity() -> UInt64

The multiplicity of the root.

QuadraticContinuedFractionExpansion.initial_terms#

UniffiQuadraticContinuedFractionExpansion method

func initialTerms() -> [UniffiExpression]

The terms preceding the periodic part of the expansion.

QuadraticContinuedFractionExpansion.periodic_terms#

UniffiQuadraticContinuedFractionExpansion method

func periodicTerms() -> [UniffiExpression]

The repeating terms of the expansion.

RootMultiplicity.root#

UniffiRootMultiplicity method

func root() -> UniffiExpression

Principal n-th root, stored as x^(1/n).

SetEnumeration.elements#

UniffiSetEnumeration method

func elements() -> [UniffiExpression]

The exact elements produced, in increasing order.

SetEnumeration.outcome#

UniffiSetEnumeration method

func outcome() -> UniffiEnumerationVerdict

"complete", "truncated", or "declined".

bell_number#

Explicit context

func bellNumber(argument: UniffiExpression) -> UniffiExpression

The n-th Bell number.

catalan_number#

Explicit context

func catalanNumber(argument: UniffiExpression) -> UniffiExpression

The n-th Catalan number.

chinese_remainder#

Explicit context

func chineseRemainder(residuesAndModuli: [UniffiExpressionExpressionTuple]) -> UniffiExpression

The smallest non-negative solution of the simultaneous congruences x≡ri(modmi)x \equiv r_i \pmod{m_i}.

complex_plane#

Explicit context

func complexPlane() -> UniffiExpression

The set C\mathbb{C} — the ambient universe, and the domain a variable ranges over when it carries no realness assumption.

condition_set#

Explicit context

func conditionSet(
    variable: String,
    condition: UniffiExpression,
    domain: UniffiExpression,
) -> UniffiExpression

The set {variable⁡∈domain⁡:condition⁡}\{\operatorname{variable} \in \operatorname{domain} : \operatorname{condition}\}.

conjunctive_normal_form#

Explicit context

func conjunctiveNormalForm(inputExpression: UniffiExpression) -> UniffiExpression

The dual of disjunctive_normal_form: a reduced conjunctive normal form (an AND of OR-clauses over literals).

Calling forms

Expression method: UniffiExpression.conjunctiveNormalForm

func conjunctiveNormalForm() -> UniffiExpression

continued_fraction_quadratic_irrational#

Explicit context

func continuedFractionQuadraticIrrational(value: UniffiExpression) -> UniffiQuadraticContinuedFractionExpansion

Eventually-periodic expansion of d\sqrt{d} for a non-negative integer d, returned as (initial_terms, periodic_part).

continued_fraction_rational#

Explicit context

func continuedFractionRational(value: UniffiExpression) -> [UniffiExpression]

Terminating continued-fraction expansion [a0; a1, a2, ...] of an integer or rational expression leaf.

disjunctive_normal_form#

Explicit context

func disjunctiveNormalForm(inputExpression: UniffiExpression) -> UniffiExpression

Rewrite a propositional formula into a reduced disjunctive normal form (an OR of AND-terms over literals): derived connectives are eliminated, negations are pushed to the atoms, the formula is distributed, and contradictory, duplicate, and subsumed terms are dropped.

Calling forms

Expression method: UniffiExpression.disjunctiveNormalForm

func disjunctiveNormalForm() -> UniffiExpression

divisor_count#

Explicit context

func divisorCount(argument: UniffiExpression) -> UniffiExpression

Number of positive divisors τ(n)\tau(n).

divisor_sigma#

Explicit context

func divisorSigma(
    argument: UniffiExpression,
    power: UInt64,
) -> UniffiExpression

Sum of the power-th powers of the positive divisors σpower(n)\sigma_{\mathit{power}}(n); power = 0 gives divisor_count, power = 1 the divisor sum.

eliminate_derived_logical_connectives#

Explicit context

func eliminateDerivedLogicalConnectives(inputExpression: UniffiExpression) -> UniffiExpression

Rewrite every implies, equivalent, and exclusive_or occurrence into the logical_and / logical_or / logical_not basis. This is a directed presentation request, not a cost decision, so the result may be larger than the input; a formula already in the basis, and a conversion that would cross the fixed size ceiling, both return the input unchanged.

Calling forms

Expression method: UniffiExpression.eliminateDerivedLogicalConnectives

func eliminateDerivedLogicalConnectives() -> UniffiExpression

empty_set#

Explicit context

func emptySet() -> UniffiExpression

The empty set ∅\varnothing.

enumerate_set_in_interval#

Explicit context

func enumerateSetInInterval(
    set: UniffiExpression,
    lower: UniffiExpression,
    upper: UniffiExpression,
    lowerInclusive: Bool,
    upperInclusive: Bool,
    limit: UInt64?,
) -> UniffiSetEnumeration

Exact elements of a set inside [lower⁡,upper⁡][\operatorname{lower}, \operatorname{upper}], in increasing order, as {"outcome": str, "elements": list[expression]}. outcome is "complete" when those are exactly the elements in the interval, "truncated" when limit cut the list short (the family is still solved), and "declined" when the set's shape is not enumerable — never a licence to approximate.

euler_totient#

Explicit context

func eulerTotient(value: UniffiExpression) -> UniffiExpression

Euler's φ(n)\varphi(n); requires a positive integer.

evaluate_truth#

Explicit context

func evaluateTruth(target: UniffiExpression) -> UniffiTruthValue

evaluate_truth(predicate) uses exact three-valued logic. Python returns True, False, or None; JavaScript returns true, false, or null; Rust returns truth_value. The third value means undecided, never false: a host-language if reads it as falsy, so compare against True / False explicitly. Order, equality and sign relations between closed-form real constants — rationals, pi, radicals and real algebraic numbers — are decided exactly by rational arithmetic; transcendental, symbolic and provably non-real operands decline rather than guess.

Calling forms

Expression method: UniffiExpression.evaluateTruth

func evaluateTruth() -> UniffiTruthValue

extended_euclidean#

Explicit context

func extendedEuclidean(
    left: UniffiExpression,
    right: UniffiExpression,
) -> UniffiExpressionExpressionExpressionTuple

(gcd, x, y) with ax+by=gcd⁡a x + b y = \operatorname{gcd}.

factor_integer#

Explicit context

func factorInteger(argument: UniffiExpression) -> [UniffiExpressionUnsignedIntegerTuple]

Prime factorization as (prime, multiplicity) pairs, ascending. Errors on zero. Notes: WASM returns prime_factor objects with prime/multiplicity getters; the sign −1-1 of a negative input is carried as a leading (-1, 1) factor exactly as the core reports it.

falling_factorial#

Explicit context

func fallingFactorial(
    value: UniffiExpression,
    order: UniffiExpression,
) -> UniffiExpression

base⁡(base⁡−1)⋯(base⁡−length⁡+1)\operatorname{base}(\operatorname{base}-1)\cdots(\operatorname{base}-\operatorname{length}+1); length must be a non-negative integer, base may be any integer.

fibonacci_number#

Explicit context

func fibonacciNumber(argument: UniffiExpression) -> UniffiExpression

The n-th Fibonacci number (F(0) = 0, F(1) = 1).

finite_set#

Explicit context

func finiteSet(elements: [UniffiExpression]) -> UniffiExpression

Finite set; elements are deduplicated and canonically ordered. An empty list gives the empty set.

image_set#

Explicit context

func imageSet(
    lambdaExpression: UniffiExpression,
    variable: String,
    domain: UniffiExpression,
) -> UniffiExpression

The set {lambda_expression⁡:variable⁡∈domain⁡}\{\operatorname{lambda\_expression} : \operatorname{variable} \in \operatorname{domain}\}; variable is a binder over lambda_expression.

integer_gcd#

Explicit context

func integerGcd(
    left: UniffiExpression,
    right: UniffiExpression,
) -> UniffiExpression

Greatest common divisor (non-negative).

integer_lcm#

Explicit context

func integerLcm(
    left: UniffiExpression,
    right: UniffiExpression,
) -> UniffiExpression

Least common multiple.

integer_nth_root#

Explicit context

func integerNthRoot(
    argument: UniffiExpression,
    rootIndex: UInt64,
) -> UniffiExpression

⌊n1/root_index⌋\lfloor n^{1/\mathit{root\_index}}\rfloor; odd indices accept negative n. Errors when no real root exists (even index, negative n).

integer_set#

Explicit context

func integerSet() -> UniffiExpression

The set Z\mathbb{Z}.

integer_square_root#

Explicit context

func integerSquareRoot(argument: UniffiExpression) -> UniffiExpression

⌊n⌋\lfloor\sqrt{n}\rfloor for non-negative n.

interval#

Explicit context

func interval(
    lower: UniffiExpression,
    upper: UniffiExpression,
    lowerInclusive: Bool,
    upperInclusive: Bool,
) -> UniffiExpression

Real-line interval. Closed by default; endpoints at infinity are forced open. Degenerate shapes collapse (empty interval →\to empty set, single point →\to finite set, (−∞,∞)→(-\infty, \infty)\to real line).

introduce_derived_logical_connectives#

Explicit context

func introduceDerivedLogicalConnectives(inputExpression: UniffiExpression) -> UniffiExpression

Recognise the exact canonical definitions of implication, equivalence, and exclusive-or inside an and/or/not formula and replace each match with the derived connective, but only where the replacement is strictly smaller. It is a local structural compressor: a formula merely equivalent to a definition, without matching it, is left unchanged.

Calling forms

Expression method: UniffiExpression.introduceDerivedLogicalConnectives

func introduceDerivedLogicalConnectives() -> UniffiExpression

is_member#

Explicit context

func isMember(
    element: UniffiExpression,
    set: UniffiExpression,
) -> UniffiTruthValue

Three-valued membership: True only on structural proof, False only on a structural counterexample, None otherwise. Covers ∅\varnothing, R\mathbb{R}, finite sets, intervals, unions, intersections, complements.

is_prime#

Explicit context

func isPrime(argument: UniffiExpression) -> Bool?

Deterministic primality verdict; None when the input is outside the classifier's domain (e.g. not a natural number ≥0\geq 0 representation it handles).

Calling forms

Expression method: UniffiExpression.isPrime

func isPrime() -> UniffiTruthValue

is_subset#

Explicit context

func isSubset(
    smaller: UniffiExpression,
    larger: UniffiExpression,
) -> UniffiTruthValue

Three-valued subset query: ∅⊆\varnothing \subseteq anything, structural equality, finite-set element checks, interval-in-interval endpoint tests; None otherwise.

jacobi_symbol#

Explicit context

func jacobiSymbol(
    numerator: UniffiExpression,
    denominator: UniffiExpression,
) -> Int64

The Jacobi symbol (n/d)∈{−1,0,1}(n/d) \in \{-1, 0, 1\}; the denominator must be a positive odd integer.

kronecker_symbol#

Explicit context

func kroneckerSymbol(
    numerator: UniffiExpression,
    denominator: UniffiExpression,
) -> Int64

The Kronecker extension of the Jacobi symbol to all integer denominators.

legendre_symbol#

Explicit context

func legendreSymbol(
    numerator: UniffiExpression,
    prime: UniffiExpression,
) -> Int64

The Legendre symbol; the second argument must be an odd prime.

length#

Expression method

func length() -> UInt64

Number of elements of a finite-set expression.

logical_false#

Explicit context

func logicalFalse() -> UniffiExpression

The Boolean constant false (⊥\bot).

logical_true#

Explicit context

func logicalTrue() -> UniffiExpression

The Boolean constant true (⊤\top).

minimize_logical#

Explicit context

func minimizeLogical(inputExpression: UniffiExpression) -> UniffiExpression

The smaller of the minimum sum-of-products and product-of-sums two-level forms. Within a practical atom bound this is the exact Quine–McCluskey minimum (prime implicants, essential extraction, and Petrick's method on the residual chart); above it, an Espresso-style heuristic returns a good — not provably minimal — cover.

Calling forms

Expression method: UniffiExpression.minimizeLogical

func minimizeLogical() -> UniffiExpression

mobius#

Explicit context

func mobius(argument: UniffiExpression) -> UniffiExpression

Möbius μ(n)∈{−1,0,1}\mu(n) \in \{-1, 0, 1\}; requires a positive integer.

modular_inverse#

Explicit context

func modularInverse(
    value: UniffiExpression,
    modulus: UniffiExpression,
) -> UniffiExpression

Multiplicative inverse of value modulo modulus; errors when gcd⁡(value⁡,modulus⁡)≠1\operatorname{gcd}(\operatorname{value}, \operatorname{modulus}) \ne 1.

modular_power#

Explicit context

func modularPower(
    base: UniffiExpression,
    exponent: UniffiExpression,
    modulus: UniffiExpression,
) -> UniffiExpression

base^exponent mod modulus by square-and-multiply; requires positive modulus and non-negative exponent.

multinomial#

Explicit context

func multinomial(parts: [UniffiExpression]) -> UniffiExpression

Multinomial coefficient (∑parts⁡)!/∏(part⁡i!)(\sum \operatorname{parts})! / \prod (\operatorname{part}_i!); parts must be non-negative integers.

partition_count#

Explicit context

func partitionCount(argument: UniffiExpression) -> UniffiExpression

Number of integer partitions p(n).

pell_solutions#

Explicit context

func pellSolutions(
    radicand: UniffiExpression,
    count: UInt64,
) -> [UniffiExpression]

The first count positive solutions of x2−Dy2=1x^2 - D y^2 = 1, materialised from the fundamental solution by the Pell recurrence and returned as a flat list [x1,y1,x2,y2,…][x_1, y_1, x_2, y_2, \ldots].

real_line#

Explicit context

func realLine() -> UniffiExpression

The set R\mathbb{R}.

rising_factorial#

Explicit context

func risingFactorial(
    value: UniffiExpression,
    order: UniffiExpression,
) -> UniffiExpression

base⁡(base⁡+1)⋯(base⁡+length⁡−1)\operatorname{base}(\operatorname{base}+1)\cdots(\operatorname{base}+\operatorname{length}-1) (the Pochhammer symbol on integers).

set_complement#

Explicit context

func setComplement(
    left: UniffiExpression,
    right: UniffiExpression,
) -> UniffiExpression

The relative complement a∖ba \setminus b.

set_intersection#

Explicit context

func setIntersection(
    left: UniffiExpression,
    right: UniffiExpression,
) -> UniffiExpression

Intersection, computed eagerly where the structural rules allow (interval pairs, finite-set membership filtering; R\mathbb{R} drops, ∅\varnothing absorbs); otherwise the structural set_intersection node.

set_union#

Explicit context

func setUnion(
    left: UniffiExpression,
    right: UniffiExpression,
) -> UniffiExpression

Union, computed eagerly where the structural rules allow (overlapping or touching interval pairs merge; nested unions splice, ∅\varnothing drops, R\mathbb{R} absorbs); otherwise the structural set_union node.

simplify_logical#

Explicit context

func simplifyLogical(inputExpression: UniffiExpression) -> UniffiExpression

Return whichever of the original form, the disjunctive and conjunctive normal forms, and the two minimal two-level forms has the smallest weighted size.

Calling forms

Expression method: UniffiExpression.simplifyLogical

func simplifyLogical() -> UniffiExpression

solve_integers#

Explicit context

func solveIntegers(
    equations: [UniffiExpression],
    unknowns: [String],
    congruences: [UniffiExpression],
    moduli: [UniffiExpression],
    options: UniffiIntegerSolveOptions,
) -> UniffiIntegerSolveReport

Solve equations and linear congruences over the integers, returning the complete exact solution set as tuples in integer parameters, or a typed decline.

solve_linear_diophantine#

Explicit context

func solveLinearDiophantine(
    coefficients: [UniffiExpression],
    constant: UniffiExpression,
) -> [UniffiExpression]

General integer solution of a1x1+…+anxn=ca_1 x_1 + \ldots + a_n x_n = c, returned as the parametric coordinates — one expression per unknown, affine in fresh integer parameter symbols (diophantine_parameter_k) shared across the coordinates so that choosing any integers for the parameters yields a solution tuple. The list is empty when the equation has no integer solution (gcd⁡(ai)∤c\gcd(a_i) \nmid c).

solve_linear_diophantine_system#

Explicit context

func solveLinearDiophantineSystem(
    coefficientMatrix: UniffiMatrix,
    constants: [UniffiExpression],
) -> [UniffiExpression]

General integer solution of the rectangular system Ax=bA x = b, returned as one parametric coordinate expression per column of A.

solve_negative_pell#

Explicit context

func solveNegativePell(radicand: UniffiExpression) -> [UniffiExpression]

Fundamental solution [x, y] of the negative-Pell equation x2−Dy2=−1x^2 - D y^2 = -1 when it is solvable (exactly when the continued fraction of D\sqrt{D} has odd period), and an empty list otherwise.

solve_pell#

Explicit context

func solvePell(radicand: UniffiExpression) -> [UniffiExpression]

Fundamental solution [x, y] of x2−Dy2=1x^2 - D y^2 = 1 for a positive non-square integer D, the smallest positive solution from which all others are generated by the recurrence xk+1=x1xk+Dy1ykx_{k+1} = x_1 x_k + D y_1 y_k, yk+1=x1yk+y1xky_{k+1} = x_1 y_k + y_1 x_k.

stirling_first_signed#

Explicit context

func stirlingFirstSigned(
    upper: UniffiExpression,
    lower: UniffiExpression,
) -> UniffiExpression

Signed Stirling number of the first kind s(n, k).

stirling_second#

Explicit context

func stirlingSecond(
    upper: UniffiExpression,
    lower: UniffiExpression,
) -> UniffiExpression

Stirling number of the second kind S(n, k).

EquationTransformation.condition#

UniffiEquationTransformation method

func condition() -> UniffiExpression

The Boolean condition on the free symbols under which the relation is claimed.

EquationTransformation.equation#

UniffiEquationTransformation method

func equation() -> UniffiExpression

The transformed equation.

EquationTransformation.relation#

UniffiEquationTransformation method

func relation() -> UniffiEquationRelation

Whether the transformed equation is equivalent to its input or only implied by it.

abs#

Explicit context

func abs(argument: UniffiExpression) -> UniffiExpression

Absolute value of x.

absolute_value#

Explicit context

func absoluteValue(argument: UniffiExpression) -> UniffiExpression

Provides the absolute_value operation on this mobile object.

Calling forms

Expression method: UniffiExpression.absoluteValue

func absoluteValue() -> UniffiExpression

arccos#

Explicit context

func arccos(argument: UniffiExpression) -> UniffiExpression

Inverse cosine of x.

arccosh#

Explicit context

func arccosh(argument: UniffiExpression) -> UniffiExpression

Inverse hyperbolic cosine of x.

arccot#

Explicit context

func arccot(argument: UniffiExpression) -> UniffiExpression

Inverse cotangent of x.

arccoth#

Explicit context

func arccoth(argument: UniffiExpression) -> UniffiExpression

Inverse hyperbolic cotangent of x.

arccsc#

Explicit context

func arccsc(argument: UniffiExpression) -> UniffiExpression

Inverse cosecant of x.

arccsch#

Explicit context

func arccsch(argument: UniffiExpression) -> UniffiExpression

Inverse hyperbolic cosecant of x.

arcsec#

Explicit context

func arcsec(argument: UniffiExpression) -> UniffiExpression

Inverse secant of x.

arcsech#

Explicit context

func arcsech(argument: UniffiExpression) -> UniffiExpression

Inverse hyperbolic secant of x.

arcsin#

Explicit context

func arcsin(argument: UniffiExpression) -> UniffiExpression

Inverse sine of x.

arcsinh#

Explicit context

func arcsinh(argument: UniffiExpression) -> UniffiExpression

Inverse hyperbolic sine of x.

arctan#

Explicit context

func arctan(argument: UniffiExpression) -> UniffiExpression

Inverse tangent of x.

arctanh#

Explicit context

func arctanh(argument: UniffiExpression) -> UniffiExpression

Inverse hyperbolic tangent of x.

binomial#

Explicit context

func binomial(
    upper: UniffiExpression,
    lower: UniffiExpression,
) -> UniffiExpression

Binomial coefficient C(n, k).

ceiling#

Explicit context

func ceiling(argument: UniffiExpression) -> UniffiExpression

Least integer greater than or equal to x.

conjugate#

Explicit context

func conjugate(argument: UniffiExpression) -> UniffiExpression

Complex conjugate.

cos#

Explicit context

func cos(argument: UniffiExpression) -> UniffiExpression

Cosine of x.

Calling forms

Expression method: UniffiExpression.cos

func cos() -> UniffiExpression

cosh#

Explicit context

func cosh(argument: UniffiExpression) -> UniffiExpression

Hyperbolic cosine of x.

cot#

Explicit context

func cot(argument: UniffiExpression) -> UniffiExpression

Cotangent of x, the reciprocal of the tangent.

coth#

Explicit context

func coth(argument: UniffiExpression) -> UniffiExpression

Hyperbolic cotangent of x, the reciprocal of the hyperbolic tangent.

csc#

Explicit context

func csc(argument: UniffiExpression) -> UniffiExpression

Cosecant of x, the reciprocal of the sine.

csch#

Explicit context

func csch(argument: UniffiExpression) -> UniffiExpression

Hyperbolic cosecant of x, the reciprocal of the hyperbolic sine.

equal#

Explicit context

func equal(
    left: UniffiExpression,
    right: UniffiExpression,
) -> UniffiExpression

Build the relation left = right without deciding its truth.

Calling forms

Expression method: UniffiExpression.equal

func equal(other: UniffiExpression) -> UniffiExpression

equation#

Explicit context

func equation(
    left: UniffiExpression,
    right: UniffiExpression,
) -> UniffiExpression

Build an immutable equation value without deciding its truth.

Calling forms

Expression method: UniffiExpression.equation

func equation(other: UniffiExpression) -> UniffiExpression

exp#

Explicit context

func exp(argument: UniffiExpression) -> UniffiExpression

The natural exponential.

Calling forms

Expression method: UniffiExpression.exp

func exp() -> UniffiExpression

factorial#

Explicit context

func factorial(argument: UniffiExpression) -> UniffiExpression

Factorial of x, evaluated exactly on nonnegative integers.

floor#

Explicit context

func floor(argument: UniffiExpression) -> UniffiExpression

Greatest integer less than or equal to x.

greater_than#

Explicit context

func greaterThan(
    left: UniffiExpression,
    right: UniffiExpression,
) -> UniffiExpression

Build the relation left > right without deciding its truth.

Calling forms

Expression method: UniffiExpression.greaterThan

func greaterThan(other: UniffiExpression) -> UniffiExpression

greater_than_or_equal#

Explicit context

func greaterThanOrEqual(
    left: UniffiExpression,
    right: UniffiExpression,
) -> UniffiExpression

Build the relation left >= right without deciding its truth.

Calling forms

Expression method: UniffiExpression.greaterThanOrEqual

func greaterThanOrEqual(other: UniffiExpression) -> UniffiExpression

less_than#

Explicit context

func lessThan(
    left: UniffiExpression,
    right: UniffiExpression,
) -> UniffiExpression

Build the relation left < right without deciding its truth.

Calling forms

Expression method: UniffiExpression.lessThan

func lessThan(other: UniffiExpression) -> UniffiExpression

less_than_or_equal#

Explicit context

func lessThanOrEqual(
    left: UniffiExpression,
    right: UniffiExpression,
) -> UniffiExpression

Build the relation left <= right without deciding its truth.

Calling forms

Expression method: UniffiExpression.lessThanOrEqual

func lessThanOrEqual(other: UniffiExpression) -> UniffiExpression

log#

Explicit context

func log(
    argument: UniffiExpression,
    base: UniffiExpression?,
) -> UniffiExpression

Natural logarithm; with base given, log(x)/log(base).

max#

Explicit context

func max(arguments: [UniffiExpression]) -> UniffiExpression

Maximum of the arguments (variadic in Python; a JS array in WASM).

min#

Explicit context

func min(arguments: [UniffiExpression]) -> UniffiExpression

Minimum of the arguments (variadic in Python; a JS array in WASM).

not_equal#

Explicit context

func notEqual(
    left: UniffiExpression,
    right: UniffiExpression,
) -> UniffiExpression

Build the relation left != right without deciding its truth.

Calling forms

Expression method: UniffiExpression.notEqual

func notEqual(other: UniffiExpression) -> UniffiExpression

root#

Explicit context

func root(
    radicand: UniffiExpression,
    index: UniffiExpression,
) -> UniffiExpression

Principal n-th root, stored as x^(1/n).

sec#

Explicit context

func sec(argument: UniffiExpression) -> UniffiExpression

Secant of x, the reciprocal of the cosine.

sech#

Explicit context

func sech(argument: UniffiExpression) -> UniffiExpression

Hyperbolic secant of x, the reciprocal of the hyperbolic cosine.

sin#

Explicit context

func sin(argument: UniffiExpression) -> UniffiExpression

Sine of x.

Calling forms

Expression method: UniffiExpression.sin

func sin() -> UniffiExpression

sinh#

Explicit context

func sinh(argument: UniffiExpression) -> UniffiExpression

Hyperbolic sine of x.

sqrt#

Explicit context

func sqrt(argument: UniffiExpression) -> UniffiExpression

Principal square root, stored as x^(1/2).

Calling forms

Expression method: UniffiExpression.sqrt

func sqrt() -> UniffiExpression

tan#

Explicit context

func tan(argument: UniffiExpression) -> UniffiExpression

Tangent of x.

tanh#

Explicit context

func tanh(argument: UniffiExpression) -> UniffiExpression

Hyperbolic tangent of x.

transform_equation#

Explicit context

func transformEquation(
    left: UniffiExpression,
    right: UniffiExpression,
    operation: UniffiEquationOperation,
) -> UniffiEquationTransformation

Apply one arithmetic operation to an equation, reporting how the result relates to it.

AffineSystemFamily.direction_vectors#

UniffiAffineSystemFamily method

func directionVectors() -> [UniffiAffineSystemDirection]

Getter on affine_system_family: an independent basis of the homogeneous solution space, whose size is the dimension of the family.

AffineSystemFamily.particular_solution#

UniffiAffineSystemFamily method

func particularSolution() -> [UniffiExpression]

Getter on affine_system_family: one exact solution of the system, aligned with variables.

ConditionalSystemBranch.condition#

UniffiConditionalSystemBranch method

func condition() -> UniffiExpression

Getter on conditional_system_branch: the exact condition selecting this branch.

ConditionalSystemBranch.solution#

UniffiConditionalSystemBranch method

func solution() -> UniffiPolynomialSystemSolution

Getter on conditional_system_branch: the complete result established under condition.

CriticalPoint.classification#

UniffiCriticalPoint method

func classification() -> UniffiExtremumClassification

The verdict string of a critical point: "local_minimum", "local_maximum", "saddle_point", or "inconclusive".

CriticalPoint.multiplier_values#

UniffiCriticalPoint method

func multiplierValues() -> [UniffiExpression]

The solved values of those multipliers, in the same order as multiplier_variables.

CriticalPoint.multiplier_variables#

UniffiCriticalPoint method

func multiplierVariables() -> [String]

The names of the introduced Lagrange / KKT multipliers at a constrained critical point (empty for the unconstrained case).

CriticalPoint.values#

UniffiCriticalPoint method

func values() -> [UniffiExpression]

Getter on system_assignment: the assigned value expressions, aligned with variables.

CriticalPoint.variables#

UniffiCriticalPoint method

func variables() -> [String]

Getter on system_assignment: the unknown names, in order.

EquationGuardedBranch.certified_set#

UniffiEquationGuardedBranch method

func certifiedSet() -> UniffiExpression

The exact solution set certified by this report or guarded branch.

EquationGuardedBranch.guard#

UniffiEquationGuardedBranch method

func guard() -> UniffiExpression

The exact parameter condition selecting this guarded branch.

EquationSolveReport.certified_set#

UniffiEquationSolveReport method

func certifiedSet() -> UniffiExpression

The exact solution set certified by this report or guarded branch.

EquationSolveReport.complete#

UniffiEquationSolveReport method

func complete() -> Bool

Whether exact replay proved that the certified result is exhaustive.

EquationSolveReport.diagnostics#

UniffiEquationSolveReport method

func diagnostics() -> [UniffiSolveReportDiagnostic]

Non-impossibility reasons that prevented a stronger report.

EquationSolveReport.guarded_branches#

UniffiEquationSolveReport method

func guardedBranches() -> [UniffiEquationGuardedBranch]

The exact guarded strata carried by this report.

EquationSolveReport.proof_summary#

UniffiEquationSolveReport method

func proofSummary() -> UniffiSolveProofSummary

The root checked proof rule, without exposing the internal proof graph.

EquationSolveReport.real_root_count_certificate#

UniffiEquationSolveReport method

func realRootCountCertificate() -> UInt64?

Exact real-root count when this complete report established a finite real root set.

EquationSolveReport.requested_domain#

UniffiEquationSolveReport method

func requestedDomain() -> UniffiSolveRequestedDomain

The ambient domain in which the report was checked.

EquationSolveReport.status#

UniffiEquationSolveReport method

func status() -> UniffiSolveReportStatus

The checked report status: complete, partial, or declined.

EquationSolveReport.unique_root_intervals#

UniffiEquationSolveReport method

func uniqueRootIntervals() -> [UniffiExpression]

Exact singleton intervals for named roots whose real-root count was certified.

EquationSolveReport.unresolved_condition#

UniffiEquationSolveReport method

func unresolvedCondition() -> UniffiExpression?

The retained source-condition residue, absent only after an exhaustive proof.

FirstOrderNonlinearParametricSolution.coordinate#

UniffiFirstOrderNonlinearParametricSolution method

func coordinate() -> UniffiExpression

The independent coordinate as a function of the parameter.

FirstOrderNonlinearParametricSolution.generated_constants#

UniffiFirstOrderNonlinearParametricSolution method

func generatedConstants() -> [UniffiExpression]

The integration constants of this parameterized branch.

FirstOrderNonlinearParametricSolution.parameter#

UniffiFirstOrderNonlinearParametricSolution method

func parameter() -> UniffiExpression

The exact parameter symbol for this parameterized branch.

FirstOrderNonlinearParametricSolution.value#

UniffiFirstOrderNonlinearParametricSolution method

func value() -> UniffiExpression

The dependent value as a function of the parameter.

FirstOrderNonlinearSolutionAnalysis.parametric_solutions#

UniffiFirstOrderNonlinearSolutionAnalysis method

func parametricSolutions() -> [UniffiFirstOrderNonlinearParametricSolution]

Every certified parameterized branch.

FirstOrderNonlinearSolutionAnalysis.regular_family#

UniffiFirstOrderNonlinearSolutionAnalysis method

func regularFamily() -> UniffiFirstOrderNonlinearSolutionBranch?

The certified regular one-parameter family, when one was proved.

FirstOrderNonlinearSolutionAnalysis.singular_solutions#

UniffiFirstOrderNonlinearSolutionAnalysis method

func singularSolutions() -> [UniffiFirstOrderNonlinearSolutionBranch]

Every certified singular or equilibrium branch outside the regular family.

FirstOrderNonlinearSolutionBranch.expression#

UniffiFirstOrderNonlinearSolutionBranch method

func expression() -> UniffiExpression

The branch value or its implicit residual relation.

FirstOrderNonlinearSolutionBranch.form#

UniffiFirstOrderNonlinearSolutionBranch method

func form() -> UniffiOrdinaryDifferentialEquationSolutionForm

Whether this branch gives a value or an implicit relation read as zero.

FirstOrderNonlinearSolutionBranch.generated_constants#

UniffiFirstOrderNonlinearSolutionBranch method

func generatedConstants() -> [UniffiExpression]

The free constants generated for this branch.

LinearDifferentialOperator.coefficients#

UniffiLinearDifferentialOperator method

func coefficients() -> [UniffiExpression]

Coefficients in ascending derivative order.

LinearDifferentialOperator.forcing#

UniffiLinearDifferentialOperator method

func forcing() -> UniffiExpression

The forcing in L[y] = forcing.

LinearDifferentialOperator.order#

UniffiLinearDifferentialOperator method

func order() -> UInt64

The order of this differential operator.

LinearDifferentialOperator.restrictions#

UniffiLinearDifferentialOperator method

func restrictions() -> [UniffiExpression]

Denominators required to remain nonzero on the operator chart.

OptimizationOutcome.complete#

UniffiOptimizationOutcome method

func complete() -> Bool

Getter on polynomial_system_solution: whether the solver certified it found every solution.

OptimizationOutcome.points#

UniffiOptimizationOutcome method

func points() -> [UniffiCriticalPoint]

The list of critical_point objects in an optimization_outcome (WASM).

OptimizationOutcome.verdict#

UniffiOptimizationOutcome method

func verdict() -> UniffiOptimizationVerdict

The optimization result classification.

OrdinaryDifferentialEquationPointSymmetry.horizontal_component#

UniffiOrdinaryDifferentialEquationPointSymmetry method

func horizontalComponent() -> UniffiExpression

The horizontal component of the verified infinitesimal generator.

OrdinaryDifferentialEquationPointSymmetry.vertical_component#

UniffiOrdinaryDifferentialEquationPointSymmetry method

func verticalComponent() -> UniffiExpression

The vertical component of the verified infinitesimal generator.

OrdinaryDifferentialEquationPointSymmetrySearch.decline#

UniffiOrdinaryDifferentialEquationPointSymmetrySearch method

func decline() -> UniffiOrdinaryDifferentialEquationPointSymmetrySearchDecline?

The typed reason no symmetry was proved, when the bounded search declined.

OrdinaryDifferentialEquationPointSymmetrySearch.symmetries#

UniffiOrdinaryDifferentialEquationPointSymmetrySearch method

func symmetries() -> [UniffiOrdinaryDifferentialEquationPointSymmetry]

Every independently verified generator found within the fixed search budget.

OrdinaryDifferentialEquationSeries.expansion_point#

UniffiOrdinaryDifferentialEquationSeries method

func expansionPoint() -> UniffiExpression

The expansion point.

OrdinaryDifferentialEquationSeries.initial_coefficients#

UniffiOrdinaryDifferentialEquationSeries method

func initialCoefficients() -> [UniffiExpression]

Normalized Taylor coefficients from the supplied initial derivative jet.

OrdinaryDifferentialEquationSeries.operator#

UniffiOrdinaryDifferentialEquationSeries method

func operator() -> UniffiLinearDifferentialOperator

The normalized operator defining this local problem.

OrdinaryDifferentialEquationSeries.proof_status#

UniffiOrdinaryDifferentialEquationSeries method

func proofStatus() -> UniffiOrdinaryDifferentialEquationSeriesProofStatus

The exact proof status of this series.

OrdinaryDifferentialEquationSeries.recurrence#

UniffiOrdinaryDifferentialEquationSeries method

func recurrence() -> UniffiOrdinaryDifferentialEquationSeriesRecurrence

The all-index recurrence proved by formal coefficient comparison.

OrdinaryDifferentialEquationSeriesRecurrence.forcing_coefficients#

UniffiOrdinaryDifferentialEquationSeriesRecurrence method

func forcingCoefficients() -> [UniffiExpression]

Shifted forcing coefficients.

OrdinaryDifferentialEquationSeriesRecurrence.index_start#

UniffiOrdinaryDifferentialEquationSeriesRecurrence method

func indexStart() -> UInt64

The first nonnegative recurrence index.

OrdinaryDifferentialEquationSeriesRecurrence.operator_coefficient_series#

UniffiOrdinaryDifferentialEquationSeriesRecurrence method

func operatorCoefficientSeries() -> [UniffiExpression]

Concatenated shifted coefficient series in derivative-order sequence.

OrdinaryDifferentialEquationSeriesRecurrence.operator_coefficient_series_lengths#

UniffiOrdinaryDifferentialEquationSeriesRecurrence method

func operatorCoefficientSeriesLengths() -> [UInt64]

The length of each derivative-order coefficient series in the concatenation.

OrdinaryDifferentialEquationSeriesRecurrence.order#

UniffiOrdinaryDifferentialEquationSeriesRecurrence method

func order() -> UInt64

The order of the operator defining this recurrence.

OrdinaryDifferentialEquationSolveResult.decline#

UniffiOrdinaryDifferentialEquationSolveResult method

func decline() -> UniffiOrdinaryDifferentialEquationSolveDecline?

The typed reason no certified candidate was produced.

OrdinaryDifferentialEquationSolveResult.form#

UniffiOrdinaryDifferentialEquationSolveResult method

func form() -> UniffiOrdinaryDifferentialEquationSolutionForm?

Whether the solution is the value of the unknown or a relation read as zero.

OrdinaryDifferentialEquationSolveResult.frequency_domain_equation#

UniffiOrdinaryDifferentialEquationSolveResult method

func frequencyDomainEquation() -> UniffiExpression?

The frequency-domain equation of a Laplace transform solution, read as zero.

OrdinaryDifferentialEquationSolveResult.generality#

UniffiOrdinaryDifferentialEquationSolveResult method

func generality() -> UniffiOrdinaryDifferentialEquationGeneralityVerdict?

The rank decision behind a complete-family claim, when the request required one.

OrdinaryDifferentialEquationSolveResult.generated_constants#

UniffiOrdinaryDifferentialEquationSolveResult method

func generatedConstants() -> [UniffiExpression]

Exactly the constants the solution treats as free.

OrdinaryDifferentialEquationSolveResult.image#

UniffiOrdinaryDifferentialEquationSolveResult method

func image() -> UniffiExpression?

The image of the unknown a Laplace transform solution solved for.

OrdinaryDifferentialEquationSolveResult.method#

UniffiOrdinaryDifferentialEquationSolveResult method

func method() -> UniffiOrdinaryDifferentialEquationMethod

The method the request actually ran.

OrdinaryDifferentialEquationSolveResult.solution#

UniffiOrdinaryDifferentialEquationSolveResult method

func solution() -> UniffiExpression?

The certified solution, which no declined request carries.

OrdinaryDifferentialEquationSolveResult.verdict#

UniffiOrdinaryDifferentialEquationSolveResult method

func verdict() -> UniffiOrdinaryDifferentialEquationSolveVerdict

Whether the request was solved or declined.

OrdinaryDifferentialEquationSolveResult.verification#

UniffiOrdinaryDifferentialEquationSolveResult method

func verification() -> UniffiOrdinaryDifferentialEquationVerificationVerdict?

The independent verifier's decision on the candidate, when verification ran.

OrdinaryDifferentialEquationSystemSolveResult.components#

UniffiOrdinaryDifferentialEquationSystemSolveResult method

func components() -> [UniffiExpression]

One explicit value per declared unknown, in declaration order, when solved.

OrdinaryDifferentialEquationSystemSolveResult.decline#

UniffiOrdinaryDifferentialEquationSystemSolveResult method

func decline() -> UniffiOrdinaryDifferentialEquationSystemSolveDecline?

The typed reason no certified assignment was produced.

OrdinaryDifferentialEquationSystemSolveResult.generality#

UniffiOrdinaryDifferentialEquationSystemSolveResult method

func generality() -> UniffiOrdinaryDifferentialEquationGeneralityVerdict?

The rank decision on the constants-to-initial-jet map, when verification ran.

OrdinaryDifferentialEquationSystemSolveResult.generated_constants#

UniffiOrdinaryDifferentialEquationSystemSolveResult method

func generatedConstants() -> [UniffiExpression]

Exactly the constants the assignment treats as free.

OrdinaryDifferentialEquationSystemSolveResult.method#

UniffiOrdinaryDifferentialEquationSystemSolveResult method

func method() -> UniffiOrdinaryDifferentialEquationSystemMethod

The method the system request actually ran.

OrdinaryDifferentialEquationSystemSolveResult.route#

UniffiOrdinaryDifferentialEquationSystemSolveResult method

func route() -> UniffiOrdinaryDifferentialEquationSystemRoute?

The route the certified assignment came from.

OrdinaryDifferentialEquationSystemSolveResult.verdict#

UniffiOrdinaryDifferentialEquationSystemSolveResult method

func verdict() -> UniffiOrdinaryDifferentialEquationSolveVerdict

Whether the system was solved or declined.

OrdinaryDifferentialEquationSystemSolveResult.verification#

UniffiOrdinaryDifferentialEquationSystemSolveResult method

func verification() -> UniffiOrdinaryDifferentialEquationVerificationVerdict?

The independent verifier's decision on the assignment, when verification ran.

OrdinaryDifferentialEquationSystemVerificationReport.generality#

UniffiOrdinaryDifferentialEquationSystemVerificationReport method

func generality() -> UniffiOrdinaryDifferentialEquationGeneralityVerdict

The rank decision on the map from the supplied constants to the initial jet.

OrdinaryDifferentialEquationSystemVerificationReport.required_rank#

UniffiOrdinaryDifferentialEquationSystemVerificationReport method

func requiredRank() -> UInt64

The dimension a complete family of the system must span.

OrdinaryDifferentialEquationSystemVerificationReport.verdict#

UniffiOrdinaryDifferentialEquationSystemVerificationReport method

func verdict() -> UniffiOrdinaryDifferentialEquationVerificationVerdict

The decision on every equation residual and every datum of the supplied assignment.

PartialDifferentialEquationArbitraryFunction.arity#

UniffiPartialDifferentialEquationArbitraryFunction method

func arity() -> UInt64

The recorded and validated function arity.

PartialDifferentialEquationArbitraryFunction.name#

UniffiPartialDifferentialEquationArbitraryFunction method

func name() -> String

The collision-free allocated function name.

PartialDifferentialEquationArbitraryFunction.summary#

UniffiPartialDifferentialEquationArbitraryFunction method

func summary() -> String

A one-line summary naming this record's decisive fields; supporting evidence is reported by verdict or by a bounded prefix, and every accessor keeps the full data.

PartialDifferentialEquationCanonicalizationResult.canonicalized#

UniffiPartialDifferentialEquationCanonicalizationResult method

func canonicalized() -> Bool

Whether verified canonical coordinates were constructed.

PartialDifferentialEquationCanonicalizationResult.decline#

UniffiPartialDifferentialEquationCanonicalizationResult method

func decline() -> UniffiPartialDifferentialEquationCanonicalizationDecline?

The exact reason automatic canonicalization declined.

PartialDifferentialEquationCanonicalizationResult.principal_form#

UniffiPartialDifferentialEquationCanonicalizationResult method

func principalForm() -> UniffiPartialDifferentialEquationCanonicalPrincipalForm?

The exact canonical principal form that was reached.

PartialDifferentialEquationCanonicalizationResult.summary#

UniffiPartialDifferentialEquationCanonicalizationResult method

func summary() -> String

A one-line summary naming this record's decisive fields; supporting evidence is reported by verdict or by a bounded prefix, and every accessor keeps the full data.

PartialDifferentialEquationCanonicalizationResult.transformation#

UniffiPartialDifferentialEquationCanonicalizationResult method

func transformation() -> UniffiPartialDifferentialEquationTransformationResult?

The verified coordinate transformation of a successful canonicalization.

PartialDifferentialEquationCanonicalizationResult.transformation_decline#

UniffiPartialDifferentialEquationCanonicalizationResult method

func transformationDecline() -> UniffiPartialDifferentialEquationTransformationDecline?

The underlying coordinate-transformation decline, when one caused the decline.

PartialDifferentialEquationClassification.coefficient_data#

UniffiPartialDifferentialEquationClassification method

func coefficientData() -> UniffiPartialDifferentialEquationCoefficientData

The exact affine coefficient data extracted from the governing residual.

PartialDifferentialEquationClassification.linearity#

UniffiPartialDifferentialEquationClassification method

func linearity() -> UniffiPartialDifferentialEquationLinearity

The most-specific exact linearity class.

PartialDifferentialEquationClassification.method_candidates#

UniffiPartialDifferentialEquationClassification method

func methodCandidates() -> [UniffiPartialDifferentialEquationMethodCandidate]

The advisory methods in deterministic preference order.

PartialDifferentialEquationClassification.order#

UniffiPartialDifferentialEquationClassification method

func order() -> UInt64

The exact highest derivative order.

PartialDifferentialEquationClassification.second_order_principal_part#

UniffiPartialDifferentialEquationClassification method

func secondOrderPrincipalPart() -> UniffiPartialDifferentialEquationPrincipalPart?

The exact second-order principal metadata, when the equation has one.

PartialDifferentialEquationClassification.summary#

UniffiPartialDifferentialEquationClassification method

func summary() -> String

A one-line summary naming this record's decisive fields; supporting evidence is reported by verdict or by a bounded prefix, and every accessor keeps the full data.

PartialDifferentialEquationCoefficientData.full_coefficients#

UniffiPartialDifferentialEquationCoefficientData method

func fullCoefficients() -> [UniffiPartialDifferentialEquationJetCoefficient]?

Every jet coefficient, when the equation is exactly linear.

PartialDifferentialEquationCoefficientData.highest_order_coefficients#

UniffiPartialDifferentialEquationCoefficientData method

func highestOrderCoefficients() -> [UniffiPartialDifferentialEquationJetCoefficient]?

The highest-order jet coefficients, when the equation is affine in them.

PartialDifferentialEquationCoefficientData.homogeneous#

UniffiPartialDifferentialEquationCoefficientData method

func homogeneous() -> Bool?

Whether the equation was proved homogeneous, when that statement is meaningful.

PartialDifferentialEquationCoefficientData.remainder#

UniffiPartialDifferentialEquationCoefficientData method

func remainder() -> UniffiExpression?

The exact jet-free remainder term, when one was extracted.

PartialDifferentialEquationCoefficientData.summary#

UniffiPartialDifferentialEquationCoefficientData method

func summary() -> String

A one-line summary naming this record's decisive fields; supporting evidence is reported by verdict or by a bounded prefix, and every accessor keeps the full data.

PartialDifferentialEquationCoordinateChange.forward_coordinates#

UniffiPartialDifferentialEquationCoordinateChange method

func forwardCoordinates() -> [UniffiExpression]

The ordered source-to-target coordinate expressions.

PartialDifferentialEquationCoordinateChange.inverse_coordinates#

UniffiPartialDifferentialEquationCoordinateChange method

func inverseCoordinates() -> [UniffiExpression]

The ordered target-to-source coordinate expressions.

PartialDifferentialEquationCoordinateChange.jacobian#

UniffiPartialDifferentialEquationCoordinateChange method

func jacobian() -> UniffiExpression

The exact forward-map Jacobian determinant.

PartialDifferentialEquationCoordinateChange.serialize_object#

UniffiPartialDifferentialEquationCoordinateChange method

func serializeObject() -> String

Serialize this coordinate change in the versioned canonical object grammar.

PartialDifferentialEquationCoordinateChange.source_variables#

UniffiPartialDifferentialEquationCoordinateChange method

func sourceVariables() -> [String]

The ordered source coordinate names.

PartialDifferentialEquationCoordinateChange.summary#

UniffiPartialDifferentialEquationCoordinateChange method

func summary() -> String

A one-line summary naming this record's decisive fields; supporting evidence is reported by verdict or by a bounded prefix, and every accessor keeps the full data.

PartialDifferentialEquationCoordinateChange.target_dependent_function#

UniffiPartialDifferentialEquationCoordinateChange method

func targetDependentFunction() -> String

The target unknown-function name.

PartialDifferentialEquationCoordinateChange.target_variables#

UniffiPartialDifferentialEquationCoordinateChange method

func targetVariables() -> [String]

The ordered target coordinate names.

PartialDifferentialEquationJetCoefficient.coefficient#

UniffiPartialDifferentialEquationJetCoefficient method

func coefficient() -> UniffiExpression

The exact coefficient expression.

PartialDifferentialEquationJetCoefficient.summary#

UniffiPartialDifferentialEquationJetCoefficient method

func summary() -> String

A one-line summary naming this record's decisive fields; supporting evidence is reported by verdict or by a bounded prefix, and every accessor keeps the full data.

PartialDifferentialEquationMethodCandidate.method#

UniffiPartialDifferentialEquationMethodCandidate method

func method() -> UniffiPartialDifferentialEquationMethod

The stable advisory method name.

PartialDifferentialEquationMethodCandidate.proof_obligations#

UniffiPartialDifferentialEquationMethodCandidate method

func proofObligations() -> [UniffiPartialDifferentialEquationProofObligation]

The exact obligations this method must discharge before it may solve.

PartialDifferentialEquationMethodCandidate.summary#

UniffiPartialDifferentialEquationMethodCandidate method

func summary() -> String

A one-line summary naming this record's decisive fields; supporting evidence is reported by verdict or by a bounded prefix, and every accessor keeps the full data.

PartialDifferentialEquationPointSymmetryAction.admits_additive_solution_symmetry#

UniffiPartialDifferentialEquationPointSymmetryAction method

func admitsAdditiveSolutionSymmetry() -> Bool

Whether the action adds an arbitrary solution by linear superposition.

PartialDifferentialEquationPointSymmetryAction.amplitude#

UniffiPartialDifferentialEquationPointSymmetryAction method

func amplitude() -> UniffiExpression?

The amplitude multiplying the transformed seed.

PartialDifferentialEquationPointSymmetryAction.applied_to_seed#

UniffiPartialDifferentialEquationPointSymmetryAction method

func appliedToSeed(seed: UniffiUndefinedFunction) -> UniffiExpression

The transformed seed solution under the action.

PartialDifferentialEquationPointSymmetryAction.applied_to_seed_with_additive_solution#

UniffiPartialDifferentialEquationPointSymmetryAction method

func appliedToSeedWithAdditiveSolution(
    seed: UniffiUndefinedFunction,
    additiveSolution: UniffiUndefinedFunction,
) -> UniffiExpression

The transformed seed solution plus an added solution under the action.

PartialDifferentialEquationPointSymmetryAction.decline#

UniffiPartialDifferentialEquationPointSymmetryAction method

func decline() -> UniffiPartialDifferentialEquationSymmetryActionDecline?

The typed reason the action was not constructed.

PartialDifferentialEquationPointSymmetryAction.intertwining#

UniffiPartialDifferentialEquationPointSymmetryAction method

func intertwining() -> UniffiPartialDifferentialEquationVerificationVerdict?

The exact decision on the intertwining identity.

PartialDifferentialEquationPointSymmetryAction.invertibility#

UniffiPartialDifferentialEquationPointSymmetryAction method

func invertibility() -> UniffiPartialDifferentialEquationVerificationVerdict?

The exact decision that the coordinate map is invertible on its chart.

PartialDifferentialEquationPointSymmetryAction.multiplier#

UniffiPartialDifferentialEquationPointSymmetryAction method

func multiplier() -> UniffiExpression?

The multiplier of the intertwining identity.

PartialDifferentialEquationPointSymmetryAction.outstanding_obligations#

UniffiPartialDifferentialEquationPointSymmetryAction method

func outstandingObligations() -> [UniffiPartialDifferentialEquationSymmetryObligation]

The claims the action explicitly does not make.

PartialDifferentialEquationPointSymmetryAction.parameters#

UniffiPartialDifferentialEquationPointSymmetryAction method

func parameters() -> [UniffiExpression]

The group parameters the closed forms depend on.

PartialDifferentialEquationPointSymmetryAction.point_symmetry_decline#

UniffiPartialDifferentialEquationPointSymmetryAction method

func pointSymmetryDecline() -> UniffiPartialDifferentialEquationPointSymmetryDecline?

The reason the underlying point-symmetry algebra was not derived, when it was not.

PartialDifferentialEquationPointSymmetryAction.summary#

UniffiPartialDifferentialEquationPointSymmetryAction method

func summary() -> String

A one-line summary naming this record's decisive fields; supporting evidence is reported by verdict or by a bounded prefix, and every accessor keeps the full data.

PartialDifferentialEquationPointSymmetryAction.transformed_coordinates#

UniffiPartialDifferentialEquationPointSymmetryAction method

func transformedCoordinates() -> [UniffiExpression]

The coordinates at which a seed solution is evaluated.

PartialDifferentialEquationPointSymmetryAlgebra.admits_additive_solution_symmetry#

UniffiPartialDifferentialEquationPointSymmetryAlgebra method

func admitsAdditiveSolutionSymmetry() -> Bool

Whether adding any solution of the linear homogeneous equation is also a symmetry.

PartialDifferentialEquationPointSymmetryAlgebra.basis#

UniffiPartialDifferentialEquationPointSymmetryAlgebra method

func basis() -> [UniffiPartialDifferentialEquationPointSymmetryGenerator]

The independently verified basis generators, one per parameter.

PartialDifferentialEquationPointSymmetryAlgebra.decline#

UniffiPartialDifferentialEquationPointSymmetryAlgebra method

func decline() -> UniffiPartialDifferentialEquationPointSymmetryDecline?

The typed reason the algebra was not derived.

PartialDifferentialEquationPointSymmetryAlgebra.determining_equations#

UniffiPartialDifferentialEquationPointSymmetryAlgebra method

func determiningEquations() -> [UniffiExpression]

The determining equations exactly as derived, before any reduction.

PartialDifferentialEquationPointSymmetryAlgebra.general_generator#

UniffiPartialDifferentialEquationPointSymmetryAlgebra method

func generalGenerator() -> UniffiPartialDifferentialEquationPointSymmetryGenerator?

The general generator, a combination of the basis through the parameters.

PartialDifferentialEquationPointSymmetryAlgebra.outstanding_obligations#

UniffiPartialDifferentialEquationPointSymmetryAlgebra method

func outstandingObligations() -> [UniffiPartialDifferentialEquationSymmetryObligation]

The claims the algebra explicitly does not make.

PartialDifferentialEquationPointSymmetryAlgebra.parameters#

UniffiPartialDifferentialEquationPointSymmetryAlgebra method

func parameters() -> [UniffiExpression]

The constants of the general generator, one per basis generator.

PartialDifferentialEquationPointSymmetryAlgebra.summary#

UniffiPartialDifferentialEquationPointSymmetryAlgebra method

func summary() -> String

A one-line summary naming this record's decisive fields; supporting evidence is reported by verdict or by a bounded prefix, and every accessor keeps the full data.

PartialDifferentialEquationPointSymmetryGenerator.coordinate_infinitesimals#

UniffiPartialDifferentialEquationPointSymmetryGenerator method

func coordinateInfinitesimals() -> [UniffiExpression]

The coordinate infinitesimals in the problem's independent-variable order.

PartialDifferentialEquationPointSymmetryGenerator.dependent_infinitesimal#

UniffiPartialDifferentialEquationPointSymmetryGenerator method

func dependentInfinitesimal() -> UniffiExpression

The dependent infinitesimal of the generator.

PartialDifferentialEquationPointSymmetryGenerator.summary#

UniffiPartialDifferentialEquationPointSymmetryGenerator method

func summary() -> String

A one-line summary naming this record's decisive fields; supporting evidence is reported by verdict or by a bounded prefix, and every accessor keeps the full data.

PartialDifferentialEquationPrincipalCoefficient.coefficient#

UniffiPartialDifferentialEquationPrincipalCoefficient method

func coefficient() -> UniffiExpression

The raw coefficient expression, before mixed terms are halved.

PartialDifferentialEquationPrincipalCoefficient.summary#

UniffiPartialDifferentialEquationPrincipalCoefficient method

func summary() -> String

A one-line summary naming this record's decisive fields; supporting evidence is reported by verdict or by a bounded prefix, and every accessor keeps the full data.

PartialDifferentialEquationPrincipalPart.derivative_coefficients#

UniffiPartialDifferentialEquationPrincipalPart method

func derivativeCoefficients() -> [UniffiPartialDifferentialEquationPrincipalCoefficient]

The raw mixed-derivative coefficients, before symmetrization halves them.

PartialDifferentialEquationPrincipalPart.matrix#

UniffiPartialDifferentialEquationPrincipalPart method

func matrix() -> UniffiMatrix

The symmetric principal matrix whose quadratic form is the exact principal symbol.

PartialDifferentialEquationPrincipalPart.summary#

UniffiPartialDifferentialEquationPrincipalPart method

func summary() -> String

A one-line summary naming this record's decisive fields; supporting evidence is reported by verdict or by a bounded prefix, and every accessor keeps the full data.

PartialDifferentialEquationProblem.boundary_conditions#

UniffiPartialDifferentialEquationProblem method

func boundaryConditions() -> [UniffiExpression]

The boundary-condition residuals in insertion order.

PartialDifferentialEquationProblem.dependent_function#

UniffiPartialDifferentialEquationProblem method

func dependentFunction() -> String

The declared dependent-function name.

PartialDifferentialEquationProblem.equation#

UniffiPartialDifferentialEquationProblem method

func equation() -> UniffiExpression

The governing residual, interpreted as equal to zero.

PartialDifferentialEquationProblem.independent_variables#

UniffiPartialDifferentialEquationProblem method

func independentVariables() -> [String]

The independent variables in their semantic declared order.

PartialDifferentialEquationProblem.initial_conditions#

UniffiPartialDifferentialEquationProblem method

func initialConditions() -> [UniffiExpression]

The initial-condition residuals in insertion order.

PartialDifferentialEquationProblem.serialize_object#

UniffiPartialDifferentialEquationProblem method

func serializeObject() -> String

Serialize this problem in the versioned canonical object grammar.

PartialDifferentialEquationProblem.to_latex#

UniffiPartialDifferentialEquationProblem method

func toLatex() -> String

Render this problem as LaTeX, as a system when it carries conditions.

PartialDifferentialEquationSecondOrderClassification.cases#

UniffiPartialDifferentialEquationSecondOrderClassification method

func cases() -> [UniffiPartialDifferentialEquationSecondOrderTypeCase]

The complete exact case table, when the verdict is conditional.

PartialDifferentialEquationSecondOrderClassification.decline#

UniffiPartialDifferentialEquationSecondOrderClassification method

func decline() -> UniffiPartialDifferentialEquationSecondOrderClassificationDecline?

The exact reason an unknown analysis could not be completed.

PartialDifferentialEquationSecondOrderClassification.discriminant#

UniffiPartialDifferentialEquationSecondOrderClassification method

func discriminant() -> UniffiExpression

The exact discriminant b^2 - a*c of the symmetric principal matrix.

PartialDifferentialEquationSecondOrderClassification.equation_type#

UniffiPartialDifferentialEquationSecondOrderClassification method

func equationType() -> UniffiPartialDifferentialEquationSecondOrderType?

The single proved classical type, when the verdict is definite.

PartialDifferentialEquationSecondOrderClassification.principal_matrix#

UniffiPartialDifferentialEquationSecondOrderClassification method

func principalMatrix() -> UniffiMatrix

The frozen symmetric principal matrix this analysis classified.

PartialDifferentialEquationSecondOrderClassification.proof_obligations#

UniffiPartialDifferentialEquationSecondOrderClassification method

func proofObligations() -> [UniffiPartialDifferentialEquationProofObligation]

The obligations a downstream canonical-coordinate route must discharge.

PartialDifferentialEquationSecondOrderClassification.summary#

UniffiPartialDifferentialEquationSecondOrderClassification method

func summary() -> String

A one-line summary naming this record's decisive fields; supporting evidence is reported by verdict or by a bounded prefix, and every accessor keeps the full data.

PartialDifferentialEquationSecondOrderClassification.verdict#

UniffiPartialDifferentialEquationSecondOrderClassification method

func verdict() -> UniffiPartialDifferentialEquationSecondOrderTypeVerdict

Whether one type, a complete case table, or neither was proved.

PartialDifferentialEquationSecondOrderTypeCase.condition#

UniffiPartialDifferentialEquationSecondOrderTypeCase method

func condition() -> UniffiAssumptionProposition

The exact condition under which this case's classical type holds.

PartialDifferentialEquationSecondOrderTypeCase.equation_type#

UniffiPartialDifferentialEquationSecondOrderTypeCase method

func equationType() -> UniffiPartialDifferentialEquationSecondOrderType

The classical type proved under this case's condition.

PartialDifferentialEquationSecondOrderTypeCase.summary#

UniffiPartialDifferentialEquationSecondOrderTypeCase method

func summary() -> String

A one-line summary naming this record's decisive fields; supporting evidence is reported by verdict or by a bounded prefix, and every accessor keeps the full data.

PartialDifferentialEquationSeparatedEquation.independent_variable_name#

UniffiPartialDifferentialEquationSeparatedEquation method

func independentVariableName() -> String

The name of this equation's independent variable.

PartialDifferentialEquationSeparatedEquation.residual#

UniffiPartialDifferentialEquationSeparatedEquation method

func residual() -> UniffiExpression

The exact residual of this one-variable ordinary differential equation.

PartialDifferentialEquationSeparatedEquation.summary#

UniffiPartialDifferentialEquationSeparatedEquation method

func summary() -> String

A one-line summary naming this record's decisive fields; supporting evidence is reported by verdict or by a bounded prefix, and every accessor keeps the full data.

PartialDifferentialEquationSeparationResult.first_equation#

UniffiPartialDifferentialEquationSeparationResult method

func firstEquation() -> UniffiPartialDifferentialEquationSeparatedEquation

The first exact one-variable ordinary differential equation.

PartialDifferentialEquationSeparationResult.reconstruction#

UniffiPartialDifferentialEquationSeparationResult method

func reconstruction() -> UniffiExpression

The exact reconstruction expression for the separated factors.

PartialDifferentialEquationSeparationResult.second_equation#

UniffiPartialDifferentialEquationSeparationResult method

func secondEquation() -> UniffiPartialDifferentialEquationSeparatedEquation

The second exact one-variable ordinary differential equation.

PartialDifferentialEquationSeparationResult.separation_constant#

UniffiPartialDifferentialEquationSeparationResult method

func separationConstant() -> UniffiExpression

The fresh exact separation constant.

PartialDifferentialEquationSeparationResult.summary#

UniffiPartialDifferentialEquationSeparationResult method

func summary() -> String

A one-line summary naming this record's decisive fields; supporting evidence is reported by verdict or by a bounded prefix, and every accessor keeps the full data.

PartialDifferentialEquationSeparationResult.verification#

UniffiPartialDifferentialEquationSeparationResult method

func verification() -> UniffiPartialDifferentialEquationVerificationVerdict

The aggregate verdict of the independently replayed separation certificate.

PartialDifferentialEquationSimilaritySolution.decline#

UniffiPartialDifferentialEquationSimilaritySolution method

func decline() -> UniffiPartialDifferentialEquationSimilarityReductionDecline?

The typed reason no similarity family was produced.

PartialDifferentialEquationSimilaritySolution.invariant#

UniffiPartialDifferentialEquationSimilaritySolution method

func invariant() -> UniffiExpression?

The invariant of the generator's base field.

PartialDifferentialEquationSimilaritySolution.lifted_constants#

UniffiPartialDifferentialEquationSimilaritySolution method

func liftedConstants() -> [UniffiExpression]

The constants the lifted family is parameterized by.

PartialDifferentialEquationSimilaritySolution.lifted_family#

UniffiPartialDifferentialEquationSimilaritySolution method

func liftedFamily() -> UniffiPartialDifferentialEquationSolutionFamily?

The invariant solutions of the original equation.

PartialDifferentialEquationSimilaritySolution.lifted_family_verification#

UniffiPartialDifferentialEquationSimilaritySolution method

func liftedFamilyVerification() -> UniffiPartialDifferentialEquationVerificationVerdict?

The exact decision that the lifted family solves the original equation.

PartialDifferentialEquationSimilaritySolution.multiplier#

UniffiPartialDifferentialEquationSimilaritySolution method

func multiplier() -> UniffiExpression?

The multiplier of the reduction identity.

PartialDifferentialEquationSimilaritySolution.outstanding_obligations#

UniffiPartialDifferentialEquationSimilaritySolution method

func outstandingObligations() -> [UniffiPartialDifferentialEquationSymmetryObligation]

The claims the family explicitly does not make.

PartialDifferentialEquationSimilaritySolution.reduced_equation#

UniffiPartialDifferentialEquationSimilaritySolution method

func reducedEquation() -> UniffiExpression?

The reduced ordinary differential equation for the profile, read as zero.

PartialDifferentialEquationSimilaritySolution.similarity_variable#

UniffiPartialDifferentialEquationSimilaritySolution method

func similarityVariable() -> UniffiExpression?

The coordinate of the reduced equation, standing for the invariant.

PartialDifferentialEquationSimilaritySolution.summary#

UniffiPartialDifferentialEquationSimilaritySolution method

func summary() -> String

A one-line summary naming this record's decisive fields; supporting evidence is reported by verdict or by a bounded prefix, and every accessor keeps the full data.

PartialDifferentialEquationSimilaritySolution.weight#

UniffiPartialDifferentialEquationSimilaritySolution method

func weight() -> UniffiExpression?

The weight of invariant solutions.

PartialDifferentialEquationSolutionFamily.arbitrary_functions#

UniffiPartialDifferentialEquationSolutionFamily method

func arbitraryFunctions() -> [UniffiPartialDifferentialEquationArbitraryFunction]

The functions that stay arbitrary and opaque throughout verification.

PartialDifferentialEquationSolutionFamily.establishes_completeness#

UniffiPartialDifferentialEquationSolutionFamily method

func establishesCompleteness() -> Bool

Whether the family carries a completeness theorem whose every identity was proved.

PartialDifferentialEquationSolutionFamily.form#

UniffiPartialDifferentialEquationSolutionFamily method

func form() -> UniffiPartialDifferentialEquationSolutionForm

Whether this candidate is an explicit value or an implicit residual.

PartialDifferentialEquationSolutionFamily.proof_obligations#

UniffiPartialDifferentialEquationSolutionFamily method

func proofObligations() -> [UniffiPartialDifferentialEquationProofObligation]

The obligations recorded against this candidate family.

PartialDifferentialEquationSolutionFamily.summary#

UniffiPartialDifferentialEquationSolutionFamily method

func summary() -> String

A one-line summary naming this record's decisive fields; supporting evidence is reported by verdict or by a bounded prefix, and every accessor keeps the full data.

PartialDifferentialEquationSolutionProvenance.discharged_obligations#

UniffiPartialDifferentialEquationSolutionProvenance method

func dischargedObligations() -> [UniffiPartialDifferentialEquationProofObligation]

The obligations discharged by exact query before the solution was returned.

PartialDifferentialEquationSolutionProvenance.linearity#

UniffiPartialDifferentialEquationSolutionProvenance method

func linearity() -> UniffiPartialDifferentialEquationLinearity

The exact linearity class recorded at the time the candidate was produced.

PartialDifferentialEquationSolutionProvenance.method#

UniffiPartialDifferentialEquationSolutionProvenance method

func method() -> UniffiPartialDifferentialEquationMethod

The method identity this solution was produced by.

PartialDifferentialEquationSolutionProvenance.order#

UniffiPartialDifferentialEquationSolutionProvenance method

func order() -> UInt64

The exact order recorded at the time the candidate was produced.

PartialDifferentialEquationSolutionProvenance.summary#

UniffiPartialDifferentialEquationSolutionProvenance method

func summary() -> String

A one-line summary naming this record's decisive fields; supporting evidence is reported by verdict or by a bounded prefix, and every accessor keeps the full data.

PartialDifferentialEquationSolveResult.classification#

UniffiPartialDifferentialEquationSolveResult method

func classification() -> UniffiPartialDifferentialEquationClassification?

The exact classification the dispatcher established, when it reached one.

PartialDifferentialEquationSolveResult.decline#

UniffiPartialDifferentialEquationSolveResult method

func decline() -> UniffiPartialDifferentialEquationSolveDecline?

The stable decline reason, when no solution was produced.

PartialDifferentialEquationSolveResult.method#

UniffiPartialDifferentialEquationSolveResult method

func method() -> UniffiPartialDifferentialEquationMethod?

The method that produced a solution, when one did.

PartialDifferentialEquationSolveResult.provenance#

UniffiPartialDifferentialEquationSolveResult method

func provenance() -> UniffiPartialDifferentialEquationSolutionProvenance?

The mathematical provenance a verified solution carries.

PartialDifferentialEquationSolveResult.solution#

UniffiPartialDifferentialEquationSolveResult method

func solution() -> UniffiPartialDifferentialEquationSolutionFamily?

The verified solution family, which no declined route may carry.

PartialDifferentialEquationSolveResult.summary#

UniffiPartialDifferentialEquationSolveResult method

func summary() -> String

A one-line summary naming this record's decisive fields; supporting evidence is reported by verdict or by a bounded prefix, and every accessor keeps the full data.

PartialDifferentialEquationSolveResult.verdict#

UniffiPartialDifferentialEquationSolveResult method

func verdict() -> UniffiPartialDifferentialEquationSolveVerdict

Whether the dispatcher solved or honestly declined.

PartialDifferentialEquationSolveResult.verification#

UniffiPartialDifferentialEquationSolveResult method

func verification() -> UniffiPartialDifferentialEquationVerificationReport?

The independent verification report a solved result must carry.

PartialDifferentialEquationTransformationResult.coordinate_change#

UniffiPartialDifferentialEquationTransformationResult method

func coordinateChange() -> UniffiPartialDifferentialEquationCoordinateChange?

The validated coordinate change of a successful transformation.

PartialDifferentialEquationTransformationResult.decline#

UniffiPartialDifferentialEquationTransformationResult method

func decline() -> UniffiPartialDifferentialEquationTransformationDecline?

The exact reason no transformation was produced.

PartialDifferentialEquationTransformationResult.normalization_multiplier#

UniffiPartialDifferentialEquationTransformationResult method

func normalizationMultiplier() -> UniffiExpression?

The proved-nonzero residual-normalization multiplier.

PartialDifferentialEquationTransformationResult.summary#

UniffiPartialDifferentialEquationTransformationResult method

func summary() -> String

A one-line summary naming this record's decisive fields; supporting evidence is reported by verdict or by a bounded prefix, and every accessor keeps the full data.

PartialDifferentialEquationTransformationResult.target_problem#

UniffiPartialDifferentialEquationTransformationResult method

func targetProblem() -> UniffiPartialDifferentialEquationProblem?

The transformed PDE problem stated in the target coordinates.

PartialDifferentialEquationTransformationResult.transformed#

UniffiPartialDifferentialEquationTransformationResult method

func transformed() -> Bool

Whether a verified transformation was produced.

PartialDifferentialEquationTransformationVerificationReport.claimed_governing_residual#

UniffiPartialDifferentialEquationTransformationVerificationReport method

func claimedGoverningResidual() -> UniffiExpression

The governing residual the transformation claimed.

PartialDifferentialEquationTransformationVerificationReport.composition_residuals#

UniffiPartialDifferentialEquationTransformationVerificationReport method

func compositionResiduals() -> [UniffiExpression]

Every forward and inverse map-composition residual.

PartialDifferentialEquationTransformationVerificationReport.jacobian#

UniffiPartialDifferentialEquationTransformationVerificationReport method

func jacobian() -> UniffiExpression

The independently recomputed forward-map Jacobian.

PartialDifferentialEquationTransformationVerificationReport.principal_congruence_residuals#

UniffiPartialDifferentialEquationTransformationVerificationReport method

func principalCongruenceResiduals() -> [UniffiExpression]

The exact principal-matrix congruence residuals.

PartialDifferentialEquationTransformationVerificationReport.summary#

UniffiPartialDifferentialEquationTransformationVerificationReport method

func summary() -> String

A one-line summary naming this record's decisive fields; supporting evidence is reported by verdict or by a bounded prefix, and every accessor keeps the full data.

PartialDifferentialEquationTransformationVerificationReport.transformed_governing_residual#

UniffiPartialDifferentialEquationTransformationVerificationReport method

func transformedGoverningResidual() -> UniffiExpression

The independently transformed source governing residual.

PartialDifferentialEquationTransformationVerificationReport.verdict#

UniffiPartialDifferentialEquationTransformationVerificationReport method

func verdict() -> UniffiPartialDifferentialEquationVerificationVerdict

The aggregate exact verification verdict.

PartialDifferentialEquationVerificationReport.boundary_condition_residuals#

UniffiPartialDifferentialEquationVerificationReport method

func boundaryConditionResiduals() -> [UniffiPartialDifferentialEquationVerificationResidual]

One reduced residual per boundary condition, in insertion order.

PartialDifferentialEquationVerificationReport.explicit_branch#

UniffiPartialDifferentialEquationVerificationReport method

func explicitBranch() -> UniffiExpression?

The isolated explicit branch checked for an implicit candidate.

PartialDifferentialEquationVerificationReport.governing_residual#

UniffiPartialDifferentialEquationVerificationReport method

func governingResidual() -> UniffiPartialDifferentialEquationVerificationResidual

Independently reduced governing-equation evidence.

PartialDifferentialEquationVerificationReport.inconclusive_reason#

UniffiPartialDifferentialEquationVerificationReport method

func inconclusiveReason() -> UniffiPartialDifferentialEquationVerificationInconclusiveReason?

The deterministic reason verification could not reach a proof.

PartialDifferentialEquationVerificationReport.initial_condition_residuals#

UniffiPartialDifferentialEquationVerificationReport method

func initialConditionResiduals() -> [UniffiPartialDifferentialEquationVerificationResidual]

One reduced residual per initial condition, in insertion order.

PartialDifferentialEquationVerificationReport.proof_obligations#

UniffiPartialDifferentialEquationVerificationReport method

func proofObligations() -> [UniffiPartialDifferentialEquationProofObligation]

The obligations consulted or left unresolved by this verification.

PartialDifferentialEquationVerificationReport.summary#

UniffiPartialDifferentialEquationVerificationReport method

func summary() -> String

A one-line summary naming this record's decisive fields; supporting evidence is reported by verdict or by a bounded prefix, and every accessor keeps the full data.

PartialDifferentialEquationVerificationReport.verdict#

UniffiPartialDifferentialEquationVerificationReport method

func verdict() -> UniffiPartialDifferentialEquationVerificationVerdict

The aggregate exact verification verdict.

PartialDifferentialEquationVerificationResidual.residual#

UniffiPartialDifferentialEquationVerificationResidual method

func residual() -> UniffiExpression

The independently reduced residual expression.

PartialDifferentialEquationVerificationResidual.summary#

UniffiPartialDifferentialEquationVerificationResidual method

func summary() -> String

A one-line summary naming this record's decisive fields; supporting evidence is reported by verdict or by a bounded prefix, and every accessor keeps the full data.

PartialDifferentialEquationVerificationResidual.verdict#

UniffiPartialDifferentialEquationVerificationResidual method

func verdict() -> UniffiPartialDifferentialEquationVerificationVerdict

The exact verdict proved about this one residual.

PolynomialSystemSolution.affine_families#

UniffiPolynomialSystemSolution method

func affineFamilies() -> [UniffiAffineSystemFamily]

Getter on polynomial_system_solution: the complete affine families, empty unless the verdict is "affine".

PolynomialSystemSolution.complete#

UniffiPolynomialSystemSolution method

func complete() -> Bool

Getter on polynomial_system_solution: whether the solver certified it found every solution.

PolynomialSystemSolution.conditional_branches#

UniffiPolynomialSystemSolution method

func conditionalBranches() -> [UniffiConditionalSystemBranch]

Getter on polynomial_system_solution: the exhaustive guarded branches, empty unless the verdict is "conditional".

PolynomialSystemSolution.parametric_components#

UniffiPolynomialSystemSolution method

func parametricComponents() -> [UniffiSystemParametricComponent]

Getter on polynomial_system_solution: the certified explicit charts, empty unless the verdict is "parametric_components".

PolynomialSystemSolution.solutions#

UniffiPolynomialSystemSolution method

func solutions() -> [UniffiSystemAssignment]

Getter on polynomial_system_solution: the array of system_assignment tuples (empty for the non-finite verdicts).

PolynomialSystemSolution.verdict#

UniffiPolynomialSystemSolution method

func verdict() -> UniffiSystemVerdict

Getter on polynomial_system_solution: the verdict string, one of "finite", "empty", "affine", "conditional", "positive_dimensional", or "declined".

SystemAssignment.values#

UniffiSystemAssignment method

func values() -> [UniffiExpression]

Getter on system_assignment: the assigned value expressions, aligned with variables.

Calling forms and variants

Variant for this object — UniffiAffineSystemDirection method: UniffiAffineSystemDirection.values

func values() -> [UniffiExpression]

SystemAssignment.variables#

UniffiSystemAssignment method

func variables() -> [String]

Getter on system_assignment: the unknown names, in order.

Calling forms and variants

Variant for this object — UniffiAffineSystemDirection method: UniffiAffineSystemDirection.variables

func variables() -> [String]

Variant for this object — UniffiAffineSystemFamily method: UniffiAffineSystemFamily.variables

func variables() -> [String]

SystemParametricComponent.assignments#

UniffiSystemParametricComponent method

func assignments() -> UniffiSystemAssignment

Getter on system_parametric_component: the exact solved-variable assignments.

SystemParametricComponent.certificate_summary#

UniffiSystemParametricComponent method

func certificateSummary() -> String

Getter on system_parametric_component: a concise exact construction certificate.

SystemParametricComponent.parameter_guard#

UniffiSystemParametricComponent method

func parameterGuard() -> UniffiExpression

Getter on system_parametric_component: the parameter-space guard of this chart.

SystemParametricComponent.parameters#

UniffiSystemParametricComponent method

func parameters() -> [String]

Getter on system_parametric_component: the fresh independent parameter names.

SystemParametricComponent.source_conditions#

UniffiSystemParametricComponent method

func sourceConditions() -> [UniffiExpression]

Getter on system_parametric_component: source definedness conditions retained by this chart.

SystemSolveReport.certified_solution#

UniffiSystemSolveReport method

func certifiedSolution() -> UniffiPolynomialSystemSolution

The assignments or families checked against the original system.

SystemSolveReport.complete#

UniffiSystemSolveReport method

func complete() -> Bool

Whether exact replay proved that the certified result is exhaustive.

SystemSolveReport.diagnostics#

UniffiSystemSolveReport method

func diagnostics() -> [UniffiSolveReportDiagnostic]

Non-impossibility reasons that prevented a stronger report.

SystemSolveReport.guarded_branches#

UniffiSystemSolveReport method

func guardedBranches() -> [UniffiConditionalSystemBranch]

The exact guarded strata carried by this report.

SystemSolveReport.proof_summary#

UniffiSystemSolveReport method

func proofSummary() -> UniffiSolveProofSummary

The root checked proof rule, without exposing the internal proof graph.

SystemSolveReport.requested_domain#

UniffiSystemSolveReport method

func requestedDomain() -> UniffiSolveRequestedDomain

The ambient domain in which the report was checked.

SystemSolveReport.status#

UniffiSystemSolveReport method

func status() -> UniffiSolveReportStatus

The checked report status: complete, partial, or declined.

SystemSolveReport.unresolved_equations#

UniffiSystemSolveReport method

func unresolvedEquations() -> [UniffiExpression]

The retained original equations when a system report is not complete.

UndefinedFunction.call#

UniffiUndefinedFunction method

func call(arguments: [UniffiExpression]) -> UniffiExpression

WASM spelling of the Python f(x, …) call syntax on undefined_function.

UndefinedFunction.derivative#

UniffiUndefinedFunction method

func derivative(
    orders: [UInt64],
    arguments: [UniffiExpression],
) -> UniffiExpression

Constructs the structural derivative of this named function, one order per argument: y.derivative([1], [x]) is y'(x). This is the shape the differential-equation classifiers recognise, not a deferred derivative of an arbitrary expression.

analyze_first_order_nonlinear_equation#

Explicit context

func analyzeFirstOrderNonlinearEquation(
    equation: UniffiExpression,
    dependentFunctionCall: UniffiExpression,
    independentVariable: String,
) -> UniffiFirstOrderNonlinearSolutionAnalysis?

Classify a nonlinear first-order equation into every separately certified branch.

canonicalize_partial_differential_equation#

Explicit context

func canonicalizePartialDifferentialEquation(problem: UniffiPartialDifferentialEquationProblem) -> UniffiPartialDifferentialEquationCanonicalizationResult

Construct and independently verify exact canonical coordinates for a supported PDE.

change_partial_differential_equation_variables#

Explicit context

func changePartialDifferentialEquationVariables(
    problem: UniffiPartialDifferentialEquationProblem,
    targetVariables: [String],
    forwardCoordinates: [UniffiExpression]?,
    inverseCoordinates: [UniffiExpression]?,
    targetDependentFunction: UniffiUndefinedFunction?,
) -> UniffiPartialDifferentialEquationTransformationResult

Transform a two-variable PDE through an exact user-supplied change of variables.

classify_partial_differential_equation#

Explicit context

func classifyPartialDifferentialEquation(problem: UniffiPartialDifferentialEquationProblem) -> UniffiPartialDifferentialEquationClassification

Classify a validated scalar partial differential equation with exact structural analysis.

classify_second_order_partial_differential_equation#

Explicit context

func classifySecondOrderPartialDifferentialEquation(problem: UniffiPartialDifferentialEquationProblem) -> UniffiPartialDifferentialEquationSecondOrderClassification

Classify a two-variable linear second-order PDE over real coordinates.

classify_unconstrained#

Explicit context

func classifyUnconstrained(
    objective: UniffiExpression,
    variables: [String],
    pointVariables: [String],
    pointValues: [UniffiExpression],
) -> UniffiExtremumClassification

Classify one given interior point — supplied as the parallel point_variables / point_values lists — by Hessian definiteness, returning the verdict string.

clear_function_declarations#

Explicit context

func clearFunctionDeclarations(function: UniffiUndefinedFunction) -> Void

Withdraw everything declared about an undefined function.

compare_real_roots#

Explicit context

func compareRealRoots(
    firstExpression: UniffiExpression,
    firstVariable: String,
    firstIndex: UInt64,
    secondExpression: UniffiExpression,
    secondVariable: String,
    secondIndex: UInt64,
) -> Int64?

Compare two real algebraic numbers exactly, each given as the index-th smallest real root of a univariate polynomial over the rationals. Returns -1, 0, or 1 according to whether the first is less than, equal to, or greater than the second — a total order decided exactly (for example compare_real_roots of 2\sqrt{2} and 33\sqrt[3]{3} returns -1).

construct_partial_differential_equation_point_symmetry_action#

Explicit context

func constructPartialDifferentialEquationPointSymmetryAction(problem: UniffiPartialDifferentialEquationProblem) -> UniffiPartialDifferentialEquationPointSymmetryAction

Integrate and compose the point-symmetry algebra of a PDE into its connected local action.

count_distinct_real_roots#

Explicit context

func countDistinctRealRoots(
    inputExpression: UniffiExpression,
    variable: String,
) -> UInt64?

Number of distinct real roots over all of R\mathbb{R}.

declare_bijection#

Explicit context

func declareBijection(
    function: UniffiUndefinedFunction,
    source: UniffiExpression,
    target: UniffiExpression,
) -> Void

Declare an undefined function a bijection from a source set onto a target set.

declare_bijection_with_inverse#

Explicit context

func declareBijectionWithInverse(
    function: UniffiUndefinedFunction,
    source: UniffiExpression,
    target: UniffiExpression,
    inverse: UniffiUndefinedFunction,
) -> Void

Declare an undefined function a bijection from a source set onto a target set, with a named inverse.

derive_partial_differential_equation_point_symmetries#

Explicit context

func derivePartialDifferentialEquationPointSymmetries(problem: UniffiPartialDifferentialEquationProblem) -> UniffiPartialDifferentialEquationPointSymmetryAlgebra

Derive the point-symmetry algebra of a scalar PDE, each basis generator independently verified.

discover_partial_differential_equation#

Explicit context

func discoverPartialDifferentialEquation(
    equation: UniffiExpression,
    initialConditions: [UniffiExpression],
    boundaryConditions: [UniffiExpression],
) -> UniffiPartialDifferentialEquationProblem

Discover the unique scalar partial differential equation signature from one governing residual, in the default context.

eliminate_quantifiers#

Explicit context

func eliminateQuantifiers(
    matrix: UniffiExpression,
    quantifiers: [UniffiQuantifier],
    variables: [String],
) -> UniffiExpression

context.eliminate_quantifiers(matrix, quantifiers: list[str], variables: list[VariableLike])

explicit_partial_differential_equation_solution#

Explicit context

func explicitPartialDifferentialEquationSolution(solution: UniffiExpression) -> UniffiPartialDifferentialEquationSolutionFamily

Create an explicit partial differential equation solution family in the default context.

find_ordinary_differential_equation_symmetries#

Explicit context

func findOrdinaryDifferentialEquationSymmetries(
    equation: UniffiExpression,
    dependentFunctionCall: UniffiExpression,
    independentVariable: String,
) -> UniffiOrdinaryDifferentialEquationPointSymmetrySearch

Find every first-order point symmetry proved within the fixed deterministic search budget.

global_optimum_on_semialgebraic#

Explicit context

func globalOptimumOnSemialgebraic(
    objective: UniffiExpression,
    constraints: UniffiExpression,
    variables: [String],
    direction: UniffiOptimizationDirection,
) -> UniffiOptimizationOutcome

context.global_optimum_on_semialgebraic(objective, constraints, variables: list[VariableLike], direction: str)

implicit_partial_differential_equation_solution#

Explicit context

func implicitPartialDifferentialEquationSolution(residual: UniffiExpression) -> UniffiPartialDifferentialEquationSolutionFamily

Create an implicit partial differential equation solution family in the default context.

karush_kuhn_tucker_points#

Explicit context

func karushKuhnTuckerPoints(
    objective: UniffiExpression,
    inequalityConstraints: [UniffiExpression],
    equalityConstraints: [UniffiExpression],
    variables: [String],
) -> UniffiOptimizationOutcome

The Karush–Kuhn–Tucker points found by active-set enumeration. Each inequality is read as inequality⁡≤0\operatorname{inequality} \le 0 and each equality as equality = 0.

lagrange_critical_points#

Explicit context

func lagrangeCriticalPoints(
    objective: UniffiExpression,
    constraints: [UniffiExpression],
    variables: [String],
) -> UniffiOptimizationOutcome

The equality-constrained critical points via Lagrange multipliers: stationarity of L=f+∑iλigiL = f + \sum_i \lambda_i g_i together with each constraint = 0, classified by the bordered Hessian. The solved multiplier values appear in each point's multipliers.

linear_differential_operator#

Explicit context

func linearDifferentialOperator(
    equation: UniffiExpression,
    dependentFunctionCall: UniffiExpression,
    independentVariable: String,
) -> UniffiLinearDifferentialOperator?

Extract a rational-coefficient scalar linear differential operator from an ODE residual.

minimal_polynomial_of#

Explicit context

func minimalPolynomialOf(
    inputExpression: UniffiExpression,
    variable: String,
) -> UniffiExpression?

Return an exact polynomial in the requested variable for a first-class polynomial-root atom. Its dense primitive integer coefficients are independent of the source variable, coefficient scale, and current isolation precision.

ordinary_differential_equation_series#

Explicit context

func ordinaryDifferentialEquationSeries(
    equation: UniffiExpression,
    dependentFunctionCall: UniffiExpression,
    independentVariable: String,
    expansionPoint: UniffiExpression,
    initialDerivatives: [UniffiExpression],
) -> UniffiOrdinaryDifferentialEquationSeries?

Derive an exact formal Taylor series from an ordinary-point initial-value problem.

partial_differential_equation#

Explicit context

func partialDifferentialEquation(
    equation: UniffiExpression,
    dependentFunction: UniffiUndefinedFunction,
    independentVariables: [String],
    initialConditions: [UniffiExpression],
    boundaryConditions: [UniffiExpression],
) -> UniffiPartialDifferentialEquationProblem

Construct a validated scalar partial differential equation in the default context, with an explicit dependent function and independent-variable order.

partial_differential_equation_arbitrary_function#

Explicit context

func partialDifferentialEquationArbitraryFunction(
    preferredName: String,
    arity: UInt64,
) -> UniffiPartialDifferentialEquationArbitraryFunction

Allocate a collision-free arbitrary function for a PDE candidate family.

partial_differential_equation_point_symmetry_generator#

Explicit context

func partialDifferentialEquationPointSymmetryGenerator(
    problem: UniffiPartialDifferentialEquationProblem,
    coordinateInfinitesimals: [UniffiExpression],
    dependentInfinitesimal: UniffiExpression,
) -> UniffiPartialDifferentialEquationPointSymmetryGenerator

Construct a candidate point-symmetry generator of a PDE from its infinitesimals.

polynomial_root#

Explicit context

func polynomialRoot(
    inputExpression: UniffiExpression,
    variable: String,
    index: UInt64,
) -> UniffiExpression?

Construct the zero-based index-th exact root of a univariate rational polynomial. Roots use canonical mathematical order: increasing real roots first, then non-real roots ordered by exact real part and exact imaginary part; indexing counts multiplicity. Coefficient scale and the variable name do not affect the resulting atom. Invalid, constant, non-rational, out-of-range, or uncertifiable inputs return None.

real_root_count#

Explicit context

func realRootCount(
    inputExpression: UniffiExpression,
    variable: String,
    lower: Int64,
    upper: Int64,
) -> UInt64?

Number of distinct real roots of a univariate polynomial in the interval (lower, upper] via Sturm sequences. None when the expression is not a univariate polynomial over the rationals.

real_root_sign#

Explicit context

func realRootSign(
    inputExpression: UniffiExpression,
    variable: String,
    index: UInt64,
) -> Int64?

The exact sign (-1, 0, or 1) of the index-th smallest real root of a univariate polynomial over the rationals, decided exactly through the real algebraic number layer rather than by numeric evaluation. None when the expression is not a univariate polynomial over the rationals or index is out of range.

reduce_ordinary_differential_equation_by_symmetry#

Explicit context

func reduceOrdinaryDifferentialEquationBySymmetry(
    equation: UniffiExpression,
    dependentFunctionCall: UniffiExpression,
    independentVariable: String,
    symmetry: UniffiOrdinaryDifferentialEquationPointSymmetry,
) -> UniffiFirstOrderNonlinearSolutionBranch?

Reduce an equation through a symmetry previously verified by this session.

roots_with_multiplicities#

Explicit context

func rootsWithMultiplicities(
    inputExpression: UniffiExpression,
    variable: String,
) -> [UniffiRootMultiplicity]

Roots of a polynomial with their multiplicities. Notes: Python returns a dict keyed by root; WASM returns an array of root_multiplicity objects.

Calling forms

Expression method: UniffiExpression.rootsWithMultiplicities

func rootsWithMultiplicities(variable: String) -> [UniffiRootMultiplicity]

separate_partial_differential_equation#

Explicit context

func separatePartialDifferentialEquation(problem: UniffiPartialDifferentialEquationProblem) -> UniffiPartialDifferentialEquationSeparationResult

Separate a supported PDE and return its independently verified one-variable equations.

solve#

Explicit context

func solve(
    inputExpression: UniffiExpression,
    variable: String,
) -> [UniffiExpression]

Solve an equation (an equal node, or an expression implicitly equated to zero) for variable, returning a list of solutions. Solutions outside the solver's reach are simply absent — prefer solveset when you need an honest "unsolved" residue.

Calling forms

Expression method: UniffiExpression.solve

func solve(variable: String) -> [UniffiExpression]

solve_detailed#

Explicit context

func solveDetailed(
    equation: UniffiExpression,
    variable: String,
    options: UniffiEquationSolveOptions,
) -> UniffiEquationSolveReport

Solve an equation with certified roots, an exact unresolved residue, and proof metadata.

solve_linear_recurrence#

Explicit context

func solveLinearRecurrence(
    equation: UniffiExpression,
    sequenceCall: UniffiExpression,
    indexVariable: String,
    initialConditions: [UniffiExpressionExpressionTuple]?,
) -> UniffiExpression

Solve a linear recurrence with polynomial coefficients for the unknown sequence named by sequence_call (e.g. a(n)), via Petkovšek's Hyper algorithm. The general solution carries one fresh symbolic constant per basis element; initial_conditions is a list of (index, value) pairs fitted by back-substitution. Constant-coefficient polynomial-exponential forcing and coefficients rational in n and c^n are also solved; other shapes return the unevaluated recurrence_equation placeholder. WASM passes a flat interleaved array.

solve_ordinary_differential_equation#

Explicit context

func solveOrdinaryDifferentialEquation(
    equation: UniffiExpression,
    dependentFunctionCall: UniffiExpression,
    independentVariable: String,
    initialConditions: [UniffiExpressionExpressionTuple]?,
) -> UniffiExpression

Solve an ODE for the unknown function named by dependent_function_call (e.g. y(x)).

solve_ordinary_differential_equation_request#

Explicit context

func solveOrdinaryDifferentialEquationRequest(
    equation: UniffiExpression,
    dependentFunctionCall: UniffiExpression,
    independentVariable: String,
    scope: UniffiDifferentialEquationSolutionScope,
    conditionResiduals: [UniffiExpression],
    method: UniffiOrdinaryDifferentialEquationMethod,
    regularity: UniffiOrdinaryDifferentialEquationRegularity,
) -> UniffiOrdinaryDifferentialEquationSolveResult

Solve one scalar ODE request with its data, method, scope, and regularity, keeping the evidence behind the answer.

solve_ordinary_differential_equation_system_request#

Explicit context

func solveOrdinaryDifferentialEquationSystemRequest(
    equations: [UniffiExpression],
    dependentFunctionCalls: [UniffiExpression],
    independentVariable: String,
    conditionResiduals: [UniffiExpression],
    method: UniffiOrdinaryDifferentialEquationSystemMethod,
) -> UniffiOrdinaryDifferentialEquationSystemSolveResult

Solve a system of ODEs in one coordinate through the requested route, keeping the evidence behind the assignment.

solve_ordinary_differential_equation_with_history#

Explicit context

func solveOrdinaryDifferentialEquationWithHistory(
    equation: UniffiExpression,
    dependentFunctionCall: UniffiExpression,
    independentVariable: String,
    historyValue: UniffiExpression,
    historyStart: UniffiExpression,
    historyEnd: UniffiExpression,
) -> UniffiOrdinaryDifferentialEquationSolveResult

Solve a retarded delay ODE from a constant history stated on an explicit interval.

solve_ordinary_differential_equation_with_particular_solution#

Explicit context

func solveOrdinaryDifferentialEquationWithParticularSolution(
    equation: UniffiExpression,
    dependentFunctionCall: UniffiExpression,
    independentVariable: String,
    particularSolution: UniffiExpression,
) -> UniffiExpression

Riccati-specific entry: with a known particular solution y1y_1, the substitution y=y1+1/vy = y_1 + 1/v reduces the Riccati equation to a linear first-order ODE. Falls back to the unevaluated placeholder when the shape is not Riccati.

solve_partial_differential_equation#

Explicit context

func solvePartialDifferentialEquation(
    problem: UniffiPartialDifferentialEquationProblem,
    method: UniffiPartialDifferentialEquationMethod,
) -> UniffiPartialDifferentialEquationSolveResult

Run the sound partial differential equation dispatcher under a stable method name.

solve_partial_differential_equation_by_similarity_reduction#

Explicit context

func solvePartialDifferentialEquationBySimilarityReduction(
    problem: UniffiPartialDifferentialEquationProblem,
    generator: UniffiPartialDifferentialEquationPointSymmetryGenerator,
) -> UniffiPartialDifferentialEquationSimilaritySolution

Reduce a two-variable PDE by a point symmetry, solve the reduction, and lift its family.

solve_partial_differential_equation_request#

Explicit context

func solvePartialDifferentialEquationRequest(
    problem: UniffiPartialDifferentialEquationProblem,
    scope: UniffiDifferentialEquationSolutionScope,
    geometricDomain: UniffiPartialDifferentialEquationGeometricDomain,
    regularity: UniffiPartialDifferentialEquationRegularity,
    solutionClass: UniffiPartialDifferentialEquationSolutionClass,
    method: UniffiPartialDifferentialEquationMethod,
) -> UniffiPartialDifferentialEquationSolveResult

Solve a PDE request whose scope, geometry, regularity, and solution class are part of the question.

solve_partial_differential_equation_with_transform_axis_specifications#

Explicit context

func solvePartialDifferentialEquationWithTransformAxisSpecifications(
    problem: UniffiPartialDifferentialEquationProblem,
    method: UniffiPartialDifferentialEquationMethod,
    transformAxisSpecifications: [String],
) -> UniffiPartialDifferentialEquationSolveResult

Solve a PDE with ordered explicit transform-axis specifications.

solve_polynomial_system#

Explicit context

func solvePolynomialSystem(
    equations: [UniffiExpression],
    variables: [String],
) -> UniffiPolynomialSystemSolution

Solve a multivariate polynomial system { equation_i = 0 } for the named unknowns. Every other free symbol is a parameter carried symbolically in the coefficient ring. The solver is sound and honestly incomplete: every returned tuple has been back-substituted into every equation and reduced to a provable zero, and the verdict never overstates completeness.

solve_semialgebraic#

Explicit context

func solveSemialgebraic(
    matrix: UniffiExpression,
    variables: [String],
) -> UniffiExpression

context.solve_semialgebraic(matrix, variables: list[VariableLike])

solve_system_detailed#

Explicit context

func solveSystemDetailed(
    equations: [UniffiExpression],
    variables: [String],
    options: UniffiEquationSolveOptions,
) -> UniffiSystemSolveReport

Solve a polynomial system with certified assignments, unresolved equations, and proof metadata.

solveset#

Explicit context

func solveset(
    inputExpression: UniffiExpression,
    variable: String,
) -> UniffiExpression

Solution set of the equation or inequality: a finite set, interval, union, image set (periodic families), or condition set (the honest "unsolved" residue).

Calling forms

Expression method: UniffiExpression.solveset

func solveset(variable: String) -> UniffiExpression

solveset_in_domain#

Explicit context

func solvesetInDomain(
    inputExpression: UniffiExpression,
    variable: String,
    domain: UniffiExpression,
) -> UniffiExpression

solveset restricted to an explicit domain set (e.g. real_line(), integer_set(), an interval).

unconstrained_critical_points#

Explicit context

func unconstrainedCriticalPoints(
    objective: UniffiExpression,
    variables: [String],
) -> UniffiOptimizationOutcome

The critical points of objective as the solutions of ∇f=0\nabla f = 0, each classified by the definiteness of the Hessian (Sylvester's criterion on the leading principal minors).

undefined_function#

Explicit context

func undefinedFunction(name: String) -> UniffiUndefinedFunction

A callable proxy for a user-named function. Calling it with expression arguments builds the function-call expression (see the object-model page and the worked ODE example).

verify_ordinary_differential_equation_system_solution#

Explicit context

func verifyOrdinaryDifferentialEquationSystemSolution(
    equations: [UniffiExpression],
    dependentFunctionCalls: [UniffiExpression],
    independentVariable: String,
    components: [UniffiExpression],
    generatedConstants: [UniffiExpression],
    conditionResiduals: [UniffiExpression],
) -> UniffiOrdinaryDifferentialEquationSystemVerificationReport

Verify a supplied assignment for a system of ODEs without solving it again.

verify_partial_differential_equation_coordinate_transformation#

Explicit context

func verifyPartialDifferentialEquationCoordinateTransformation(
    problem: UniffiPartialDifferentialEquationProblem,
    transformation: UniffiPartialDifferentialEquationTransformationResult,
) -> UniffiPartialDifferentialEquationTransformationVerificationReport

Independently verify an exact PDE coordinate transformation.

verify_partial_differential_equation_solution#

Explicit context

func verifyPartialDifferentialEquationSolution(
    problem: UniffiPartialDifferentialEquationProblem,
    solution: UniffiPartialDifferentialEquationSolutionFamily,
) -> UniffiPartialDifferentialEquationVerificationReport

Independently verify a partial differential equation candidate with exact residual reasoning.

add#

Expression method

func add(other: UniffiExpression) -> UniffiExpression

Entrywise sum of two matrices of the same shape.

cancel#

Explicit context

func cancel(target: UniffiExpression) -> UniffiExpression

Rational normal form: write as a single fraction and divide out the polynomial GCD of numerator and denominator.

Calling forms

Expression method: UniffiExpression.cancel

func cancel() -> UniffiExpression

collect#

Explicit context

func collect(
    inputExpression: UniffiExpression,
    generator: UniffiExpression,
) -> UniffiExpression

Regroup the additive terms of expression by the numeric (integer or rational) powers of a single generator, which may be a variable or an arbitrary subexpression, writing the result as a sum of generator^k coefficient(k) terms without expanding the coefficients. For example, collecting ax^2 + bx^2 + ax - bx + c by x yields x^2(a + b) + x(a - b) + c.

Calling forms

Expression method: UniffiExpression.collect

func collect(generator: UniffiExpression) -> UniffiExpression

collect_radicals#

Explicit context

func collectRadicals(inputExpression: UniffiExpression) -> UniffiExpression

Collect like numeric radical kernels in a top-level sum. For example, a*sqrt(2) + b*sqrt(2) + 3 becomes (a + b)*sqrt(2) + 3.

Calling forms

Expression method: UniffiExpression.collectRadicals

func collectRadicals() -> UniffiExpression

combine_logarithm#

Explicit context

func combineLogarithm(inputExpression: UniffiExpression) -> UniffiExpression

log⁡a+log⁡b→log⁡(ab)\log a + \log b \rightarrow \log(a b) and nlog⁡a→log⁡(an)n\log a \rightarrow \log(a^n) when the transformation preserves the expression's domain.

Calling forms

Expression method: UniffiExpression.combineLogarithm

func combineLogarithm() -> UniffiExpression

combine_powers#

Explicit context

func combinePowers(inputExpression: UniffiExpression) -> UniffiExpression

Combine same-exponent powers into a single power of the merged base (x^a y^a -> (xy)^a) at every product node where the rewrite is provably valid. This identity is false across the branch cut of the complex logarithm — at x = y = -1 and a = 1/2 the left side is ii = -1 while the right side is sqrt(1) = 1 — so it fires only when the exponent is provably an integer or when every combined base is provably positive. Positivity of the merged base is not enough: (-2)^x (-3)^x is left alone, because at x = 1/2 combining it to 6^x would flip the sign of the result. Positive numeric-literal bases need no assumptions at all, so 2^x 3^x becomes 6^x and (1/2)^x 3^x becomes (3/2)^x.

Calling forms

Expression method: UniffiExpression.combinePowers

func combinePowers() -> UniffiExpression

combine_trigonometric#

Explicit context

func combineTrigonometric(target: UniffiExpression) -> UniffiExpression

Inverse direction of expand_trigonometric: product-to-sum and angle-recombination rules.

Calling forms

Expression method: UniffiExpression.combineTrigonometric

func combineTrigonometric() -> UniffiExpression

complete_the_square#

Explicit context

func completeTheSquare(
    inputExpression: UniffiExpression,
    variable: UniffiExpression,
) -> UniffiExpression

Rewrite an expression that is quadratic in variable into the exact vertex form a*(variable - h)^2 + k, with h = -b/(2*a) and k = c - b^2/(4*a) built from the degree-2, degree-1 and degree-0 coefficients a, b, c of the expression collected in variable.

Calling forms

Expression method: UniffiExpression.completeTheSquare

func completeTheSquare(variable: UniffiExpression) -> UniffiExpression

denest_powers#

Explicit context

func denestPowers(inputExpression: UniffiExpression) -> UniffiExpression

Flatten a power of a power into a single power ((x^a)^b -> x^(a*b)) at every power node whose outer exponent is provably an integer, which is valid on the principal branch because an integer power never routes through log.

Calling forms

Expression method: UniffiExpression.denestPowers

func denestPowers() -> UniffiExpression

denest_radicals#

Explicit context

func denestRadicals(inputExpression: UniffiExpression) -> UniffiExpression

Denest the bounded depth-two real-radical subset bottom-up: rational quadratic surds, up to three inner quadratic surds, and cbrt(a + b*sqrt(c)) when its exact resolvent has a rational root. For example, sqrt(3 + 2*sqrt(2)) becomes 1 + sqrt(2) and cbrt(2 + sqrt(5)) becomes (1 + sqrt(5))/2.

Calling forms

Expression method: UniffiExpression.denestRadicals

func denestRadicals() -> UniffiExpression

denominator#

Explicit context

func denominator(target: UniffiExpression) -> UniffiExpression

Returns the structural denominator from numerator_denominator.

Calling forms

Expression method: UniffiExpression.denominator

func denominator() -> UniffiExpression

divide#

Expression method

func divide(other: UniffiExpression) -> UniffiExpression

Quotient of this expression and other.

duplicate#

Expression method

func duplicate() -> UniffiExpression

An independent handle to the same underlying expression. The recommended JavaScript facade duplicates values before passing them through ownership-transferring raw WASM arrays, so ordinary facade calls are non-destructive. Callers using facade.raw directly must still duplicate a handle they intend to retain. Python arguments are borrowed.

equals#

Expression method

func equals(other: UniffiExpression) -> Bool

Mathematical equality test: simplify⁡(self⁡−other⁡)=0\operatorname{simplify}(\operatorname{self} - \operatorname{other}) = 0.

expand#

Explicit context

func expand(target: UniffiExpression) -> UniffiExpression

Expand products, integer powers, and supported algebraic forms.

Calling forms

Expression method: UniffiExpression.expand

func expand() -> UniffiExpression

expand_complex#

Explicit context

func expandComplex(inputExpression: UniffiExpression) -> UniffiExpression

Decompose an expression exactly as real_part(expression) + i*imaginary_part(expression).

Calling forms

Expression method: UniffiExpression.expandComplex

func expandComplex() -> UniffiExpression

expand_logarithm#

Explicit context

func expandLogarithm(inputExpression: UniffiExpression) -> UniffiExpression

log⁡(ab)→log⁡a+log⁡b\log(a b) \rightarrow \log a + \log b and log⁡(an)→nlog⁡a\log(a^n) \rightarrow n\log a, applied only where the operands are provably positive. Operands of unknown sign pass through unchanged.

Calling forms

Expression method: UniffiExpression.expandLogarithm

func expandLogarithm() -> UniffiExpression

expand_power_base#

Explicit context

func expandPowerBase(inputExpression: UniffiExpression) -> UniffiExpression

Split a power whose base is structurally a product into a product of powers ((xy)^a -> x^a y^a) at every power node whose exponent is provably an integer — the only unconditionally valid gate for this direction, since the split introduces x^a and y^a individually and each needs its own base off the cut. With n declared an integer, (xy)^n becomes x^n y^n.

Calling forms

Expression method: UniffiExpression.expandPowerBase

func expandPowerBase() -> UniffiExpression

expand_trigonometric#

Explicit context

func expandTrigonometric(target: UniffiExpression) -> UniffiExpression

Expand trig/hyperbolic functions of sums and multiple angles.

Calling forms

Expression method: UniffiExpression.expandTrigonometric

func expandTrigonometric() -> UniffiExpression

expression_type#

Expression method

func expressionType() -> String

Top-level node kind: one of integer, rational, symbol, constant, sum, product, power, factorial, function_call, derivative, integral, summation, laplace_transform, inverse_laplace_transform, fourier_transform, inverse_fourier_transform, piecewise, ordinary_differential_equation, recurrence_equation, interval, finite_set, set_union, set_intersection, set_complement, image_set, condition_set.

factor#

Explicit context

func factor(target: UniffiExpression) -> UniffiExpression

Polynomial factorization over the rationals (full multivariate).

Calling forms

Expression method: UniffiExpression.factor

func factor() -> UniffiExpression

factor_common_terms#

Explicit context

func factorCommonTerms(inputExpression: UniffiExpression) -> UniffiExpression

Pull the greatest common monomial and exact rational content out of the terms of a general — not necessarily polynomial — sum, producing a single product of a common factor and a reduced sum, without invoking full polynomial factorization. For example, 6*x*y + 9*x^2*sin(z) becomes 3*x*(2*y + 3*x*sin(z)).

Calling forms

Expression method: UniffiExpression.factorCommonTerms

func factorCommonTerms() -> UniffiExpression

free_variables#

Expression method

func freeVariables() -> [String]

Sorted names of the free symbols. Bound binders (integration variables, image-set parameters) are excluded; the constants pi/e are not symbols.

image_set_domain#

Expression method

func imageSetDomain() -> UniffiExpression

The domain an image_set expression maps over.

image_set_lambda_expression#

Expression method

func imageSetLambdaExpression() -> UniffiExpression

The body an image_set expression applies to its bound variable.

image_set_variable#

Expression method

func imageSetVariable() -> String

The name of the variable an image_set expression binds.

imaginary_part#

Explicit context

func imaginaryPart(target: UniffiExpression) -> UniffiExpression

Return the exact imaginary component of an expression. For example, if y is declared real, imaginary_part(exp(i*y)) is sin(y).

Calling forms

Expression method: UniffiExpression.imaginaryPart

func imaginaryPart() -> UniffiExpression

integral_integrand#

Expression method

func integralIntegrand() -> UniffiExpression

The integrand of an unevaluated integral expression.

integral_lower_bound#

Expression method

func integralLowerBound() -> UniffiExpression?

None for indefinite integrals.

integral_upper_bound#

Expression method

func integralUpperBound() -> UniffiExpression?

The upper bound of an unevaluated integral, or None when it is indefinite.

integral_variable#

Expression method

func integralVariable() -> String

The name of the variable an unevaluated integral integrates over.

interval_lower#

Expression method

func intervalLower() -> UniffiExpression

Lower endpoint of an interval node; raises on other shapes.

interval_upper#

Expression method

func intervalUpper() -> UniffiExpression

The upper endpoint of an interval expression.

is_algebraic#

Expression method

func isAlgebraic() -> UniffiTruthValue

Provides the is_algebraic operation on this mobile object.

is_complex#

Expression method

func isComplex() -> UniffiTruthValue

Provides the is_complex operation on this mobile object.

is_composite#

Expression method

func isComposite() -> UniffiTruthValue

Provides the is_composite operation on this mobile object.

is_defined#

Expression method

func isDefined() -> UniffiTruthValue

Whether the expression is known to denote one scalar value at the active point.

is_equality#

Expression method

func isEquality() -> Bool

True for equal(a, b) relation nodes.

is_even#

Expression method

func isEven() -> UniffiTruthValue

Provides the is_even operation on this mobile object.

is_extended_real#

Expression method

func isExtendedReal() -> UniffiTruthValue

Provides the is_extended_real operation on this mobile object.

is_finite#

Expression method

func isFinite() -> UniffiTruthValue

Whether the expression is known finite, or None when the assumptions cannot decide it.

is_finite_set#

Expression method

func isFiniteSet() -> Bool

Whether this expression is a finite_set.

is_image_set#

Expression method

func isImageSet() -> Bool

Whether this expression is an image_set.

is_infinite#

Expression method

func isInfinite() -> UniffiTruthValue

Provides the is_infinite operation on this mobile object.

is_integer#

Expression method

func isInteger() -> UniffiTruthValue

Whether the expression is known to be an integer, or None when the assumptions cannot decide it.

is_integral#

Expression method

func isIntegral() -> Bool

True for unevaluated integral nodes. (Distinct from the assumption query is_integer.)

is_interval#

Expression method

func isInterval() -> Bool

Whether this expression is an interval.

is_irrational#

Expression method

func isIrrational() -> UniffiTruthValue

Provides the is_irrational operation on this mobile object.

is_matrix#

Expression method

func isMatrix() -> Bool

Always False on expressions and True on matrix objects, so mixed result streams can be discriminated.

is_natural#

Expression method

func isNatural() -> UniffiTruthValue

Provides the is_natural operation on this mobile object.

is_negative#

Expression method

func isNegative() -> UniffiTruthValue

Whether the expression is known to be negative, or None when the assumptions cannot decide it.

is_nonnegative#

Expression method

func isNonnegative() -> UniffiTruthValue

Answers whether the expression is nonnegative in the extended-real universe. Non-real values are refuted; unsupported real expressions remain None.

is_nonpositive#

Expression method

func isNonpositive() -> UniffiTruthValue

Provides the is_nonpositive operation on this mobile object.

is_nonzero#

Expression method

func isNonzero() -> UniffiTruthValue

Whether the expression is known to be nonzero, or None when the assumptions cannot decide it.

is_odd#

Expression method

func isOdd() -> UniffiTruthValue

Provides the is_odd operation on this mobile object.

is_positive#

Expression method

func isPositive() -> UniffiTruthValue

Whether the expression is known to be positive, or None when the assumptions cannot decide it.

is_positive_integer#

Expression method

func isPositiveInteger() -> UniffiTruthValue

Provides the is_positive_integer operation on this mobile object.

is_rational#

Expression method

func isRational() -> UniffiTruthValue

Whether the expression is known to be rational, or None when the assumptions cannot decide it.

is_real#

Expression method

func isReal() -> UniffiTruthValue

Whether the expression is known to be real, or None when the assumptions cannot decide it.

is_stale#

Expression method

func isStale() -> Bool

Reports whether resetting the owning context invalidated the expression. All other operations reject a stale receiver with an actionable error.

is_transcendental#

Expression method

func isTranscendental() -> UniffiTruthValue

Provides the is_transcendental operation on this mobile object.

is_union#

Expression method

func isUnion() -> Bool

Whether this expression is a union of sets.

is_zero#

Expression method

func isZero() -> UniffiTruthValue

Provides the is_zero operation on this mobile object.

multiply#

Expression method

func multiply(other: UniffiExpression) -> UniffiExpression

Matrix product; inner dimensions must agree.

negate#

Expression method

func negate() -> UniffiExpression

Negation of this expression.

node_count#

Expression method

func nodeCount() -> UInt64

Number of nodes in the expression tree — the size measure used by the simplifier; useful for comparing alternative forms.

numerator#

Explicit context

func numerator(target: UniffiExpression) -> UniffiExpression

Returns the structural numerator from numerator_denominator.

Calling forms

Expression method: UniffiExpression.numerator

func numerator() -> UniffiExpression

numerator_denominator#

Explicit context

func numeratorDenominator(target: UniffiExpression) -> UniffiExpressionExpressionTuple

Returns the exact structural numerator and denominator without combining sums or cancelling factors. Python returns a two-tuple and the JavaScript facade returns a record.

Calling forms

Expression method: UniffiExpression.numeratorDenominator

func numeratorDenominator() -> UniffiExpressionExpressionTuple

partial_fractions#

Explicit context

func partialFractions(
    inputExpression: UniffiExpression,
    variable: String,
) -> UniffiExpression

Decompose a rational expression into polynomial and proper-fraction terms over the named variable.

Calling forms

Expression method: UniffiExpression.partialFractions

func partialFractions(variable: String) -> UniffiExpression

piecewise_fold#

Explicit context

func piecewiseFold(inputExpression: UniffiExpression) -> UniffiExpression

Expand abs, signum, and heaviside_step definitions recursively and fold piecewise operands of sums, products, powers, factorials, and ordinary function calls into one top-level piecewise expression. For example, x*abs(x - 1) becomes the exact two-branch definition with values x*(x - 1) and -x*(x - 1).

Calling forms

Expression method: UniffiExpression.piecewiseFold

func piecewiseFold() -> UniffiExpression

power#

Expression method

func power(exponent: UniffiExpression) -> UniffiExpression

This expression raised to exponent.

presentation_normal_form#

Explicit context

func presentationNormalForm(inputExpression: UniffiExpression) -> UniffiExpression

The cheap, bounded display-oriented pass run at solver output seams: rational normal form only, kept only when the weighted complexity does not grow. Unlike simplify it never runs the full heuristic ladder, so it is fast and deterministic in shape.

Calling forms

Expression method: UniffiExpression.presentationNormalForm

func presentationNormalForm() -> UniffiExpression

rationalize_denominator#

Explicit context

func rationalizeDenominator(inputExpression: UniffiExpression) -> UniffiExpression

Rationalize a radical denominator through exact multiquadratic conjugation or extended-Euclidean inversion in one rational n-th-root extension. For example, 1 / (sqrt(3) - sqrt(2)) becomes sqrt(3) + sqrt(2), and 1 / (1 + 2^(1/3)) becomes (1 - 2^(1/3) + 2^(2/3))/3.

Calling forms

Expression method: UniffiExpression.rationalizeDenominator

func rationalizeDenominator() -> UniffiExpression

real_part#

Explicit context

func realPart(target: UniffiExpression) -> UniffiExpression

Return the exact real component of an expression. For example, if y is declared real, real_part(exp(i*y)) is cos(y).

Calling forms

Expression method: UniffiExpression.realPart

func realPart() -> UniffiExpression

rewrite_as_exponential#

Explicit context

func rewriteAsExponential(inputExpression: UniffiExpression) -> UniffiExpression

Euler-form rewriter: replace every trigonometric/hyperbolic call with the equivalent complex-exponential expression (bottom-up).

Calling forms

Expression method: UniffiExpression.rewriteAsExponential

func rewriteAsExponential() -> UniffiExpression

rewrite_as_trigonometric#

Explicit context

func rewriteAsTrigonometric(inputExpression: UniffiExpression) -> UniffiExpression

Inverse of rewrite_as_exponential.

Calling forms

Expression method: UniffiExpression.rewriteAsTrigonometric

func rewriteAsTrigonometric() -> UniffiExpression

rewrite_in_terms_of#

Explicit context

func rewriteInTermsOf(
    target: UniffiExpression,
    source: UniffiExpression,
    replacement: UniffiExpression,
) -> UniffiExpression

Rewrite the target in terms of replacement under the caller-supplied formal relation replacement = source.

Calling forms

Expression method: UniffiExpression.rewriteInTermsOf

func rewriteInTermsOf(
    source: UniffiExpression,
    replacement: UniffiExpression,
) -> UniffiExpression

rewrite_special_functions#

Explicit context

func rewriteSpecialFunctions(
    target: UniffiExpression,
    basis: UniffiSpecialFunctionBasis,
) -> UniffiExpression

Rewrite beta, gamma, binomial, factorial, and rising-factorial representations into the requested "gamma", "factorial", "binomial", or "rising_factorial" basis. The exact identities are applied only when their domain gates are proven: factorial and binomial conversions require the relevant non-negative integers, rising-factorial conversions additionally require a positive base, and beta-to-gamma requires two positive arguments. For example, with n declared a positive integer, n! may be rewritten into the gamma basis and gamma(n) into the factorial basis. A site with unconstrained arguments is returned unchanged. Gamma ratios with a literal non-negative argument offset are minimized to their exact shifted product.

Calling forms

Expression method: UniffiExpression.rewriteSpecialFunctions

func rewriteSpecialFunctions(basis: UniffiSpecialFunctionBasis) -> UniffiExpression

rewrite_trigonometric_basis#

Explicit context

func rewriteTrigonometricBasis(
    target: UniffiExpression,
    basis: UniffiTrigonometricBasis,
) -> UniffiExpression

Rewrite trigonometric and hyperbolic calls toward one of five named bases: sine_cosine, tangent, exponential, trigonometric, or hyperbolic.

Calling forms

Expression method: UniffiExpression.rewriteTrigonometricBasis

func rewriteTrigonometricBasis(basis: UniffiTrigonometricBasis) -> UniffiExpression

simplify#

Explicit context

func simplify(target: UniffiExpression) -> UniffiExpression

The full heuristic simplification ladder: weighted-complexity-guided search over rational normal form, radical denesting, trigonometric/log rewrites, parity and absolute-value rules. The result is never accepted if its weighted complexity grows. Principal square roots extract structural square content only under a realness proof: sqrt(x^2) becomes abs(x) for real x, while sqrt(z^2) remains unchanged for a default-complex z.

Calling forms and variants

Expression method: UniffiExpression.simplify

func simplify() -> UniffiExpression

Variant using local assumptions — UniffiAssumptionScope method: UniffiAssumptionScope.simplify

func simplify(target: UniffiExpression) -> UniffiExpression

simplify_trigonometric#

Explicit context

func simplifyTrigonometric(target: UniffiExpression) -> UniffiExpression

Fu-style trigonometric simplification toward fewer/cheaper trig calls.

Calling forms

Expression method: UniffiExpression.simplifyTrigonometric

func simplifyTrigonometric() -> UniffiExpression

simplify_under_constraint#

Explicit context

func simplifyUnderConstraint(
    target: UniffiExpression,
    constraint: UniffiExpression,
) -> UniffiExpression

Simplify an expression under a local bounded logical constraint without changing symbol assumptions.

Calling forms

Expression method: UniffiExpression.simplifyUnderConstraint

func simplifyUnderConstraint(constraint: UniffiExpression) -> UniffiExpression

substitute#

Expression method

func substitute(
    variable: UniffiExpression,
    value: UniffiExpression,
) -> UniffiExpression

Replace every free occurrence of the named symbol with value, re-running auto-simplification.

subtract#

Expression method

func subtract(other: UniffiExpression) -> UniffiExpression

Entrywise difference of two matrices of the same shape.

symbol_name#

Expression method

func symbolName() -> String

Returns the name of a symbol expression and rejects every other expression kind.

to_list#

Expression method

func toList() -> [UniffiExpression]

Elements of a finite set; raises on other shapes. Python finite sets also support len() and iteration.

together#

Explicit context

func together(target: UniffiExpression) -> UniffiExpression

Combine a sum of fractions over a common denominator. On Symi's representation together and cancel coincide; both names exist because they are distinct user intents.

Calling forms

Expression method: UniffiExpression.together

func together() -> UniffiExpression

union_components#

Expression method

func unionComponents() -> [UniffiExpression]

The components of a set union, as a list of expressions.

Circle2d.area#

UniffiCircle2d method

func area() -> UniffiExpression

Area of the circle, πr2\pi r^2.

Circle2d.center#

UniffiCircle2d method

func center() -> UniffiPoint2d

The center of the circle.

Circle2d.circumference#

UniffiCircle2d method

func circumference() -> UniffiExpression

Circumference of the circle.

Circle2d.equation#

UniffiCircle2d method

func equation(variableX: String, variableY: String) -> UniffiExpression

The circle as an equal relation in x and y.

Circle2d.is_stale#

UniffiCircle2d method

func isStale() -> Bool

Reports whether resetting the owning context invalidated the expression. All other operations reject a stale receiver with an actionable error.

Circle2d.radius#

UniffiCircle2d method

func radius() -> UniffiExpression

The radius of the circle.

Point2d.coordinates#

UniffiPoint2d method

func coordinates() -> UniffiExpressionExpressionTuple

The (x, y) coordinate pair of the point.

Point2d.distance_to#

UniffiPoint2d method

func distanceTo(other: UniffiPoint2d) -> UniffiExpression

Euclidean distance, exact (a sqrt expression in general).

Point2d.intersection#

UniffiPoint2d method

func intersection(other: UniffiGeometry2d) -> [UniffiGeometryIntersectionComponent]

Return the complete exact boundary intersection with another supported plane geometry.

Calling forms and variants

Variant for this object — UniffiCircle2d method: UniffiCircle2d.intersection

func intersection(other: UniffiGeometry2d) -> [UniffiGeometryIntersectionComponent]

Variant for this object — UniffiPolygon2d method: UniffiPolygon2d.intersection

func intersection(other: UniffiGeometry2d) -> [UniffiGeometryIntersectionComponent]

Variant for this object — UniffiSegment2d method: UniffiSegment2d.intersection

func intersection(other: UniffiGeometry2d) -> [UniffiGeometryIntersectionComponent]

Variant for this object — UniffiTriangle2d method: UniffiTriangle2d.intersection

func intersection(other: UniffiGeometry2d) -> [UniffiGeometryIntersectionComponent]

Point2d.is_stale#

UniffiPoint2d method

func isStale() -> Bool

Reports whether resetting the owning context invalidated the expression. All other operations reject a stale receiver with an actionable error.

Point2d.x#

UniffiPoint2d method

func x() -> UniffiExpression

The x coordinate of the point.

Point2d.y#

UniffiPoint2d method

func y() -> UniffiExpression

The y coordinate of the point.

Polygon2d.area#

UniffiPolygon2d method

func area() -> UniffiExpression

Shoelace area of the polygon.

Calling forms and variants

Variant for this object — UniffiTriangle2d method: UniffiTriangle2d.area

func area() -> UniffiExpression

Polygon2d.centroid#

UniffiPolygon2d method

func centroid() -> UniffiPoint2d

Centroid of the polygon's vertices.

Calling forms and variants

Variant for this object — UniffiTriangle2d method: UniffiTriangle2d.centroid

func centroid() -> UniffiPoint2d

Polygon2d.interior_angles#

UniffiPolygon2d method

func interiorAngles() -> [UniffiVertexAngle]

Each vertex paired with its interior angle. Notes: WASM returns vertex_angle objects with vertex/angle getters.

Calling forms and variants

Variant for this object — UniffiTriangle2d method: UniffiTriangle2d.interiorAngles

func interiorAngles() -> [UniffiVertexAngle]

Polygon2d.is_stale#

UniffiPolygon2d method

func isStale() -> Bool

Reports whether resetting the owning context invalidated the expression. All other operations reject a stale receiver with an actionable error.

Polygon2d.perimeter#

UniffiPolygon2d method

func perimeter() -> UniffiExpression

Perimeter of the polygon, the sum of its edge lengths.

Calling forms and variants

Variant for this object — UniffiTriangle2d method: UniffiTriangle2d.perimeter

func perimeter() -> UniffiExpression

Segment2d.is_stale#

UniffiSegment2d method

func isStale() -> Bool

Reports whether resetting the owning context invalidated the expression. All other operations reject a stale receiver with an actionable error.

Segment2d.length#

UniffiSegment2d method

func length() -> UniffiExpression

Also the finite-set length accessor on expression in WASM; context disambiguates.

Segment2d.midpoint#

UniffiSegment2d method

func midpoint() -> UniffiPoint2d

Midpoint of the segment.

Segment2d.perpendicular_bisector_equation#

UniffiSegment2d method

func perpendicularBisectorEquation(
    variableX: String,
    variableY: String,
) -> UniffiExpression

The bisector line as an equal relation in x and y.

Triangle2d.is_stale#

UniffiTriangle2d method

func isStale() -> Bool

Reports whether resetting the owning context invalidated the expression. All other operations reject a stale receiver with an actionable error.

VertexAngle.angle#

UniffiVertexAngle method

func angle() -> UniffiExpression

The interior angle at the vertex.

VertexAngle.vertex#

UniffiVertexAngle method

func vertex() -> UniffiPoint2d

The vertex the angle is measured at.

circle_2d#

Explicit context

func circle2d(
    center: UniffiPoint2d,
    radius: UniffiExpression,
) -> UniffiCircle2d

Construct the circle with the given center and radius.

point_2d#

Explicit context

func point2d(
    coordinateX: UniffiExpression,
    coordinateY: UniffiExpression,
) -> UniffiPoint2d

Construct the point (x, y).

polygon_2d#

Explicit context

func polygon2d(vertices: [UniffiPoint2d]) -> UniffiPolygon2d

Simple polygon from its vertex list in order; degenerate inputs raise.

segment_2d#

Explicit context

func segment2d(
    start: UniffiPoint2d,
    end: UniffiPoint2d,
) -> UniffiSegment2d

Construct the segment running from start to end.

triangle_2d#

Explicit context

func triangle2d(
    first: UniffiPoint2d,
    second: UniffiPoint2d,
    third: UniffiPoint2d,
) -> UniffiTriangle2d

Collinear vertices raise.

CompiledNumericFunction.capabilities#

UniffiCompiledNumericFunction method

func capabilities() -> UniffiNumericFunctionCapabilities

Report what this function can do and how; derivative and Jacobian availability come from compiling them once.

CompiledNumericFunction.derivative#

UniffiCompiledNumericFunction method

func derivative(variable: UniffiExpression) -> UniffiCompiledNumericFunction

Compile the checked exact derivative of every output with respect to one input variable.

CompiledNumericFunction.domain#

UniffiCompiledNumericFunction method

func domain() -> UniffiNumericFunctionDomain

The input and result domain chosen at compilation.

CompiledNumericFunction.evaluate_batch_complex#

UniffiCompiledNumericFunction method

func evaluateBatchComplex(
    realCoordinates: [Double],
    imaginaryCoordinates: [Double],
    pointCount: UInt64,
) -> UniffiNumericFunctionBatch

Evaluate split real and imaginary point-major coordinate lists at point_count points in one call.

CompiledNumericFunction.evaluate_batch_real#

UniffiCompiledNumericFunction method

func evaluateBatchReal(
    coordinates: [Double],
    pointCount: UInt64,
) -> UniffiNumericFunctionBatch

Evaluate a point-major list of real coordinates at point_count points in one call.

CompiledNumericFunction.evaluate_detailed_complex#

UniffiCompiledNumericFunction method

func evaluateDetailedComplex(
    realArguments: [Double],
    imaginaryArguments: [Double],
) -> UniffiNumericFunctionEvaluation

Evaluate every output at one point given as split real and imaginary coordinate lists, keeping the value or the status of each.

CompiledNumericFunction.evaluate_detailed_real#

UniffiCompiledNumericFunction method

func evaluateDetailedReal(arguments: [Double]) -> UniffiNumericFunctionEvaluation

Evaluate every output at one real point, keeping the value or the status of each.

CompiledNumericFunction.evaluate_intervals#

UniffiCompiledNumericFunction method

func evaluateIntervals(
    lowerBounds: [Double],
    upperBounds: [Double],
) -> UniffiNumericFunctionIntervalEvaluation

Enclose every output over one box of real inputs, given as one finite lower and upper bound for each variable in variable order.

CompiledNumericFunction.evaluate_real#

UniffiCompiledNumericFunction method

func evaluateReal(arguments: [Double]) -> [Double]

Evaluate every output at one real point; fails if any output has no real machine value.

CompiledNumericFunction.interval_bridged_kernels#

UniffiCompiledNumericFunction method

func intervalBridgedKernels() -> [String]

The heads interval evaluation encloses through certified ball kernels.

CompiledNumericFunction.interval_directed_kernels#

UniffiCompiledNumericFunction method

func intervalDirectedKernels() -> [String]

The heads interval evaluation encloses with outward-rounded binary64 arithmetic alone.

CompiledNumericFunction.interval_unsupported_kernels#

UniffiCompiledNumericFunction method

func intervalUnsupportedKernels() -> [String]

The heads with no interval kernel; an output that reaches one has no enclosure.

CompiledNumericFunction.is_stale#

UniffiCompiledNumericFunction method

func isStale() -> Bool

Whether resetting the owner session has retired this compiled function.

CompiledNumericFunction.jacobian#

UniffiCompiledNumericFunction method

func jacobian() -> UniffiCompiledNumericFunction

Compile the checked exact Jacobian, flattened row-major as outputs by variables.

CompiledNumericFunction.output_count#

UniffiCompiledNumericFunction method

func outputCount() -> UInt64

The ordered number of flattened scalar outputs.

CompiledNumericFunction.output_shape#

UniffiCompiledNumericFunction method

func outputShape() -> [UInt64]

The dimensions of the output shape: none for a scalar, the length of a vector, and the rows then the columns of a matrix.

CompiledNumericFunction.variable_count#

UniffiCompiledNumericFunction method

func variableCount() -> UInt64

The ordered number of scalar input variables.

Matrix.evaluate_numeric#

UniffiMatrix method

func evaluateNumeric(options: UniffiNumericOptions) -> UniffiNumericMatrix

The numeric value of every entry; the first entry that declines makes the whole evaluation decline.

NumericEvaluationReport.absolute_bound#

UniffiNumericEvaluationReport method

func absoluteBound() -> UniffiNumericValue?

A proved bound on the modulus of a value below resolution.

NumericEvaluationReport.best_enclosure#

UniffiNumericEvaluationReport method

func bestEnclosure() -> UniffiNumericValue?

The last certified enclosure reached before a decline.

NumericEvaluationReport.certified_attempts#

UniffiNumericEvaluationReport method

func certifiedAttempts() -> UInt64

The number of certified ball evaluations performed.

NumericEvaluationReport.decline_reason#

UniffiNumericEvaluationReport method

func declineReason() -> UniffiNumericDeclineReason?

Why no value was produced, when none was.

NumericEvaluationReport.estimated_heads#

UniffiNumericEvaluationReport method

func estimatedHeads() -> [String]

The heads the estimated engine evaluated.

NumericEvaluationReport.exact_decisions#

UniffiNumericEvaluationReport method

func exactDecisions() -> UInt64

The number of undecided balls settled by an exact decision.

NumericEvaluationReport.heads#

UniffiNumericEvaluationReport method

func heads() -> [String]

The builtin heads and constants of the evaluated expression.

NumericEvaluationReport.responsible_heads#

UniffiNumericEvaluationReport method

func responsibleHeads() -> [String]

The heads without a certified kernel.

NumericEvaluationReport.status#

UniffiNumericEvaluationReport method

func status() -> UniffiNumericEvaluationStatus

Whether a value was produced.

NumericEvaluationReport.substitution_symbol#

UniffiNumericEvaluationReport method

func substitutionSymbol() -> String?

The symbol whose bound value was rejected.

NumericEvaluationReport.summary#

UniffiNumericEvaluationReport method

func summary() -> String

A one-line description of the outcome.

NumericEvaluationReport.unbound_symbols#

UniffiNumericEvaluationReport method

func unboundSymbols() -> [String]

The free symbols left without a value.

NumericEvaluationReport.value#

UniffiNumericEvaluationReport method

func value() -> UniffiNumericValue?

The value, when one was produced.

NumericEvaluationReport.working_precision_bits#

UniffiNumericEvaluationReport method

func workingPrecisionBits() -> UInt64

The last working precision used, in bits.

NumericFunctionBatch.all_evaluated#

UniffiNumericFunctionBatch method

func allEvaluated() -> Bool

Whether every output of every point has a machine value.

NumericFunctionBatch.bridge_used#

UniffiNumericFunctionBatch method

func bridgeUsed() -> [Bool]

Point-major observations, aligned with the real parts, of whether a certified bridge computed a value the output depends on.

NumericFunctionBatch.guard_refined#

UniffiNumericFunctionBatch method

func guardRefined() -> [Bool]

Point-major observations, aligned with the real parts, of whether a semantic guard the output depends on needed a working precision above its first one.

NumericFunctionBatch.imaginary_values#

UniffiNumericFunctionBatch method

func imaginaryValues() -> [Double]

Point-major imaginary parts aligned with the real parts.

NumericFunctionBatch.output_count#

UniffiNumericFunctionBatch method

func outputCount() -> UInt64

The number of flattened scalar outputs each point carries.

NumericFunctionBatch.output_shape#

UniffiNumericFunctionBatch method

func outputShape() -> [UInt64]

The dimensions of the output shape of each point: none for a scalar, the length of a vector, and the rows then the columns of a matrix.

NumericFunctionBatch.point_count#

UniffiNumericFunctionBatch method

func pointCount() -> UInt64

The explicit number of points represented by this batch.

NumericFunctionBatch.real_values#

UniffiNumericFunctionBatch method

func realValues() -> [Double]

Point-major real parts; an entry whose status is not evaluated is a placeholder.

NumericFunctionBatch.require_all_evaluated#

UniffiNumericFunctionBatch method

func requireAllEvaluated() -> Void

Fail for the first output that has no machine value.

NumericFunctionBatch.statuses#

UniffiNumericFunctionBatch method

func statuses() -> [UniffiNumericFunctionOutputStatus]

Point-major output statuses aligned with the real parts.

NumericFunctionBatch.underflow_observed#

UniffiNumericFunctionBatch method

func underflowObserved() -> [Bool]

Point-major underflow observations aligned with the real parts.

NumericFunctionCapabilities.accuracy#

UniffiNumericFunctionCapabilities method

func accuracy() -> String

The result category of every value: machine_approximation, with no implied digits and no error radius.

NumericFunctionCapabilities.arithmetic_format#

UniffiNumericFunctionCapabilities method

func arithmeticFormat() -> String

The machine format of every input, intermediate, and result: binary64.

NumericFunctionCapabilities.backends#

UniffiNumericFunctionCapabilities method

func backends() -> [String]

The backends that can run the function: cpu_register for point and batch evaluation, and cpu_interval for interval evaluation of a real-domain function.

NumericFunctionCapabilities.bridged_heads#

UniffiNumericFunctionCapabilities method

func bridgedHeads() -> [String]

The heads the function runs through certified bridges, sorted: builtins by name, and factorial for the factorial of a computed argument.

NumericFunctionCapabilities.derivative_variables#

UniffiNumericFunctionCapabilities method

func derivativeVariables() -> [String]

The variables, in argument order, with respect to which derivative compiles.

NumericFunctionCapabilities.direct_heads#

UniffiNumericFunctionCapabilities method

func directHeads() -> [String]

The heads the function runs directly on binary64 registers, sorted: builtins by name, and sum, product, power, and factorial for its own operations.

NumericFunctionCapabilities.domain#

UniffiNumericFunctionCapabilities method

func domain() -> UniffiNumericFunctionDomain

The input and result domain chosen at compilation.

NumericFunctionCapabilities.guard_kinds#

UniffiNumericFunctionCapabilities method

func guardKinds() -> [UniffiNumericFunctionGuardKind]

The kinds of checks made at an evaluation point.

NumericFunctionCapabilities.interval_bridged_kernels#

UniffiNumericFunctionCapabilities method

func intervalBridgedKernels() -> [String]

The heads interval evaluation encloses through certified ball kernels.

NumericFunctionCapabilities.interval_directed_kernels#

UniffiNumericFunctionCapabilities method

func intervalDirectedKernels() -> [String]

The heads interval evaluation encloses with outward-rounded binary64 arithmetic alone.

NumericFunctionCapabilities.interval_unsupported_kernels#

UniffiNumericFunctionCapabilities method

func intervalUnsupportedKernels() -> [String]

The heads with no interval kernel.

NumericFunctionCapabilities.jacobian_available#

UniffiNumericFunctionCapabilities method

func jacobianAvailable() -> Bool

Whether jacobian compiles.

NumericFunctionCapabilities.output_shape#

UniffiNumericFunctionCapabilities method

func outputShape() -> [UInt64]

The dimensions of the output shape: none for a scalar, the length of a vector, and the rows then the columns of a matrix.

NumericFunctionCapabilities.requirement_symbols#

UniffiNumericFunctionCapabilities method

func requirementSymbols() -> [String]

The names of the symbols the outputs' captured requirements mention, sorted.

NumericFunctionCapabilities.unsupported_capabilities#

UniffiNumericFunctionCapabilities method

func unsupportedCapabilities() -> [String]

The capabilities the function lacks, one per refusal, aligned with unsupported_reasons.

NumericFunctionCapabilities.unsupported_reasons#

UniffiNumericFunctionCapabilities method

func unsupportedReasons() -> [String]

Why each entry of unsupported_capabilities is unsupported.

NumericFunctionCapabilities.variables#

UniffiNumericFunctionCapabilities method

func variables() -> [String]

The names of the input variables, in argument order.

NumericFunctionEvaluation.all_evaluated#

UniffiNumericFunctionEvaluation method

func allEvaluated() -> Bool

Whether every output has a machine value.

NumericFunctionEvaluation.bridge_used#

UniffiNumericFunctionEvaluation method

func bridgeUsed() -> [Bool]

Whether a certified bridge computed a value each output depends on.

NumericFunctionEvaluation.failure_path#

UniffiNumericFunctionEvaluation method

func failurePath(output: UInt64) -> [UInt64]?

The child indices from the root of one output to the node its failure arose at; none for an evaluated output and for a status decided before any operation.

NumericFunctionEvaluation.guard_refined#

UniffiNumericFunctionEvaluation method

func guardRefined() -> [Bool]

Whether a semantic guard each output depends on needed a working precision above its first one.

NumericFunctionEvaluation.imaginary_values#

UniffiNumericFunctionEvaluation method

func imaginaryValues() -> [Double]

The imaginary part of each output, NaN where the output has no value.

NumericFunctionEvaluation.output_count#

UniffiNumericFunctionEvaluation method

func outputCount() -> UInt64

The number of flattened scalar outputs; every list has one entry per output.

NumericFunctionEvaluation.output_shape#

UniffiNumericFunctionEvaluation method

func outputShape() -> [UInt64]

The dimensions of the output shape: none for a scalar, the length of a vector, and the rows then the columns of a matrix.

NumericFunctionEvaluation.real_values#

UniffiNumericFunctionEvaluation method

func realValues() -> [Double]

The real part of each output, NaN where the output has no value.

NumericFunctionEvaluation.require_all_evaluated#

UniffiNumericFunctionEvaluation method

func requireAllEvaluated() -> Void

Fail for the first output that has no machine value.

NumericFunctionEvaluation.statuses#

UniffiNumericFunctionEvaluation method

func statuses() -> [UniffiNumericFunctionOutputStatus]

The status of each output.

NumericFunctionEvaluation.underflow_observed#

UniffiNumericFunctionEvaluation method

func underflowObserved() -> [Bool]

Whether a nonzero quantity was observed as a subnormal or zero on the way to each output.

NumericFunctionIntervalEvaluation.all_enclosed#

UniffiNumericFunctionIntervalEvaluation method

func allEnclosed() -> Bool

Whether every output has a valid enclosure.

NumericFunctionIntervalEvaluation.definedness#

UniffiNumericFunctionIntervalEvaluation method

func definedness() -> [UniffiNumericFunctionDefinedness]

Where on the box each output has a real value.

NumericFunctionIntervalEvaluation.enclosure_valid#

UniffiNumericFunctionIntervalEvaluation method

func enclosureValid() -> [Bool]

Whether each output's bounds are a proved enclosure of every real value it takes on the box.

NumericFunctionIntervalEvaluation.lower_bounds#

UniffiNumericFunctionIntervalEvaluation method

func lowerBounds() -> [Double]

The lower bound of each enclosure, possibly negative infinity; NaN where the enclosure is not valid.

NumericFunctionIntervalEvaluation.output_count#

UniffiNumericFunctionIntervalEvaluation method

func outputCount() -> UInt64

The number of flattened scalar outputs; every list has one entry per output.

NumericFunctionIntervalEvaluation.output_shape#

UniffiNumericFunctionIntervalEvaluation method

func outputShape() -> [UInt64]

The dimensions of the output shape: none for a scalar, the length of a vector, and the rows then the columns of a matrix.

NumericFunctionIntervalEvaluation.proved_continuous#

UniffiNumericFunctionIntervalEvaluation method

func provedContinuous() -> [Bool]

Whether each output is proved real and continuous at every point of the box; false means continuity was not established.

NumericFunctionIntervalEvaluation.statuses#

UniffiNumericFunctionIntervalEvaluation method

func statuses() -> [UniffiNumericFunctionOutputStatus]

The status of each output: evaluated exactly where its enclosure is valid.

NumericFunctionIntervalEvaluation.upper_bounds#

UniffiNumericFunctionIntervalEvaluation method

func upperBounds() -> [Double]

The upper bound of each enclosure, possibly positive infinity; NaN where the enclosure is not valid.

NumericMatrix.columns#

UniffiNumericMatrix method

func columns() -> UInt64

The number of columns.

NumericMatrix.entries#

UniffiNumericMatrix method

func entries() -> [UniffiNumericValue]

Every entry in row-major order.

NumericMatrix.entry#

UniffiNumericMatrix method

func entry(row: UInt64, column: UInt64) -> UniffiNumericValue

The numeric value of one entry.

NumericMatrix.rows#

UniffiNumericMatrix method

func rows() -> UInt64

The number of rows.

NumericPolynomialRootsResult.complete#

UniffiNumericPolynomialRootsResult method

func complete() -> Bool

Whether every root of the polynomial is listed: true exactly for a certified result.

NumericPolynomialRootsResult.decline_reason#

UniffiNumericPolynomialRootsResult method

func declineReason() -> UniffiNumericPolynomialRootsDeclineReason?

Why no roots were returned, for a declined request.

NumericPolynomialRootsResult.degree#

UniffiNumericPolynomialRootsResult method

func degree() -> UInt64

The exact degree of the polynomial; zero for a declined request.

NumericPolynomialRootsResult.iterations#

UniffiNumericPolynomialRootsResult method

func iterations() -> UInt64

The number of multiprecision iteration sweeps taken.

NumericPolynomialRootsResult.multiplicities#

UniffiNumericPolynomialRootsResult method

func multiplicities() -> [UInt64]

The exact multiplicity of each root, in the order of the values.

NumericPolynomialRootsResult.status#

UniffiNumericPolynomialRootsResult method

func status() -> UniffiNumericPolynomialRootsStatus

certified or declined.

NumericPolynomialRootsResult.summary#

UniffiNumericPolynomialRootsResult method

func summary() -> String

The outcome in one line: each root with its multiplicity, or the decline reason.

NumericPolynomialRootsResult.unbound_symbols#

UniffiNumericPolynomialRootsResult method

func unboundSymbols() -> [String]

The symbols other than the variable, for an unbound_symbol decline.

NumericPolynomialRootsResult.values#

UniffiNumericPolynomialRootsResult method

func values() -> [UniffiNumericValue]

Each distinct root once, in canonical order; empty for a declined request.

NumericPolynomialRootsResult.variable#

UniffiNumericPolynomialRootsResult method

func variable() -> String

The name of the polynomial's variable.

NumericPolynomialRootsResult.working_precision_bits#

UniffiNumericPolynomialRootsResult method

func workingPrecisionBits() -> UInt64

The last working precision used, in bits.

NumericRootEnclosure.lower#

UniffiNumericRootEnclosure method

func lower() -> UniffiExpression

The exact rational lower bound of the enclosure.

NumericRootEnclosure.status#

UniffiNumericRootEnclosure method

func status() -> UniffiNumericRootEnclosureStatus

What the search proved about the roots inside this enclosure.

NumericRootEnclosure.upper#

UniffiNumericRootEnclosure method

func upper() -> UniffiExpression

The exact rational upper bound of the enclosure.

NumericRootFindingResult.decline_reason#

UniffiNumericRootFindingResult method

func declineReason() -> UniffiNumericRootFindingDeclineReason?

Why no root was returned, for a declined request.

NumericRootFindingResult.domain#

UniffiNumericRootFindingResult method

func domain() -> UniffiNumericRootFindingDomain

The domain searched: real or complex once resolved.

NumericRootFindingResult.iterations#

UniffiNumericRootFindingResult method

func iterations() -> UInt64

The number of iteration or bracketing steps taken.

NumericRootFindingResult.method#

UniffiNumericRootFindingResult method

func method() -> UniffiNumericRootFindingMethod

The method that located the root, or the requested method of a declined request.

NumericRootFindingResult.multiplicity_estimate#

UniffiNumericRootFindingResult method

func multiplicityEstimate() -> UInt64?

For one equation, the estimated multiplicity of an estimated root.

NumericRootFindingResult.residuals#

UniffiNumericRootFindingResult method

func residuals() -> [UniffiNumericValue]

One residual per equation; empty for a declined request.

NumericRootFindingResult.status#

UniffiNumericRootFindingResult method

func status() -> UniffiNumericRootFindingStatus

certified, converged_uncertified, or declined.

NumericRootFindingResult.summary#

UniffiNumericRootFindingResult method

func summary() -> String

The outcome in one line: each variable's value, or the decline reason.

NumericRootFindingResult.unbound_symbols#

UniffiNumericRootFindingResult method

func unboundSymbols() -> [String]

The symbols that are not variables, for an unbound_symbol decline.

NumericRootFindingResult.value#

UniffiNumericRootFindingResult method

func value(name: String) -> UniffiNumericValue?

The value of one variable, by name, when a root was returned.

NumericRootFindingResult.values#

UniffiNumericRootFindingResult method

func values() -> [UniffiNumericValue]

One value per variable, in the variables' order; empty for a declined request.

NumericRootFindingResult.variable_values#

UniffiNumericRootFindingResult method

func variableValues() -> [UniffiTextNumericValueTuple]

Each variable's name paired with its value, in the variables' order.

NumericRootFindingResult.variables#

UniffiNumericRootFindingResult method

func variables() -> [String]

The variable names, in the order the values are given.

NumericRootFindingResult.working_precision_bits#

UniffiNumericRootFindingResult method

func workingPrecisionBits() -> UInt64

The last working precision used, in bits.

NumericRootIsolationResult.complete#

UniffiNumericRootIsolationResult method

func complete() -> Bool

Whether every root of the requested domain is accounted for by an enclosure.

NumericRootIsolationResult.coverage#

UniffiNumericRootIsolationResult method

func coverage() -> UniffiNumericRootCoverage?

How much of the requested domain the enclosures account for.

NumericRootIsolationResult.decline_reason#

UniffiNumericRootIsolationResult method

func declineReason() -> UniffiNumericRootIsolationDeclineReason?

The reason, present exactly when the verdict is declined.

NumericRootIsolationResult.enclosures#

UniffiNumericRootIsolationResult method

func enclosures() -> [UniffiNumericRootEnclosure]

The disjoint certified enclosures, in ascending order.

NumericRootIsolationResult.precision_bits#

UniffiNumericRootIsolationResult method

func precisionBits() -> UInt64?

The working precision the accepted enclosures were produced at.

NumericRootIsolationResult.unresolved_regions#

UniffiNumericRootIsolationResult method

func unresolvedRegions() -> [UniffiNumericRootUnresolvedRegion]

The regions the search could neither clear nor resolve into an enclosure.

NumericRootIsolationResult.verdict#

UniffiNumericRootIsolationResult method

func verdict() -> UniffiNumericRootIsolationVerdict

Whether the search ran or declined.

NumericRootUnresolvedRegion.lower#

UniffiNumericRootUnresolvedRegion method

func lower() -> UniffiExpression?

The lower endpoint, absent when the region reaches negative infinity.

NumericRootUnresolvedRegion.upper#

UniffiNumericRootUnresolvedRegion method

func upper() -> UniffiExpression?

The upper endpoint, absent when the region reaches positive infinity.

NumericValue.accuracy#

UniffiNumericValue method

func accuracy() -> UniffiNumericAccuracy

Whether the radii are proved bounds or estimates.

NumericValue.achieved_relative_precision_bits#

UniffiNumericValue method

func achievedRelativePrecisionBits() -> UInt64?

The relative accuracy in bits, absent when both components are exact.

NumericValue.certified_sign#

UniffiNumericValue method

func certifiedSign() -> Int64?

The proved sign of a real value, absent when it is not proved.

NumericValue.contains_zero#

UniffiNumericValue method

func containsZero() -> Bool

Whether zero lies within the stated radius of both components.

NumericValue.error_bound#

UniffiNumericValue method

func errorBound() -> UniffiNumericValue?

A proved bound on the error of a certified value.

NumericValue.error_estimate#

UniffiNumericValue method

func errorEstimate() -> UniffiNumericValue?

The estimated error of an estimated value.

NumericValue.imaginary_part#

UniffiNumericValue method

func imaginaryPart() -> UniffiNumericValue

The imaginary part, with the same accuracy.

NumericValue.is_exactly_real#

UniffiNumericValue method

func isExactlyReal() -> Bool

Whether the value is known to be real.

NumericValue.is_exactly_zero#

UniffiNumericValue method

func isExactlyZero() -> Bool

Whether the value is known to be exactly zero.

NumericValue.real_part#

UniffiNumericValue method

func realPart() -> UniffiNumericValue

The real part, with the same accuracy.

NumericValue.requested_significant_digits#

UniffiNumericValue method

func requestedSignificantDigits() -> UInt64

The number of significant digits the value was requested with.

NumericValue.summary#

UniffiNumericValue method

func summary() -> String

The value at its requested digits followed by its accuracy.

NumericValue.to_complex_f64#

UniffiNumericValue method

func toComplexF64() -> UniffiFloatingPointFloatingPointTuple

The nearest doubles to the real and imaginary midpoints.

NumericValue.to_decimal_string#

UniffiNumericValue method

func toDecimalString(significantDigits: UInt64) -> String

The value in decimal with at most the given faithful digits per component.

NumericValue.to_f64#

UniffiNumericValue method

func toF64() -> Double

The nearest double to the midpoint of a value known to be exactly real.

NumericValue.to_latex#

UniffiNumericValue method

func toLatex(significantDigits: UInt64) -> String

The value in LaTeX with at most the given faithful digits per component.

NumericValue.to_rational#

UniffiNumericValue method

func toRational() -> UniffiExpression

The exact midpoint as an exact expression.

NumericValue.to_simplest_rational#

UniffiNumericValue method

func toSimplestRational() -> UniffiExpression

The simplest rational inside each component's ball.

compile_numeric_function#

Explicit context

func compileNumericFunction(
    outputs: UniffiNumericFunctionOutputs,
    variables: [UniffiExpression],
    options: UniffiNumericFunctionOptions,
) -> UniffiCompiledNumericFunction

Compile a scalar, a vector, or a matrix of exact outputs for repeated binary64 evaluation over ordered variables.

evaluate_numeric#

Explicit context

func evaluateNumeric(
    inputExpression: UniffiExpression,
    options: UniffiNumericOptions,
) -> UniffiNumericValue

The numeric value of a closed expression to the requested significant digits.

Calling forms

Expression method: UniffiExpression.evaluateNumeric

func evaluateNumeric(options: UniffiNumericOptions) -> UniffiNumericValue

evaluate_numeric_detailed#

Explicit context

func evaluateNumericDetailed(
    inputExpression: UniffiExpression,
    options: UniffiNumericOptions,
    substitutions: [UniffiExpressionExpressionTuple],
    numericSubstitutions: [UniffiExpressionNumericValueTuple],
) -> UniffiNumericEvaluationReport

The report of a numeric evaluation: its value, or why it declined.

evaluate_numeric_with_substitutions#

Explicit context

func evaluateNumericWithSubstitutions(
    inputExpression: UniffiExpression,
    options: UniffiNumericOptions,
    substitutions: [UniffiExpressionExpressionTuple],
    numericSubstitutions: [UniffiExpressionNumericValueTuple],
) -> UniffiNumericValue

The numeric value of an expression with symbols bound to exact or numeric values.

evaluate_to_float#

Expression method

func evaluateToFloat() -> Double

The nearest double to the certified real value; raises unless the value is certified and exactly real (free symbols, complex values, poles, and estimated-only heads all raise).

find_root_numeric#

Explicit context

func findRootNumeric(
    equations: [UniffiExpression],
    variables: [String],
    start: [UniffiExpression],
    domain: UniffiNumericRootFindingDomain,
    method: UniffiNumericRootFindingMethod,
    options: UniffiNumericOptions,
) -> UniffiNumericRootFindingResult

Find one root of the square system equations = 0 numerically, starting from start (one value per variable, real or complex).

find_root_numeric_in_bracket#

Explicit context

func findRootNumericInBracket(
    equation: UniffiExpression,
    variable: String,
    lower: UniffiExpression,
    upper: UniffiExpression,
    options: UniffiNumericOptions,
) -> UniffiNumericRootFindingResult

Find one real root of equation = 0 in the bracket [lower, upper], whose ends are exact rational numbers at which the equation's values have opposite signs.

integrate_definite_numeric#

Explicit context

func integrateDefiniteNumeric(
    inputExpression: UniffiExpression,
    variable: String,
    lower: UniffiExpression,
    upper: UniffiExpression,
    options: UniffiNumericOptions,
) -> UniffiNumericValue

The numerical value of a definite integral, to options.significant_digits digits.

isolate_real_roots_numeric#

Explicit context

func isolateRealRootsNumeric(
    inputExpression: UniffiExpression,
    variable: String,
    lower: UniffiExpression,
    upper: UniffiExpression,
    precisionBits: UInt64,
    workBudget: UInt64,
) -> UniffiNumericRootIsolationResult

Isolate the real roots of an expression with certified rational enclosures.

polynomial_roots_numeric#

Explicit context

func polynomialRootsNumeric(
    polynomial: UniffiExpression,
    variable: String,
    options: UniffiNumericOptions,
) -> UniffiNumericPolynomialRootsResult

Find every complex root of the polynomial polynomial in variable numerically, each once with its exact multiplicity.

rational_from_float#

Explicit context

func rationalFromFloat(
    value: Double,
    maximumDenominator: UInt64,
) -> UniffiExpression

Closest rational with denominator ≤\leq max_denominator (the Fraction.limit_denominator algorithm).

summation_numeric#

Explicit context

func summationNumeric(
    summand: UniffiExpression,
    index: String,
    lower: UniffiExpression,
    upper: UniffiExpression,
    options: UniffiNumericOptions,
) -> UniffiNumericValue

The numerical value of a definite sum, to options.significant_digits digits.

affine_process_transformation#

Explicit context

func affineProcessTransformation(
    name: String,
    source: UniffiExpression,
    multiplier: UniffiExpression,
    offset: UniffiExpression,
) -> UniffiExpression

Construct the exact pointwise affine image of a certified Gaussian process.

archimedean_copula#

Explicit context

func archimedeanCopula(
    family: String,
    marginals: [UniffiExpression],
    parameter: UniffiExpression,
) -> UniffiExpression

Construct a supported Archimedean copula from continuous marginals and its parameter.

characteristic_function#

Explicit context

func characteristicFunction(
    randomVariable: UniffiExpression,
    auxiliaryVariable: String,
) -> UniffiExpression

Closed-form characteristic function φX(t)\varphi_X(t) of random_variable in the named auxiliary variable, when elementary; otherwise an unevaluated structural form.

component#

Explicit context

func component(
    randomVector: UniffiExpression,
    position: UInt64,
) -> UniffiExpression

Expose the native joint-law operation through the session worker.

conditional_process_slice_distribution#

Explicit context

func conditionalProcessSliceDistribution(
    process: UniffiExpression,
    selectedIndices: [UniffiExpression],
    conditioningIndices: [UniffiExpression],
    conditioningValues: [UniffiExpression],
) -> UniffiExpression

Condition one finite process slice on another through the common continuous-law engine.

covariance#

Explicit context

func covariance(
    left: UniffiExpression,
    right: UniffiExpression,
    randomVariables: [UniffiExpression],
) -> UniffiExpression

Covariance of left and right over the listed independent random variables; zero for independent operands.

cumulant#

Explicit context

func cumulant(
    randomVariable: UniffiExpression,
    order: UniffiExpression,
) -> UniffiExpression

The order-th cumulant of random_variable.

cumulative_distribution#

Explicit context

func cumulativeDistribution(
    randomVariable: UniffiExpression,
    point: UniffiExpression,
) -> UniffiExpression

Cumulative distribution function of random_variable evaluated at point.

density#

Explicit context

func density(
    randomVariable: UniffiExpression,
    point: UniffiExpression,
) -> UniffiExpression

Probability density (continuous families) or probability mass (discrete families) of random_variable evaluated at point.

dirichlet#

Explicit context

func dirichlet(parameters: [UniffiExpression]) -> UniffiExpression

Expose the native joint-law operation through the session worker.

discrete_markov_chain#

Explicit context

func discreteMarkovChain(
    name: String,
    states: [UniffiExpression],
    transitionMatrix: UniffiMatrix,
    initialProbabilities: [UniffiExpression],
) -> UniffiExpression

Construct an exact finite-state time-homogeneous Markov chain.

distribution#

Explicit context

func distribution(
    name: String,
    parameters: [UniffiExpression],
) -> UniffiExpression

Build a distribution node from a family name and its ordered parameter list (e.g. distribution("normal", [mean, standard_deviation])).

estimate_archimedean_copula_parameter#

Explicit context

func estimateArchimedeanCopulaParameter(
    family: String,
    observations: UniffiMatrix,
) -> UniffiExpression

Estimate an exactly invertible Archimedean copula parameter from bivariate ranks.

estimate_archimedean_copula_parameter_numeric#

Explicit context

func estimateArchimedeanCopulaParameterNumeric(
    family: String,
    observations: UniffiMatrix,
    parameter: UniffiExpression,
    lower: UniffiExpression,
    upper: UniffiExpression,
    options: UniffiNumericOptions,
) -> UniffiNumericRootFindingResult

Numerically estimate a Frank copula parameter from exact bivariate ranks in a requested bracket.

expectation#

Explicit context

func expectation(
    target: UniffiExpression,
    randomVariables: [UniffiExpression],
) -> UniffiExpression

Expectation of target over the listed independent random variables. Linearity and the constant-factor lift are applied; bare and power-of-random-variable leaves consume the distribution's mean and raw moments.

expected_hitting_time#

Explicit context

func expectedHittingTime(
    process: UniffiExpression,
    startState: UniffiExpression,
    targetStates: [UniffiExpression],
) -> UniffiExpression

Return the exact expected time to reach a target state set.

finite_dimensional_random_vector#

Explicit context

func finiteDimensionalRandomVector(
    process: UniffiExpression,
    indices: [UniffiExpression],
    coordinateNames: [String],
) -> UniffiExpression

Construct a random vector from an ordered finite stochastic-process slice.

gaussian_copula#

Explicit context

func gaussianCopula(
    marginals: [UniffiExpression],
    correlation: UniffiMatrix,
) -> UniffiExpression

Construct a Gaussian copula from continuous marginals and a correlation matrix.

hitting_probability#

Explicit context

func hittingProbability(
    process: UniffiExpression,
    startState: UniffiExpression,
    targetStates: [UniffiExpression],
) -> UniffiExpression

Return the exact probability of ever reaching a target state set.

independent_gaussian_process_sum#

Explicit context

func independentGaussianProcessSum(
    name: String,
    firstSource: UniffiExpression,
    secondSource: UniffiExpression,
) -> UniffiExpression

Construct the pointwise sum of two explicitly independent Gaussian processes.

independent_process_product#

Explicit context

func independentProcessProduct(
    firstProcess: UniffiExpression,
    firstIndices: [UniffiExpression],
    secondProcess: UniffiExpression,
    secondIndices: [UniffiExpression],
) -> UniffiExpression

Construct the explicit independent block product of two finite process slices.

independent_product#

Explicit context

func independentProduct(factors: [UniffiExpression]) -> UniffiExpression

Expose the native joint-law operation through the session worker.

intrinsic_simplex_density#

Explicit context

func intrinsicSimplexDensity(
    jointDistribution: UniffiExpression,
    points: [UniffiExpression],
) -> UniffiExpression

Expose the native joint-law operation through the session worker.

joint_correlation_matrix#

Explicit context

func jointCorrelationMatrix(jointDistribution: UniffiExpression) -> UniffiMatrix

Expose the native joint-law operation through the session worker.

joint_covariance_matrix#

Explicit context

func jointCovarianceMatrix(jointDistribution: UniffiExpression) -> UniffiMatrix

Expose the native joint-law operation through the session worker.

joint_cumulative_distribution#

Explicit context

func jointCumulativeDistribution(
    jointDistribution: UniffiExpression,
    points: [UniffiExpression],
) -> UniffiExpression

Expose the native joint-law operation through the session worker.

joint_density#

Explicit context

func jointDensity(
    jointDistribution: UniffiExpression,
    points: [UniffiExpression],
) -> UniffiExpression

Expose the native joint-law operation through the session worker.

joint_distribution#

Explicit context

func jointDistribution(randomVector: UniffiExpression) -> UniffiExpression

Expose the native joint-law operation through the session worker.

joint_mean#

Explicit context

func jointMean(jointDistribution: UniffiExpression) -> [UniffiExpression]

Expose the native joint-law operation through the session worker.

joint_probability_mass_function#

Explicit context

func jointProbabilityMassFunction(
    jointDistribution: UniffiExpression,
    points: [UniffiExpression],
) -> UniffiExpression

Expose the native joint-law operation through the session worker.

joint_raw_moment#

Explicit context

func jointRawMoment(
    jointDistribution: UniffiExpression,
    orders: [UniffiExpression],
) -> UniffiExpression

Expose the native joint-law operation through the session worker.

joint_rectangle_probability#

Explicit context

func jointRectangleProbability(
    jointDistribution: UniffiExpression,
    lowerBounds: [UniffiExpression],
    upperBounds: [UniffiExpression],
) -> UniffiExpression

Expose the native joint-law operation through the session worker.

joint_support#

Explicit context

func jointSupport(jointDistribution: UniffiExpression) -> UniffiExpression

Expose the native joint-law operation through the session worker.

marginal#

Explicit context

func marginal(
    jointDistribution: UniffiExpression,
    positions: [UInt64],
) -> UniffiExpression

Expose the native joint-law operation through the session worker.

maximum#

Explicit context

func maximum(
    baseLaw: UniffiExpression,
    sampleSize: UniffiExpression,
) -> UniffiExpression

Construct the maximum of an i.i.d. sample from a scalar law.

minimum#

Explicit context

func minimum(
    baseLaw: UniffiExpression,
    sampleSize: UniffiExpression,
) -> UniffiExpression

Construct the minimum of an i.i.d. sample from a scalar law.

moment#

Explicit context

func moment(
    randomVariable: UniffiExpression,
    order: UniffiExpression,
) -> UniffiExpression

The order-th raw moment E[X^order] of random_variable.

moment_generating_function#

Explicit context

func momentGeneratingFunction(
    randomVariable: UniffiExpression,
    auxiliaryVariable: String,
) -> UniffiExpression

Closed-form moment generating function M_X(t) of random_variable in the named auxiliary variable, when elementary; otherwise an unevaluated structural form.

multinomial_distribution#

Explicit context

func multinomialDistribution(
    trialCount: UniffiExpression,
    probabilities: [UniffiExpression],
) -> UniffiExpression

Expose the native joint-law operation through the session worker.

multivariate_normal#

Explicit context

func multivariateNormal(
    mean: [UniffiExpression],
    covariance: UniffiMatrix,
) -> UniffiExpression

Expose the native joint-law operation through the session worker.

order_statistic#

Explicit context

func orderStatistic(
    baseLaw: UniffiExpression,
    sampleSize: UniffiExpression,
    rank: UniffiExpression,
) -> UniffiExpression

Construct the rank order statistic of an i.i.d. sample from a scalar law.

permute#

Explicit context

func permute(
    jointDistribution: UniffiExpression,
    permutation: [UInt64],
) -> UniffiExpression

Expose the native joint-law operation through the session worker.

probability#

Explicit context

func probability(
    predicate: UniffiExpression,
    randomVariables: [UniffiExpression],
) -> UniffiExpression

Probability that predicate (a tail comparison such as X > t) holds over the listed independent random variables.

product_copula#

Explicit context

func productCopula(marginals: [UniffiExpression]) -> UniffiExpression

Construct the product copula of continuous scalar marginals.

quantile_numeric#

Explicit context

func quantileNumeric(
    distribution: UniffiExpression,
    probability: UniffiExpression,
    quantileVariable: UniffiExpression,
    lower: UniffiExpression,
    upper: UniffiExpression,
    options: UniffiNumericOptions,
) -> UniffiNumericRootFindingResult

Numerically invert a scalar distribution CDF on an explicitly supplied exact bracket.

random_variable#

Explicit context

func randomVariable(
    name: String,
    distribution: UniffiExpression,
) -> UniffiExpression

Build a random variable named name drawn from distribution.

random_vector#

Explicit context

func randomVector(
    coordinateNames: [String],
    jointDistribution: UniffiExpression,
) -> UniffiExpression

Expose the native joint-law operation through the session worker.

stationary_distributions#

Explicit context

func stationaryDistributions(process: UniffiExpression) -> UniffiMatrix

Return the extreme stationary laws of a finite Markov chain.

transition_probability#

Explicit context

func transitionProbability(
    process: UniffiExpression,
    fromState: UniffiExpression,
    toState: UniffiExpression,
    startIndex: UniffiExpression,
    endIndex: UniffiExpression,
) -> UniffiExpression

Return an exact finite-horizon Markov transition probability.

variance#

Explicit context

func variance(
    target: UniffiExpression,
    randomVariables: [UniffiExpression],
) -> UniffiExpression

Variance of target over the listed independent random variables.

beta#

Explicit context

func beta(
    left: UniffiExpression,
    right: UniffiExpression,
) -> UniffiExpression

The beta function B⁡(x,y)=Γ(x)Γ(y)/Γ(x+y)\operatorname{B}(x, y) = \Gamma(x)\Gamma(y)/\Gamma(x+y).

carlson_rc#

Explicit context

func carlsonRc(
    firstArgument: UniffiExpression,
    secondArgument: UniffiExpression,
) -> UniffiExpression

Carlson's degenerate symmetric elliptic integral RC(x,y)R_C(x,y).

carlson_rd#

Explicit context

func carlsonRd(
    firstArgument: UniffiExpression,
    secondArgument: UniffiExpression,
    thirdArgument: UniffiExpression,
) -> UniffiExpression

Carlson's symmetric elliptic integral RD(x,y,z)R_D(x,y,z).

carlson_rf#

Explicit context

func carlsonRf(
    firstArgument: UniffiExpression,
    secondArgument: UniffiExpression,
    thirdArgument: UniffiExpression,
) -> UniffiExpression

Carlson's symmetric elliptic integral RF(x,y,z)R_F(x,y,z).

carlson_rj#

Explicit context

func carlsonRj(
    firstArgument: UniffiExpression,
    secondArgument: UniffiExpression,
    thirdArgument: UniffiExpression,
    fourthArgument: UniffiExpression,
) -> UniffiExpression

Carlson's symmetric elliptic integral RJ(x,y,z,p)R_J(x,y,z,p).

chebyshev_polynomial_first_kind#

Explicit context

func chebyshevPolynomialFirstKind(
    degree: UniffiExpression,
    argument: UniffiExpression,
) -> UniffiExpression

The Chebyshev polynomial Tn(x)T_n(x).

chebyshev_polynomial_second_kind#

Explicit context

func chebyshevPolynomialSecondKind(
    degree: UniffiExpression,
    argument: UniffiExpression,
) -> UniffiExpression

The Chebyshev polynomial Un(x)U_n(x).

cosine_integral#

Explicit context

func cosineIntegral(argument: UniffiExpression) -> UniffiExpression

The cosine integral Ci⁡(x)\operatorname{Ci}(x), with Ci⁡′(x)=cos⁡(x)/x\operatorname{Ci}'(x) = \cos(x)/x.

digamma#

Explicit context

func digamma(argument: UniffiExpression) -> UniffiExpression

The digamma function ψ(x)=Γ′(x)/Γ(x)\psi(x) = \Gamma'(x)/\Gamma(x).

elliptic_e#

Explicit context

func ellipticE(parameter: UniffiExpression) -> UniffiExpression

The complete second-kind elliptic integral E(m)E(m), with parameter m=k2m=k^2.

elliptic_e_incomplete#

Explicit context

func ellipticEIncomplete(
    amplitude: UniffiExpression,
    parameter: UniffiExpression,
) -> UniffiExpression

The incomplete second-kind elliptic integral E(ϕ∣m)E(\phi\mid m), with parameter m=k2m=k^2.

elliptic_f#

Explicit context

func ellipticF(
    amplitude: UniffiExpression,
    parameter: UniffiExpression,
) -> UniffiExpression

The incomplete first-kind elliptic integral F(ϕ∣m)F(\phi\mid m), with parameter m=k2m=k^2.

elliptic_k#

Explicit context

func ellipticK(parameter: UniffiExpression) -> UniffiExpression

The complete first-kind elliptic integral K(m)K(m), with parameter m=k2m=k^2.

elliptic_pi#

Explicit context

func ellipticPi(
    characteristic: UniffiExpression,
    parameter: UniffiExpression,
) -> UniffiExpression

The complete third-kind elliptic integral Π(n∣m)\Pi(n\mid m), with parameter m=k2m=k^2.

elliptic_pi_incomplete#

Explicit context

func ellipticPiIncomplete(
    characteristic: UniffiExpression,
    amplitude: UniffiExpression,
    parameter: UniffiExpression,
) -> UniffiExpression

The incomplete third-kind elliptic integral Π(n;ϕ∣m)\Pi(n;\phi\mid m), with parameter m=k2m=k^2.

error_function#

Explicit context

func errorFunction(argument: UniffiExpression) -> UniffiExpression

The error function erf⁡(x)=2π∫0xe−t2 dt\operatorname{erf}(x) = \frac{2}{\sqrt{\pi}}\int_0^x e^{-t^2}\,dt.

error_function_complementary#

Explicit context

func errorFunctionComplementary(argument: UniffiExpression) -> UniffiExpression

The complementary error function erfc⁡(x)=1−erf⁡(x)\operatorname{erfc}(x) = 1 - \operatorname{erf}(x).

exponential_integral#

Explicit context

func exponentialIntegral(argument: UniffiExpression) -> UniffiExpression

The exponential integral Ei⁡(x)\operatorname{Ei}(x), with Ei⁡′(x)=ex/x\operatorname{Ei}'(x) = e^x/x.

fresnel_cosine_integral#

Explicit context

func fresnelCosineIntegral(argument: UniffiExpression) -> UniffiExpression

The Fresnel cosine integral C(x)=∫0xcos⁡(πt2/2) dtC(x) = \int_0^x \cos(\pi t^2/2)\,dt.

fresnel_sine_integral#

Explicit context

func fresnelSineIntegral(argument: UniffiExpression) -> UniffiExpression

The Fresnel sine integral S(x)=∫0xsin⁡(πt2/2) dtS(x) = \int_0^x \sin(\pi t^2/2)\,dt.

gamma#

Explicit context

func gamma(argument: UniffiExpression) -> UniffiExpression

The gamma function Γ(x)\Gamma(x), the analytic continuation of (x-1)!.

gegenbauer_polynomial#

Explicit context

func gegenbauerPolynomial(
    degree: UniffiExpression,
    parameter: UniffiExpression,
    argument: UniffiExpression,
) -> UniffiExpression

The Gegenbauer polynomial Cn(λ)(x)C_n^{(\lambda)}(x).

generalized_laguerre_polynomial#

Explicit context

func generalizedLaguerrePolynomial(
    degree: UniffiExpression,
    parameter: UniffiExpression,
    argument: UniffiExpression,
) -> UniffiExpression

The generalized Laguerre polynomial Ln(α)(x)L_n^{(\alpha)}(x).

hermite_polynomial#

Explicit context

func hermitePolynomial(
    degree: UniffiExpression,
    argument: UniffiExpression,
) -> UniffiExpression

The physicists' Hermite polynomial Hn(x)H_n(x).

hurwitz_zeta#

Explicit context

func hurwitzZeta(
    s: UniffiExpression,
    a: UniffiExpression,
) -> UniffiExpression

The Hurwitz zeta function ζ(s,a)=∑k≥0(k+a)−s\zeta(s, a) = \sum_{k\geq 0} (k+a)^{-s}, the numeric primitive of the family. hurwitz_zeta(s, 1) folds to zeta(s); hurwitz_zeta(s, 1/2) to (2s−1)ζ(s)(2^s - 1)\zeta(s); a positive integer second argument reduces to zeta(s) minus the finite head; a non-positive integer first argument gives a Bernoulli polynomial in a.

hypergeometric_0f1#

Explicit context

func hypergeometric0f1(
    lowerParameter: UniffiExpression,
    argument: UniffiExpression,
) -> UniffiExpression

The confluent limit 0F1(;b;z){}_0F_1(; b; z), lowered to hypergeometric_pfq.

hypergeometric_1f1#

Explicit context

func hypergeometric1f1(
    upperParameter: UniffiExpression,
    lowerParameter: UniffiExpression,
    argument: UniffiExpression,
) -> UniffiExpression

Kummer's confluent hypergeometric function 1F1(a;b;z){}_1F_1(a; b; z).

hypergeometric_2f1#

Explicit context

func hypergeometric2f1(
    firstUpperParameter: UniffiExpression,
    secondUpperParameter: UniffiExpression,
    lowerParameter: UniffiExpression,
    argument: UniffiExpression,
) -> UniffiExpression

The Gauss hypergeometric function 2F1(a,b;c;z){}_2F_1(a, b; c; z).

hypergeometric_pfq#

Explicit context

func hypergeometricPfq(
    upperParameters: [UniffiExpression],
    lowerParameters: [UniffiExpression],
    argument: UniffiExpression,
) -> UniffiExpression

The generalized hypergeometric function pFq(a;b;z){}_pF_q(\mathbf a; \mathbf b; z). The two parameter groups are ordered sequences: order and repetition are significant, so a set or frozenset is rejected.

imaginary_error_function#

Explicit context

func imaginaryErrorFunction(argument: UniffiExpression) -> UniffiExpression

The imaginary error function erfi⁡(x)=2π∫0xet2 dt=−ierf⁡(ix)\operatorname{erfi}(x) = \frac{2}{\sqrt{\pi}}\int_0^x e^{t^2}\,dt = -i\operatorname{erf}(ix).

jacobi_amplitude#

Explicit context

func jacobiAmplitude(
    argument: UniffiExpression,
    parameter: UniffiExpression,
) -> UniffiExpression

The pinned Jacobi amplitude am⁡(u∣m)\operatorname{am}(u\mid m), with parameter m=k2m=k^2.

jacobi_cn#

Explicit context

func jacobiCn(
    argument: UniffiExpression,
    parameter: UniffiExpression,
) -> UniffiExpression

Jacobi's elliptic function cn⁡(u∣m)\operatorname{cn}(u\mid m), with parameter m=k2m=k^2.

jacobi_dn#

Explicit context

func jacobiDn(
    argument: UniffiExpression,
    parameter: UniffiExpression,
) -> UniffiExpression

Jacobi's elliptic function dn⁡(u∣m)\operatorname{dn}(u\mid m), with parameter m=k2m=k^2.

jacobi_polynomial#

Explicit context

func jacobiPolynomial(
    degree: UniffiExpression,
    firstParameter: UniffiExpression,
    secondParameter: UniffiExpression,
    argument: UniffiExpression,
) -> UniffiExpression

The Jacobi polynomial Pn(α,β)(x)P_n^{(\alpha,\beta)}(x).

jacobi_sn#

Explicit context

func jacobiSn(
    argument: UniffiExpression,
    parameter: UniffiExpression,
) -> UniffiExpression

Jacobi's elliptic function sn⁡(u∣m)\operatorname{sn}(u\mid m), with parameter m=k2m=k^2.

jacobi_theta_1#

Explicit context

func jacobiTheta1(
    argument: UniffiExpression,
    halfPeriodRatio: UniffiExpression,
) -> UniffiExpression

Jacobi's first theta function θ1(z∣τ)\theta_1(z\mid\tau), with half-period ratio τ\tau.

jacobi_theta_2#

Explicit context

func jacobiTheta2(
    argument: UniffiExpression,
    halfPeriodRatio: UniffiExpression,
) -> UniffiExpression

Jacobi's second theta function θ2(z∣τ)\theta_2(z\mid\tau), with half-period ratio τ\tau.

jacobi_theta_3#

Explicit context

func jacobiTheta3(
    argument: UniffiExpression,
    halfPeriodRatio: UniffiExpression,
) -> UniffiExpression

Jacobi's third theta function θ3(z∣τ)\theta_3(z\mid\tau), with half-period ratio τ\tau.

jacobi_theta_4#

Explicit context

func jacobiTheta4(
    argument: UniffiExpression,
    halfPeriodRatio: UniffiExpression,
) -> UniffiExpression

Jacobi's fourth theta function θ4(z∣τ)\theta_4(z\mid\tau), with half-period ratio τ\tau.

laguerre_polynomial#

Explicit context

func laguerrePolynomial(
    degree: UniffiExpression,
    argument: UniffiExpression,
) -> UniffiExpression

The Laguerre polynomial, lowered to generalized Laguerre with parameter zero.

legendre_polynomial#

Explicit context

func legendrePolynomial(
    degree: UniffiExpression,
    argument: UniffiExpression,
) -> UniffiExpression

The Legendre polynomial Pn(x)P_n(x).

lerch_phi#

Explicit context

func lerchPhi(
    argument: UniffiExpression,
    order: UniffiExpression,
    shift: UniffiExpression,
) -> UniffiExpression

The principal Lerch transcendent Φ(z,s,a)\Phi(z, s, a).

log_gamma#

Explicit context

func logGamma(argument: UniffiExpression) -> UniffiExpression

The principal-branch log-gamma function (not log(gamma(x)) off the real axis).

logarithmic_integral#

Explicit context

func logarithmicIntegral(argument: UniffiExpression) -> UniffiExpression

The logarithmic integral li⁡(x)\operatorname{li}(x), with li⁡′(x)=1/log⁡(x)\operatorname{li}'(x) = 1/\log(x).

meijer_g#

Explicit context

func meijerG(
    upperNumeratorParameters: [UniffiExpression],
    upperDenominatorParameters: [UniffiExpression],
    lowerNumeratorParameters: [UniffiExpression],
    lowerDenominatorParameters: [UniffiExpression],
    argument: UniffiExpression,
) -> UniffiExpression

The Meijer G-function Gp,qm,nG_{p,q}^{m,n} from its four ordered parameter groups. The orders m, n, p, and q are read from the group lengths and are never supplied separately.

polygamma#

Explicit context

func polygamma(
    order: UniffiExpression,
    argument: UniffiExpression,
) -> UniffiExpression

The polygamma function ψ(n)(x)\psi^{(n)}(x), the order-th derivative of digamma; polygamma(0, x) reduces to digamma(x).

polylogarithm#

Explicit context

func polylogarithm(
    order: UniffiExpression,
    argument: UniffiExpression,
) -> UniffiExpression

The principal-branch polylogarithm Li⁡s(z)\operatorname{Li}_s(z).

sine_integral#

Explicit context

func sineIntegral(argument: UniffiExpression) -> UniffiExpression

The sine integral Si⁡(x)=∫0xsin⁡(t)/t dt\operatorname{Si}(x) = \int_0^x \sin(t)/t\,dt.

ultraspherical_polynomial#

Explicit context

func ultrasphericalPolynomial(
    degree: UniffiExpression,
    parameter: UniffiExpression,
    argument: UniffiExpression,
) -> UniffiExpression

The ultraspherical polynomial, lowered to the Gegenbauer head.

zeta#

Explicit context

func zeta(argument: UniffiExpression) -> UniffiExpression

The Riemann zeta function ζ(s)=∑k≥1k−s\zeta(s) = \sum_{k\geq 1} k^{-s}.

curl#

Explicit context

func curl(
    vectorComponents: [UniffiExpression],
    variables: [String],
) -> [UniffiExpression]

∇×F\nabla\times F.

divergence#

Explicit context

func divergence(
    vectorComponents: [UniffiExpression],
    variables: [String],
) -> UniffiExpression

∇⋅F=∑i∂Fi/∂xi\nabla\cdot F = \sum_i \partial F_i/\partial x_i; component and variable counts must match.

gradient#

Explicit context

func gradient(
    scalarField: UniffiExpression,
    variables: [String],
) -> [UniffiExpression]

∇f\nabla f: the partial derivatives in the order of variables.

hessian#

Explicit context

func hessian(
    scalarField: UniffiExpression,
    variables: [String],
) -> UniffiMatrix

The n×nn\times n matrix of second partials, computed as the Jacobian of the gradient; structurally symmetric on smooth input.

jacobian#

Explicit context

func jacobian(
    vectorComponents: [UniffiExpression],
    variables: [String],
) -> UniffiMatrix

The matrix with entry (i,j)=∂Fi/∂xj(i, j) = \partial F_i/\partial x_j (rows index components, columns index variables).

laplacian#

Explicit context

func laplacian(
    scalarField: UniffiExpression,
    variables: [String],
) -> UniffiExpression

Δf=∇⋅∇f\Delta f = \nabla\cdot\nabla f.

Symi documentation · Swift