User talk:Dfeuer

Welcome
Welcome to ProofWiki! Since you're new, you may want to check out the general help page. It's the best first stop to see how things are done (next to reading proofs, of course!). Please feel free to contribute to whichever area of mathematics interests you, either by adding new proofs, or fixing up existing ones. If you have any questions please feel free to contact one of the administrators, or post your question on the questions page.

Here are some useful pages to help get you started:
 * Community Portal - To see what needs to be done, and keep up to date with the community.
 * Recent Changes - To keep up with what's new, and what's being added.
 * Check out our house style if you are keen on contributing.
 * Main Page talk - This is where most of the main discussions regarding the direction of the site take place. If you have any ideas, please share them!

Cheers!


 * --Your friendly ProofWiki WelcomeBot 16:40, 29 November 2012 (UTC)

BPIT
I note that you're enthusiastically banging in the BPIT template all over the place in pages which in several cases already have AoC etc. templates in them. I have reservations about this for several reasons:

a) It has not completely been established exactly what BPIT actually is. Yes, there is a partial proof in place, but it might or might not work, but at the moment it is unfinished and, ultimately, incomprehensible because we don't even know what a prime ideal is yet.

b) Places where the BPIT already exists do not indicate exactly where it is used, and why it is relevant, and what the point is. If you look at existing pages using AoC (where the work has been done properly, of ocurse) you will see that there is a specific point in the proof where it is invoked, or if not, in the use of the template there is an indication of which result in that proof does use the AoC (e.g. "... by Zorn's Lemma" etc.). The BPIT work does not.

c) Even when we have sorted all that out, the philosophical significance of BPIT remains obscure. It's couched in technical language about a collection of objects that need considerable work to understand, and even when you do understand them all, it's like: so what? The AoC is a short, pithy fact that can be put into a single sentence's thought and therefore means something. The BPIT in consequence just looks like something clever-sounding that we read off the internet and include because it makes us look smart. Personally I don't think it *does* make us look smart.

Thoughts? --prime mover (talk) 06:24, 14 December 2012 (UTC)


 * Most set theory is pretty strange, but the set theorists keep making it anyway. The Boolean Prime Ideal Theorem is really no stranger than Zorn's Lemma. It apparently has several forms, some of them simpler than the one I started the page on, which all turn out to be equivalent (somehow), the simplest of which that I've seen is the Ultrafilter Lemma. It appears to have been studied extensively at least since the 1960s (and the Ultrafilter Lemma since the 50s), so there's plenty of source material out there—it's not some new experimental axiom that only a handful of specialists have heard of. Personally, I enjoy how it's helping me explore set theory some more to try to understand why different bits relate to each other in certain ways. I don't see how acknowledging on a page that a proof from weaker principles is possible and we'd like to have one makes us look stupid. As long as ProofWiki is a work in progress and not a finished product to be shown off in a library that seems fine to me. --Dfeuer (talk) 07:45, 14 December 2012 (UTC)


 * It would be a good idea to at least indicate that we are still looking for proofs from e.g. BPIT. This can be accomplished by amending the template. Upon establishing more relevant context for the BPIT it will be torn out of obscurity; and if not, there's always the statement that it is a consequence of AC so that any willingly ignorant visitor can content himself with accepting AC and not bothering. For the interested visitor, who may be pleased by accepting a varied assortment of axioms these sections contain valuable and interesting information. There should be more rather than less, IMHO. --Lord_Farin (talk) 12:14, 14 December 2012 (UTC)


 * What might be useful is a "overview" page like we have for, for example, Definition:Separation Axioms in which the various axioms and their relative strengths are presented and explained briefly. Extracting that brevity may be a challenge. In the meantime I recommend we complete the train of thought which goes towards the proof of BPIT (including the definition of the various objects - Prime Ideal comes to mind) and make an attempt to justify the claims that are made in its name. Finally, there are various pages which state "This theorem depends on BPIT" without any indication as to which particular point in the proof it is needed. IMO this is of paramount importance.


 * Demonstrations of relative strength and weakness of the axioms should ultimately be illustrated by examples of objects / constructs which are satisfied by one axiom but not another, proving that while A --> B there are objects that are B but not A. Again, this will be challenging, but should ultimately just be a literature search.


 * I understand the drive to raise the reader's awareness of these things - they fit into the strategy of where we want ProofWiki to go - but without making a solid attempt to justify the underlying foundations there's a danger of the information on this site becoming disconnected. In the extreme would fall into danger of becoming an alternative wikipedia - a conglomeration of cherry-picked interesting / important / noteworthy theorems with no solid underpinning. --prime mover (talk) 14:23, 14 December 2012 (UTC)

Page deletion
For the record if you want a page deleted, please invoke the "delete" template. --prime mover (talk) 09:16, 16 December 2012 (UTC)

Thank you
Thank you for recovering my extension of the Schur's Theorem (Ramsey Theory). That was very nice of you, and skillful!

BTW, why can't one edit a fragment only, why this necessity of editing the totality of the text?! It's ridiculous. Can it be true?!

Best regards, Wlod (talk) 02:27, 26 December 2012 (UTC)


 * I refer you to Help:FAQ --prime mover (talk) 09:41, 26 December 2012 (UTC)

Supremum of Suprema
I replaced your work with essentially a new page. This was easier for me at this hour of the day than the tedium of rewriting your sentences. No offence intended - it was simply quicker. --Lord_Farin (talk) 23:31, 2 January 2013 (UTC)


 * I don't generally mind, but could you explain what made mine so horribly awful that it needed such treatment? Also, I'm not a big fan of mathbb for general purposes (it tends to make me think some "standard" set like $\mathbb C$ is intended. Would you mind switching to mathcal or mathscr? --Dfeuer (talk) 23:36, 2 January 2013 (UTC)


 * Nothing wrong with mathbb. It looks a lot better than mathscr, which is nearly as bad as fraktur for impracticality. Reverted to mathbb. There is a precedent - several pages already use mathbb for subsets of the power set of a set. --prime mover (talk) 06:17, 3 January 2013 (UTC)


 * Would you mind if I switched it to mathcal? --Dfeuer (talk) 06:22, 3 January 2013 (UTC)


 * I tried mathcal but $\mathcal T$ is too similar to $T$. --prime mover (talk) 06:26, 3 January 2013 (UTC)


 * Changed to mathscr per suggestion. Changed it because I felt uncomfortable with the choice of letters and other symbols, and the amount of detail skipped. On a different time of day I might have simply tidied your version. Nothing special. --Lord_Farin (talk) 23:50, 2 January 2013 (UTC)


 * Thanks --Dfeuer (talk) 23:45, 2 January 2013 (UTC)


 * Unrelatedly, we need infimum of infima, and we need right distributive implies left distributive, and all results about ideals and prime ideals in ordered sets need their duals for filters and ultrafilters in ordered sets (which are related to, but not the same as, filters and ultrafilters on sets, and blah blah. There's got to be some way to deal with these duals without duplicating all the text and then struggling to keep them matched s they're edited. Even the cop-out approach of having a proof do little more than link to another strikes me as more practical.—Dfeuer (talk)


 * This stuff is pretty high on my wish list for new schemes. I have a feeling that we can do little more than put up both results because they may arise in very different contexts. If you have ideas on this I'd be very eager to hear about them - don't worry too much about practicality at this point. --Lord_Farin (talk) 23:49, 2 January 2013 (UTC)


 * Well, I already mentioned the impractical option of writing these theorems as templates parametrized by the relevant sensitive words, but I suspect that would lead to much confusion. --Dfeuer (talk) 23:52, 2 January 2013 (UTC)

Category and links
I understand about your physical infirmities, and I appreciate the fact that the page Strictly Positive Integer Power Function Unbounded Above‎ is barely started yet, but as a matter of courtesy to other editors it is good to get into the habit of adding the category for every page you write, as you start it rather than as an afterthought at the end, and also, as you proceed through the writing of it, to link to each concept as you go. --prime mover (talk) 06:26, 3 January 2013 (UTC)


 * I don't have terrible physical infirmities, but I sometimes have technological ones, and sometimes I don't know the right category to put something into. --Dfeuer (talk) 06:27, 3 January 2013 (UTC)


 * If you don't know the category to put something into, then I suggest you explore to see what categories are available. If nothing else it will increase your familiarity with this site, and if you plan on sticking around it's more than just a good idea that you get to grips with how the site is structured - and indeed what is already up on the site. As for "technological restrictions", I suggest you get access to a computer with a decent sized screen and a proper keyboard. Then you'll be able to use accessibility tools to expand the size of the font so you'll be able to see it better. --prime mover (talk) 06:31, 3 January 2013 (UTC)

sandbox
It is suggested that work which is in process of being developed be done in your sandbox. This can be set up as the page User:Dfeuer/Sandbox. Only when your work is complete and you have a page which is presentable (by this meaning that the argument is complete) would it then be deployed to the wiki proper. (See User:GFauxPas/Sandbox for a model instance of how these things are used.)

This does not mean to say that a "stub" page should not go onto the wiki as a placeholder (this is perfectly acceptable practice), but so that a whole series of half-developed proofs do not clutter up the history page, and potentially confuse or irritate users of this site. Basically, it keeps it neater all round.

It would also be hoped that the links would also be complete by this time, and (dare I say it) the house style would be adhered to.

Please feel free to evaluate the above to determine whether it fits in with your own strategy for contribution towards this website. --prime mover (talk) 09:59, 3 January 2013 (UTC)


 * Notwithstanding the above (which contains valid nudges towards being a better contributor), it be mentioned that we highly value the time you devote to ProofWiki. --Lord_Farin (talk) 16:19, 3 January 2013 (UTC)


 * Thanks, Lord_Farin. I just created User:Dfeuer/Product of Positive Element by one Greater than One. Do you think you can check the math and suggest a better name? Or is this theorem already on ProofWiki somewhere I haven't found yet? --Dfeuer (talk) 16:23, 3 January 2013 (UTC)


 * Proof correct; a better (since more consistent with other pages) name may be "Product of Positive Element and Element Greater Than One". There is a lot of house style violation left on that page - you may want to try to sort that out yourself, though. --Lord_Farin (talk) 18:08, 3 January 2013 (UTC)


 * I did some tidying and moved it to the main space. Next up: User:Dfeuer/Strictly Positive Power of Element Greater than One Not Less than Element


 * Again, proof correct, style not so. Please try to tidy and add a tag before moving to main. --Lord_Farin (talk) 19:20, 3 January 2013 (UTC)

spambots
No, that's not what we do. We wait for one of them to do something illegal.I don't see why it would make you nervous. In the grand cosmic scheme of things it's a low-priority concern. Deleting someone's account just because they don't use it is fascism. --prime mover (talk) 06:06, 9 January 2013 (UTC)

Reflexive Reduction of Ordering
It would appear that we can do a better job than introducing $<$ as the reflexive reduction of $\le$ every time. I'm thinking along the lines of a definition for this concept specifically tailored to orderings. Maybe Definition:Strict Ordering of Ordering. --Lord_Farin (talk) 10:28, 9 January 2013 (UTC)


 * I'm open to suggestions. I've been trying hard to cut down on the boilerplate, but I may well have missed opportunities. The trouble is that whether you're basing it on a compatible relation or an ordering, you still need to invoke the theorem that the "strict ordering of ordering" or the "reflexive reduction of the relation" is compatible if the original relation/ordering is compatible. --Dfeuer (talk) 10:34, 9 January 2013 (UTC)


 * An alternative, of course, is to prove the ordered group theorems from preceding ordered group theorems, rather than from the compatible relation theorems. That's less boilerplate, but more actual repetition. --Dfeuer (talk) 10:35, 9 January 2013 (UTC)


 * It was accommodation to the reader's intuition ("... surely $<$ is the strict ordering corresponding to $\le$? Why don't they call it that?" which could easily lead to "This site sux, I'm outta here.") that made me propose this. Indeed, it does not resolve reference issues but it does allow to use one name for a concept. Such allows for reading and searching convenience. --Lord_Farin (talk) 10:41, 9 January 2013 (UTC)


 * Gotcha. I'll be glad to work on that, but I should have been asleep hours ago..... --Dfeuer (talk) 10:43, 9 January 2013 (UTC)

Congratulations
You've surpassed me in number of edits over the last thirty days. I think such hasn't occurred since I started to contribute significantly, approximately one year ago now. Keep it up :). On a side note, it'd be interesting to see how many characters a user contributed rather than how many edits. However, that metric is not available atm... Who knows what the future brings? --Lord_Farin (talk) 22:51, 9 January 2013 (UTC)


 * Thanks, Lord_Farin! I don't think it's the most meaningful metric, but I'll take what I can get! On the other hand, this use of the word "metric" doesn't match the mathematical one, so we should probably use another name. Measure, perhaps? --Dfeuer (talk) 04:44, 10 January 2013 (UTC)


 * The name "measur" doesn't match "the" mathematical one either. "Metric" is perfectly good, it's just a case where the word has tw separate meanings. I suggest that as this is an informal use of the term we do not atm add a disambiguation page. --prime mover (talk) 06:09, 10 January 2013 (UTC)


 * I do hope you realize I was joking. --Dfeuer (talk) 06:10, 10 January 2013 (UTC)


 * No I didn't. It wasn't obvious. --prime mover (talk) 11:20, 10 January 2013 (UTC)

New categories
You have enthusiastically created a bunch of new categories with associated definition categories. Two remarks on that:


 * I had intentionally put lattices and bounded lattices together because they have a huge overlap. Arguably that was a bad call on my part, so I've chosen to go with the way you organised things.
 * Putting e.g. Definition:Distributive Lattice only in the category Category:Definitions/Distributive Lattices is not the correct practice. You may note that many categories do not have an associated def category. This is because the def category is intended to be used for definitions specific to the notions the main category is about.

I may have more points occurring to me later, but that's it for now. --Lord_Farin (talk) 09:27, 10 January 2013 (UTC)

Please keep in mind prime.movers comment about creating virtually empty categories (especially definitions categories). Some of them may well be superfluous because there are no (well-known) concepts defined specifically for a certain structure. --Lord_Farin (talk) 11:20, 10 January 2013 (UTC)


 * I'll bear that in mind. It does seem likely sensible for definition categories. I guess I got a bit over-eager. --Dfeuer (talk) 11:24, 10 January 2013 (UTC)


 * Useful constructs around generation of categories are Template:Subcategory, Template:LinkToCategory, Template:CategDef, Template:DefsLink. I hope most of them have some explanation on the page. --Lord_Farin (talk) 11:26, 10 January 2013 (UTC)

On Definition:Distributive Lattice
I have finally found a quite satisfactory and good-looking approach. See Equivalence of Distributive Lattice Definitions as well. If you agree, I'll delete the pages on join and meet distributing (I've already flagged them for deletion). --Lord_Farin (talk) 16:13, 11 January 2013 (UTC)

double redirects
I have gone through and cleaned up all the double redirects except those from your own (and Lord_Farin's) pages - this is to alert you that you might want to sort them out. --prime mover (talk) 07:50, 17 January 2013 (UTC)


 * Argh! I've tried to fix those as I move pages. Sorry I've missed some. I hope there weren't too horribly many. --Dfeuer (talk) 07:51, 17 January 2013 (UTC)


 * You're all right, just a handful. You can find them via the "Special pages --> Double redirects". --prime mover (talk) 08:10, 17 January 2013 (UTC)

Sandbox
Could you take a look at the new section of User:Lord_Farin/Sandbox? Literature seems to distinguish between Boolean lattice and Boolean algebra (with resp. without ordering) and is mostly vague on the connection between the two. I posted a connecting definition at Definition:Boolean Lattice and want to verify that it is correct before proceeding further with the refactoring (and, incidentally, resuming with Givant/Halmos). TIA. --Lord_Farin (talk) 22:27, 17 January 2013 (UTC)
 * I can look at the math, but I can't tell you if the definitions are standard. If the only difference is whether or not you impose the natural ordering, that hardly seems worth worrying about. --Dfeuer (talk) 22:30, 17 January 2013 (UTC)
 * It's the math; your sentiment about the ordering seems to be bon ton among authors. --Lord_Farin (talk) 22:32, 17 January 2013 (UTC)
 * Incidentally, it provides a really nice way of recovering the lattice ordering (since neither distributivity nor complements are used in the proof). Might consider adding that to Definition:Lattice (and it's a quite nice conclusion of my pondering "what can we say of an ordering compatible with $\vee$?"). --Lord_Farin (talk) 22:34, 17 January 2013 (UTC)
 * I had some trouble figuring out what was going where. As soon as you have a semilattice you have two orderings. If you have two semilattices on the same set that obey the absorption laws, then if you label one a "join" and the other a "meet" semilattice, they induce the same ordering and you have a lattice. I thought we'd already dealt with how you recover the ordering...--Dfeuer (talk) 00:02, 18 January 2013 (UTC)