|
Translingual
editSymbol
edit⇝
- (mathematics) leads to (a conclusion); the next step (in an algorithm or in solving a problem).
- For example, given the equation (x − a)(x − c) = 0, if it's been shown that x − c ≠ 0, one might then write
- (x − a)(x − c) = 0 ⇝ x − a = 0.
- For example, given the equation (x − a)(x − c) = 0, if it's been shown that x − c ≠ 0, one might then write
- (graph theory) is reachable from.
- For example, in a directed graph u ⇝ v means v is reachable from u, for vertices u and v.
- (topology) specializes to.
- For example, x1 ⇝ x0, where x0 and x1 are two points of a topological space, and x0 ∈ {x1} (every open neighborhood of x0 contains x1).
- (set analysis) f : A ⇝ B means that f is a set-valued map from A to B.[1]
References
edit- ^ J.-P. Aubin & H. Frankowska (2009) Set-Valued Analysis. Birkhäuser Boston.