Difference between revisions of "User:Alec"

From Maths
Jump to: navigation, search
m
m
Line 13: Line 13:
 
: Or [[/Goals]]
 
: Or [[/Goals]]
 
: Or [[/Manifolds pages]]
 
: Or [[/Manifolds pages]]
 +
: Or [[/Link templates]] added: [[User:Alec|Alec]] ([[User talk:Alec|talk]]) 02:07, 31 December 2017 (UTC)
 
==[[User:Alec/Noticeboard|Noticeboard]]==
 
==[[User:Alec/Noticeboard|Noticeboard]]==
 
{{:User:Alec/Noticeboard}}
 
{{:User:Alec/Noticeboard}}

Revision as of 02:07, 31 December 2017

Hi, I'm Alec Teal; the admin of this site and creator of most of the content. Write a note on my talk page for requests!

Don't forget about: Category:Finished notes
Or User:Alec/BookTemplate
Or User:Alec/NewTodoTemplate
Or Characteristic property of the disjoint union topology/Proof
Or User:Alec/ParametricPages
Or /Modules
Or /Unnamed inequality
Or /Exam Qs
Or /Questions to do
Or /Pages to do
Or /Goals
Or /Manifolds pages
Or /Link templates added: Alec (talk) 02:07, 31 December 2017 (UTC)

Noticeboard

As of Thursday, 10/Apr/2025 at 18:40:

Watchdogs

Things not to forget

Pages being worked on

Notation

Symbol Command
\trianglelefteq
\triangleq
\ntrianglelefteq

Current projects

Currently ensuring that all existing measure theory articles are "up to a decent standard" and working on Measure Theory, following Halmos' example (rings).

Notes

Diagram for Characteristic property of the product topology:

Diagram

Characteristic property of the subspace topology:

  • SP(X)[YKP(P(Y))(if (Y,K) is a topology thenT(Y,K)[fP(Y×X)relations from X to Y(if f is afunction thenF(f)[C(f)C(ιSf)])])]

Things I want to use

Linked list documentation diagram:

            /*
             * B is the node to be removed.
             * We do this by binding A forward to C
             * 
             * BEFORE: 
             * ---> +---+---------> +---+---------> +---+-----
             *....  | A |           | B |           | C |    ....
             * -----+---+ <---------+---+ <---------+---+ <---
             * 
             * AFTER:       ,------------------.
             * ---> +---+--'        +---+-------'-> +---+-----
             *....  | A |           | B |           | C |    ....
             * -----+---+ <-.-------+---+        ,--+---+ <---
             *               `------------------'
             * 
             *  Note that B.previous.bindForwards(B.next) is the same
             *  as B.next.bindBackwards(B.previous)
             *  A nice side-effect of this is that provided one has a 
             *  ref counting scheme in place (which you need basically
             *  need for safe multi-threaded schemes anyway) any iterators
             *  "pointing" to B remain valid.
             *  Make sure that this "rail-road" situation where going
             *  forward and back MIGHT not be inverses is well documented
             *  and expected.
             */