2024-06-03

612: Simplicial Map

<The previous article in this series | The table of contents of this series | The next article in this series>

definition of simplicial map

Topics


About: vectors space

The table of contents of this article


Starting Context



Target Context


  • The reader will have a definition of simplicial map.

Orientation


There is a list of definitions discussed so far in this site.

There is a list of propositions discussed so far in this site.


Main Body


1: Structured Description


Here is the rules of Structured Description.

Entities:
V1: { the real vectors spaces }
V2: { the real vectors spaces }
C1: { the simplicial complexes on V1}
C2: { the simplicial complexes on V2}
f: :VertC1VertC2
//

Conditions:
{p0,...,pn}VertC1 such that {p0,...,pn} spans a simplex in C1({f(p0),...,f(pn)} spans a simplex in C2).
//


2: Natural Language Description


For any real vectors spaces, V1,V2, and any simplicial complexes, C1, on V1 and C2, on V2, any map, f:VertC1VertC2, such that for each {p0,...,pn}VertC1 that spans a simplex in C1, {f(p0),...,f(pn)} spans a simplex in C2


3: Note


"{p0,...,pn} spans a simplex in C1" is not equal to '[p0,...,pn] is a simplex in C1' when {p0,...,pn} contains some duplications, but supposing that the duplications have been removed, they are equal by the proposition that for any simplicial complex, each vertex of each simplex that is on any another simplex is a vertex of the latter simplex: each pj is on the spanned simplex, so, pj is a vertex of the simplex, and the spanned simplex is nothing but [p0,...,pn]. "{f(p0),...,f(pn)} spans a simplex in C2" is likewise.


References


<The previous article in this series | The table of contents of this series | The next article in this series>