Tricki - Article requests
http://www.tricki.org/taxonomy/term/4/0
enConstructive mathematics
http://www.tricki.org/node/377
<p>Do you think there would be sufficient interest for articles "how to tell if my proof is constructive" and "how to make constructive proofs". Most proofs are mostly constructive and there is a limited set of "gotchas" that one has to be aware of. Also, proofs which are not constructive can often be made constructive by a simple change. I could write such articles or aticle. Probably it's better to start with a single article and split it up if and when it gets too big.</p>http://www.tricki.org/node/377#commentsArticle requestsFri, 08 May 2009 11:35:11 +0000AndrejBauer377 at http://www.tricki.orgA general idea in "for all" statements
http://www.tricki.org/node/365
<p>I have a proposition for the page <a href="/article/Proving_for_all_statements">Proving "for all" statements</a>.</p>
<p>There is a more general approach/view, which generalize <a href="/article/induction_front_page" class="redirect" title="The name of this article has changed">induction</a> and
the articles in the subsection
<a href="/article/Prove_the_result_for_some_cases_and_deduce_it_for_the_rest">Prove the result for some cases and deduce it for the rest</a>.</p>
<p>It is the following: If you have to show a statement <span style="vertical-align: -4px;"><img class="inline_tex" src="/images/tex/fadec1aa9d79755e2af72c6f3d10f359.png" alt=" A(x) " /></span>
it is useful to exploit the structure of the set <span class="inline_tex_nowrap"><span style="vertical-align: 0px;"><img class="inline_tex" src="/images/tex/02129bb861061d1a052c592e2dc6b383.png" alt="X" /></span>.</span></p>
<p>If there are for example some operations <span style="vertical-align: -3px;"><img class="inline_tex" src="/images/tex/dbd0721bf6c121e196d6b84fa7e9e6cd.png" alt="T_1,...T_k" /></span> acting on <span style="vertical-align: 0px;"><img class="inline_tex" src="/images/tex/02129bb861061d1a052c592e2dc6b383.png" alt="X" /></span> such that
you can write every <span style="vertical-align: -1px;"><img class="inline_tex" src="/images/tex/4202025ca33a0244467654fcec511b07.png" alt="x \in X" /></span> as <span style="vertical-align: -7px;"><img class="inline_tex" src="/images/tex/a6c32715075f0bef6e37b27b9617ad3b.png" alt="T_{i_1}^{n_1}...T_{i_m}^{n_m}x_0" /></span> with a special point <span style="vertical-align: -2px;"><img class="inline_tex" src="/images/tex/3e0d691f3a530e6c7e079636f20c111b.png" alt="x_0" /></span> and you can show:</p>
<p>1)</p><p><a href="http://www.tricki.org/node/365" target="_blank">read more</a></p>http://www.tricki.org/node/365#commentsArticle requestsTue, 05 May 2009 14:20:55 +0000luke365 at http://www.tricki.orgWhen constructing sequences, keep track of the size of the terms (elementary real analysis)
http://www.tricki.org/node/350
<p>The example that sticks in my mind is proving that k-cells <span style="vertical-align: -4px;"><img class="inline_tex" src="/images/tex/0ed6caf0732375180f0da789e16ef948.png" alt="[a,b]^k" /></span> are compact. The proof is by contradiction: suppose that an open over has no finite subcover, and find a sequence of nested k-cells with no finite subcover. Eventually, one must be small enough to be covered with one neighborhood. When I first attempted the proof, I figured this much out for myself, but I didn't think to put a bound on the size of the terms and couldn't finish the proof. Now it seems like an obvious trick.</p><p><a href="http://www.tricki.org/node/350" target="_blank">read more</a></p>http://www.tricki.org/node/350#commentsArticle requestsSun, 03 May 2009 15:10:49 +0000Brendan Murphy350 at http://www.tricki.orgcomputing integrals by differentiating under the integral sign
http://www.tricki.org/node/316
<p>Seems like this basic technique should have a tricki page.</p>http://www.tricki.org/node/316#commentsArticle requestsMon, 27 Apr 2009 06:22:39 +0000316 at http://www.tricki.orgErlangen program
http://www.tricki.org/node/305
<p>What about an article explaining the ideas behind the Erlangen program? It could link to the symmetries article discused at the forum.</p>http://www.tricki.org/node/305#commentsArticle requestsSat, 25 Apr 2009 10:24:40 +0000JoseBrox305 at http://www.tricki.orgA definitions tricki article
http://www.tricki.org/node/282
<p>Those who have started writing or editing tricki articles probably have come across the same problem. Suppose you need to define a mathematical notion (an operator, a function space, a property and so on). Then there is the obvious question if whether need to define the space from scratch, and If I do so, will this be compatible with other definitions other people have given in different articles? Also, it seems totally redundant to define the same notions over and over again. What I suggest is a tricki article containing definitions of basic notions, operators, function spaces and so on.</p><p><a href="http://www.tricki.org/node/282" target="_blank">read more</a></p>http://www.tricki.org/node/282#commentsArticle requestsThu, 23 Apr 2009 17:02:01 +0000ioannis.parissis282 at http://www.tricki.orgUniversal properties
http://www.tricki.org/node/256
<p>In Universal Algebra, Category Theory, Abstract Algebra and Homological Algebra, "universal properties" and "commutative diagrams" are common place. Maybe an article about them (what are, how to use them, a bit of history, good examples) could be ok.</p>http://www.tricki.org/node/256#commentsArticle requestsWed, 22 Apr 2009 23:44:00 +0000JoseBrox256 at http://www.tricki.orgProof of correctness of algorithms
http://www.tricki.org/node/251
<p>I propose that there should be a page (probably several pages) on how to prove correctness for a (deterministic or randomized) algorithm.</p><p><a href="http://www.tricki.org/node/251" target="_blank">read more</a></p>http://www.tricki.org/node/251#commentsArticle requestsWed, 22 Apr 2009 21:40:18 +0000brownh251 at http://www.tricki.orgDifferential equations front page
http://www.tricki.org/node/245
<p>I noticed that there is a link for this page, even with a brief summary, on the
<a href="/article/Equation-solving_front_page">Equation-solving front page</a>, but the link is dead. There are a couple of pages related to solving DEs already on the uncategorized list, and I would guess that this number will likely grow, since this is a big topic!</p>
<p>I could make the DE front page and start to collect these, but it might be better if someone who knows more about the subject does this.</p><p><a href="http://www.tricki.org/node/245" target="_blank">read more</a></p>http://www.tricki.org/node/245#commentsArticle requestsWed, 22 Apr 2009 15:20:03 +0000emerton245 at http://www.tricki.orgChange of variables/ symmetries
http://www.tricki.org/node/228
<p>Using the correct variables or using a symmetry of the structure underlying the problem to convert a problem to another: this is a principle that I try to use when I think about a question. What is the right representation for a given problem? What are the correct variables? I am curious if others think that this idea deserves a page of its own.</p>
<p>I tried to write an initial article on what I think to be a special case of this, namely use of bijections in counting. If a general article is written, a link to this special case could make both articles more useful.</p>http://www.tricki.org/node/228#commentsArticle requestsTue, 21 Apr 2009 15:17:26 +0000devin228 at http://www.tricki.org