Sets
Sets are ordinary Expression values; constructors route through
auto-simplification (degenerate intervals collapse, unions splice and
deduplicate, etc.). Take results apart with the structural accessors on the
expressions page.
interval#
Default context
interval(
lower: ExpressionLike,
upper: ExpressionLike,
lower_open: bool = False,
upper_open: bool = False,
) -> ExpressionCalling forms
Explicit context: Context.interval
interval(
lower: ExpressionLike,
upper: ExpressionLike,
lower_open: bool = False,
upper_open: bool = False,
) -> ExpressionReal-line interval. Closed by default; endpoints at infinity are forced open. Degenerate shapes collapse (empty interval empty set, single point finite set, real line).
real_line#
Default context
real_line: ExpressionThe set .
complex_plane#
Default context
complex_plane: ExpressionThe set — the ambient universe, and the domain a variable ranges over when it carries no realness assumption.
integer_set#
Default context
integer_set: ExpressionThe set .
empty_set#
Default context
empty_set: ExpressionThe empty set .
finite_set#
Default context
finite_set(elements: Any) -> ExpressionFinite set; elements are deduplicated and canonically ordered. An empty list gives the empty set.
set_union#
Default context
set_union(set_a: ExpressionLike, set_b: ExpressionLike) -> ExpressionCalling forms
Explicit context: Context.set_union
set_union(set_a: ExpressionLike, set_b: ExpressionLike) -> ExpressionUnion, computed eagerly where the structural rules allow (overlapping or
touching interval pairs merge; nested unions splice, drops, absorbs);
otherwise the structural set_union node.
set_intersection#
Default context
set_intersection(
set_a: ExpressionLike,
set_b: ExpressionLike,
) -> ExpressionCalling forms
Explicit context: Context.set_intersection
set_intersection(
set_a: ExpressionLike,
set_b: ExpressionLike,
) -> ExpressionIntersection, computed eagerly where the structural rules allow (interval
pairs, finite-set membership filtering; drops, absorbs); otherwise the
structural set_intersection node.
set_complement#
Default context
set_complement(
set_a: ExpressionLike,
set_b: ExpressionLike,
) -> ExpressionCalling forms
Explicit context: Context.set_complement
set_complement(
set_a: ExpressionLike,
set_b: ExpressionLike,
) -> ExpressionThe relative complement .
image_set#
Default context
image_set(
lambda_expression: ExpressionLike,
variable: VariableLike,
domain: ExpressionLike,
) -> ExpressionCalling forms
Explicit context: Context.image_set
image_set(
lambda_expression: ExpressionLike,
variable: VariableLike,
domain: ExpressionLike,
) -> ExpressionThe set ; variable is a binder
over lambda_expression. Finite domains are enumerated element-wise at
construction.
condition_set#
Default context
condition_set(
variable: VariableLike,
condition: ExpressionLike,
domain: ExpressionLike,
) -> ExpressionCalling forms
Explicit context: Context.condition_set
condition_set(
variable: VariableLike,
condition: ExpressionLike,
domain: ExpressionLike,
) -> ExpressionThe set . This is also solveset's honest
"unsolved" residue shape.
is_member#
Default context
is_member(
element: ExpressionLike,
set: ExpressionLike,
) -> Optional[bool]Calling forms
Explicit context: Context.is_member
is_member(
element: ExpressionLike,
set: ExpressionLike,
) -> Optional[bool]Three-valued membership: True only on structural proof, False only on a
structural counterexample, None otherwise. Covers , , finite sets,
intervals, unions, intersections, complements.
is_subset#
Default context
is_subset(
set_a: ExpressionLike,
set_b: ExpressionLike,
) -> Optional[bool]Calling forms
Explicit context: Context.is_subset
is_subset(
set_a: ExpressionLike,
set_b: ExpressionLike,
) -> Optional[bool]Three-valued subset query: anything, structural equality, finite-set
element checks, interval-in-interval endpoint tests; None otherwise.
enumerate_set_in_interval#
Default context
enumerate_set_in_interval(
set: ExpressionLike,
lower: ExpressionLike,
upper: ExpressionLike,
lower_inclusive: bool = True,
upper_inclusive: bool = True,
limit: Optional[int] = None,
) -> AnyCalling forms
Explicit context: Context.enumerate_set_in_interval
enumerate_set_in_interval(
set: ExpressionLike,
lower: ExpressionLike,
upper: ExpressionLike,
lower_inclusive: bool = True,
upper_inclusive: bool = True,
limit: Optional[int] = None,
) -> AnyExact elements of a set inside , 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. Handles finite sets, affine image sets over , unions,
complements, and the unevaluated set_intersection(interval, image_set) shape solveset_in_domain
returns for a lattice too wide to materialize. limit defaults to 64. WASM returns a
SetEnumeration object with outcome and elements getters.
Example#
Set construction and membership over exact elements.
import symi
x = symi.symbol("x")
left = symi.finite_set([1, 2, 3])
right = symi.finite_set([2, 3, 4])
print(symi.set_union(left, right))
print(symi.set_intersection(left, right))
print(symi.is_member(2, left))
print(symi.solveset(symi.sin(x), "x"))Additional API#
iter#
Expression method
__iter__() -> AnyIterate the elements of a finite_set expression.
len#
Expression method
__len__() -> intNumber of elements of a finite_set expression.