Notes:Delta complex/Formal attempt
From Maths
Formal attempt
We try and keep everything combinatorial, so keep an abstract simplicial complex in the back of your mind, and a simplex as being like {a,b,c} for a triangle and such.
Notations:
- Let #(n):={1,…,n}⊂N - I did want to use C(n) for "count" or "consecutive" but given the context that'd be a poor choice!
- Consider #(n) as a poset in its own right (in fact a total order is in play) with the "usual" ordering on N it inherits. This is a standard substructure construction.
- Let K be our Delta complex, let us sidestep defining exactly what this is now, as a tuple of sets.
- Let Sn(K) be the set of n-simplices of K
- Let I(m,n) be defined to be equal the collection of all injective monotonic functions of the form f:#(m+1)→#(n+1)[Note 1]
- The +1 comes from the definition: Dim(σ):=|σ|−1∈N - we take care with the case σ=∅ as I'm developing a framework including this and come up with 2 "null objects" that do not alter the theory, for now Dim(∅)=−1 will do. It wont matter.
- Δm be the standard m-simplex in Rm+1
- G(n,m) - this is our goal, it's a collection of a bunch of maps of the form G:Sn(K)→Sm(K) {{Caveat|Notice the flip of n and m) with certain properties.
- Our goal is to find a bijection, say F:I(m,n)→G(n,m)
First stab
- Let m,n∈N be given such that m≤n.
- Let f∈I(m,n) be given, so f:#(m+1)→#(n+1) is an injection and is monotonic - as per the definition of I(m,n).
- We associate f with Lf:Rm+1→Rn+1 which is a linear map defined by its action on a basis as Lf(ei):=ef(i) where ei∈Rwhatever is a tuple that has 0 in every entry except the ith which has 1; as usual.[Note 2]
- It is fairly easy to see that Ker(Mf)={0}, then by "a linear map is injective if and only if its kernel is trivial" and "the image of a linear map is a vector subspace of the codomain" wee see that:
- Lf:Rm+1→Lf(Rm+1) is a linear isomorphism
- As Rm+1 is finite dimensional we see that Lf is a continuous map
- It is fairly easy to see that Ker(Mf)={0}, then by "a linear map is injective if and only if its kernel is trivial" and "the image of a linear map is a vector subspace of the codomain" wee see that:
- We associate f with Lf:Rm+1→Rn+1 which is a linear map defined by its action on a basis as Lf(ei):=ef(i) where ei∈Rwhatever is a tuple that has 0 in every entry except the ith which has 1; as usual.[Note 2]
- Let f∈I(m,n) be given, so f:#(m+1)→#(n+1) is an injection and is monotonic - as per the definition of I(m,n).
Notes
- Jump up ↑ This basically means:
- ∀x,y∈#(m+1)[x<y⟹f(x)<f(y)] - notice the strict ordering used here. This ensures that it is 1-to-1. We can never have equality of f(x) and f(y)
- Caveat:Not proved yet TODO: Do the proof!
- Caveat:Not proved yet
- ∀x,y∈#(m+1)[x<y⟹f(x)<f(y)] - notice the strict ordering used here. This ensures that it is 1-to-1. We can never have equality of f(x) and f(y)
- Jump up ↑ There's some abuse of notation going on here, as if ei∈Rn then ei∉Rm with m≠n of course. We identify Rm with a subspace of Rn where n≥m spanned by the first m basis vectors. It's not that big of a leap, so shouldn't require any more discussion