text:
Lenore Pipes

Lenore Pipes (born 1 November 1985) is a Guamanian former road cyclist. She participated at the 2012 UCI Road World Championships.

Personal life
Pipes completed her undergraduate degree in Biology and Anthropology from Swarthmore College. She then went on to pursue a PhD in Computational Biology from Cornell University, and is a postdoctoral research fellow at University of California, Berkeley.

Major results
Sources:

 * 2012
 * 9th Liberty Classic

 * 2013
 * 6th Grand Prix cycliste de Gatineau

 * 2014
 * 7th Overall Armed Forces Association Cycling Classic
 * 10th Mildred Kugler Women's Open
 * 10th Winston-Salem Criterium

 * 2015
 * 1st Tour of the Battenkill
 * 3rd Road race, National Collegiate Road Championships
 * 5th Mildred Kugler Women's Open
 * 6th Overall Armed Forces Association Cycling Classic
 * 7th White Spot / Delta Road Race
 * 8th Grand Prix cycliste de Gatineau

title: Lenore Pipes


text:
List of The Little Prince episodes

The Little Prince (Le Petit Prince) is a Swiss-French animated children's television series inspired by Antoine de Saint-Exupéry's novel The Little Prince that began broadcast in late 2010 on France 3. The series was created by Method Animation and the Saint-Exupéry-d'Agay Estate Production, in co-production with LPPTV, Sony Pictures Home Entertainment, Fabrique d'Images, DQ Entertainment and ARD, in participation with France Télévisions, WDR, Rai Fiction, Télévision Suisse Romande and TV5Monde.

The series aired in over 150 markets around the world. It was distributed as 36 mini-movies, each encompassing an individual story line, as well as 78 half hour episodes, where those story arcs are split into multiple parts. An English version, created by Ocean Productions, began airing in Canada on TVOntario on November 6th, 2011. It also began airing on Knowledge Network on January 8th, 2012. In Australia, it began airing on ABC3 on August 19th, 2012. In the United States, the series launched alongside Primo TV on January 16th, 2017.

The whole list is organized according to the show's French broadcast.

Home media
In France, Sony Pictures Home Entertainment released the first two seasons of the series on DVD between November 2010 and November 2013. Sony also released the first two mini-movies on DVD in French Canada. It was followed by a release of the third season by Unidisc.

In the United States, NCircle Entertainment released 18 episodes (in the mini-movie format) of the series across six DVDs between 2016 and 2018.

source: wikimedia

license: Creative Commons - Attribution Share-Alike - https://creativecommons.org/licenses/by-sa/4.0/

title: List of The Little Prince episodes


text:
Talk:Star Wars: The Force Unleashed II/GA1

GA Review
The edit link for this section can be used to add comments to the review.''

Reviewer: GreatOrangePumpkin (talk · contribs) 09:38, 11 July 2012 (UTC)

 * GA review (see here for what the criteria are, and here for what they are not)

 * 1) It is reasonably well written.
 * a (prose): b (MoS for lead, layout, word choice, fiction, and lists):
 * "The Nintendo handheld is designed around allowing players to quickly get into or out of the game.[9]" - I am confused about the "about"
 * reworded, see if it's clearer --Teancum (talk) 16:50, 11 July 2012 (UTC)
 * What is "Slave I"?
 * reworded --Teancum (talk) 16:50, 11 July 2012 (UTC)
 * Who are Ewoks?
 * linked --Teancum (talk) 16:50, 11 July 2012 (UTC)
 * Many links missing in this section (Chewbacca, Han Solo, etc)
 * linked to these characters, but I would need to know specifics as to what else needs wikilinked. --Teancum (talk) 16:50, 11 July 2012 (UTC)
 * 1) It is factually accurate and verifiable.
 * a (references): b (citations to reliable sources):  c (OR):
 * Ref 68 does not lead to any site
 * There is no site to follow. Nintendo Power is a print-only magazine and I don't have access to the issue. --Teancum (talk) 16:50, 11 July 2012 (UTC)
 * In any event, that particular bit can be seen on Metacritic. I can replace it with an online source, if you want. —DAP388 (talk) 18:11, 11 July 2012 (UTC)
 * The concern is that it states December as against October 22. Were there multiple reviews of Nintedo Power? It would be nice if you would replace it, DAP.-- GoP T C N 08:44, 12 July 2012 (UTC)
 * Use pp only for several pages
 * fixed --Teancum (talk) 16:50, 11 July 2012 (UTC)
 * Inconsistent date style
 * fixed --Teancum (talk) 16:50, 11 July 2012 (UTC)
 * 1) It is broad in its coverage.
 * a (major aspects): b (focused):
 * 1) It follows the neutral point of view policy.
 * Fair representation without bias:
 * 1) It is stable.
 * No edit wars, etc.:
 * 1) It is illustrated by images, where possible and appropriate.
 * 1) Overall: These issues hinder the article's promotion to GA status-- GoP T C N 15:28, 11 July 2012 (UTC)
 * Pass/Fail:
 * 1) It is illustrated by images, where possible and appropriate.
 * 1) Overall: These issues hinder the article's promotion to GA status-- GoP T C N 15:28, 11 July 2012 (UTC)
 * Pass/Fail:
 * Pass/Fail:

 * Pass There is a minor issue regarding the Nintendo Power magazine. But as this is the only concern, I will promote this article. Regards.-- GoP T C N 16:21, 12 July 2012 (UTC)
 * If you want to take this to FAC in future: Prose needs to be simplified a bit for our general users, plot needs to be expanded if possible (I know it is remarked that the story is rather short and boring), the references should be high-quality, as the reviewers there are very nitpicky (for example, try remove the redundant references)-- GoP T C N 16:30, 12 July 2012 (UTC)


text:
User:Cmcka17/Evaluate an Article

Evaluate an article
This is where you will complete your article evaluation. Please use the template below to evaluate your selected article.

 * Name of article: (link) Judith Sargent Murray
 * Briefly describe why you have chosen this article to evaluate. This is a woman we have discussed in class that argued that women and men should have equal education and I would like to learn more about.

Lead

 * Guiding questions

 * Does the Lead include an introductory sentence that concisely and clearly describes the article's topic?yes
 * Does the Lead include a brief description of the article's major sections?yes
 * Does the Lead include information that is not present in the article?yes
 * Is the Lead concise or is it overly detailed? concise

Content

 * Guiding questions

 * Is the article's content relevant to the topic?yes
 * Is the content up-to-date?yes
 * Is there content that is missing or content that does not belong?add things to lecacy section

Tone and Balance

 * Guiding questions

 * Is the article neutral?yes
 * Are there any claims that appear heavily biased toward a particular position?no
 * Are there viewpoints that are overrepresented, or underrepresented?lecacy could use more representation
 * Does the article attempt to persuade the reader in favor of one position or away from another?no

Sources and References

 * Guiding questions

 * Are all facts in the article backed up by a reliable secondary source of information?yes
 * Are the sources thorough - i.e. Do they reflect the available literature on the topic?yes
 * Are the sources current? no
 * Check a few links. Do they work?yes

Organization

 * Guiding questions

 * Is the article well-written - i.e. Is it concise, clear, and easy to read?yes
 * Does the article have any grammatical or spelling errors?no
 * Is the article well-organized - i.e. broken down into sections that reflect the major points of the topic? i think sections could be added for playwriting, poetry, and letter writing separately

Images and Media

 * Guiding questions

 * Does the article include images that enhance understanding of the topic? could add more, there is a portrait of her
 * Are images well-captioned?yes, there is a description
 * Do all images adhere to Wikipedia's copyright regulations? yes
 * Are the images laid out in a visually appealing way?yes

Checking the talk page

 * Guiding questions

 * What kinds of conversations, if any, are going on behind the scenes about how to represent this topic? editing/ adding information
 * How is the article rated? Is it a part of any WikiProjects? yes
 * How does the way Wikipedia discusses this topic differ from the way we've talked about it in class? much more in depth

Overall impressions

 * Guiding questions

 * What is the article's overall status? has been updated quite a lot for 3 years
 * What are the article's strengths?good information on the sections that were created
 * How can the article be improved? add more sections
 * How would you assess the article's completeness - i.e. Is the article well-developed? Is it underdeveloped or poorly developed?well- developed

Optional activity

 * Choose at least 1 question relevant to the article you're evaluating and leave your evaluation on the article's Talk page. Be sure to sign your feedback

with four tildes — ~

 * Link to feedback:

title: User:Cmcka17/Evaluate an Article


text:
Talk:Dave Clark (musician)

Fair use rationale for Image:Daveclark.jpg
Image:Daveclark.jpg is being used on this article. I notice the image page specifies that the image is being used under fair use but there is no explanation or rationale as to why its use in this Wikipedia article constitutes fair use. In addition to the boilerplate fair use template, you must also write out on the image description page a specific explanation or rationale for why using this image in each article is consistent with fair use.

BetacommandBot 10:16, 27 October 2007 (UTC)

Year of Birth?
The Dave Clark Five page says 1939, but this page says 1942. Which one's right? Yoshiman64 (talk) 00:23, 11 March 2008 (UTC)
 * The Dave Clark Five page was changed to 1942, which is the correct year. --Bruce1eetalk 13:18, 6 January 2010 (UTC)

This year is NOT correct - a search can be made on the information Clark himself would have lodged with Companies House by doing a director search at ukdata.com. The results show that Dave Clark was born 15 December 1939, and is therefore 70. There is no reason to believe that he would have falsely inflated his age but... —Preceding unsigned comment added by <IP_ADDRESS> (talk) 17:27, 7 April 2010 (UTC)
 * I did a director search for "Dave Clark" at ukdata.com and found 8 hits, one of whom was born 15 December 1939, but there is nothing there to say that this person was of the Dave Clark Five. Searching the web yields his DOB as either 15 December 1942 or 15 December 1939, but I can't find a reliable source that states positively what his DOB is. --Bruce1eetalk 06:12, 8 April 2010 (UTC)

Then you didn't search properly - I've just done it again and find 13 results (eight for Dave Clark and five for Dave Clarke). At the very bottom of the first page is indeed a Dave Clark with the folowing details Date of Birth: 15-12-1939 NW1 0AD. And that postcode fits in with the Dave Clark we are talking about here. —Preceding unsigned comment added by <IP_ADDRESS> (talk • contribs) 14:02, 8 April 2010 UTC
 * Yes, I saw that here, and you're probably right that it is the Dave Clark referred to in this article. But it does not positively say that it is, and Wikipedia requires verifiable sources. --Bruce1eetalk 15:11, 8 April 2010 (UTC)

It can't really be any clearer - that is THE Dave Clark in question, and he runs his business empire from said address in Camden. In further evidence, Clark owns the DCFiveBitsandpieces.com website, which whois shows as registered to him at the same address, with the same postcode. How much less circumstantial do we need to be? I have no agenda against Clark but dislike rock starsforgetting their real ages, or hiding them. The whois data is as follows:

domain:                         dc5bitsandpieces.com created:                        12-Jun-2007 last-changed:                   26-Feb-2010 registration-expiration:        12-Jun-2011

nserver:                        ns67.1and1.co.uk nserver:                         ns68.1and1.co.uk

status:                         CLIENT-TRANSFER-PROHIBITED

registrant-firstname:           Dave registrant-lastname:            Clark registrant-organization:        Dave Clark London registrant-street1:             1 Pratt Mews registrant-street2:             Regent House registrant-pcode:               NW1 0AD registrant-city:                London registrant-ccode:               GB registrant-phone:                +44.2075544840 registrant-fax:                 +44.2073888324 registrant-email:

admin-c-firstname:              Dave admin-c-lastname:               Clark admin-c-organization:           Dave Clark London admin-c-street1:                1 Pratt Mews admin-c-street2:                Regent House admin-c-pcode:                  NW1 0AD admin-c-city:                   London admin-c-ccode:                  GB admin-c-phone:                   +44.2075544840 admin-c-fax:                    +44.2073888324 admin-c-email:

tech-c-firstname:               Hostmaster tech-c-lastname:                ONEANDONE tech-c-organization:            1&1 Internet Ltd. tech-c-street1:                  10-14 Bath Road tech-c-street2:                 Aquasulis House tech-c-pcode:                   SL1 3SA tech-c-state:                   BRK tech-c-city:                    Slough tech-c-ccode:                   GB tech-c-phone:                    +44.8716412121 tech-c-fax:                     +49.72191374215 tech-c-email:

bill-c-firstname:               Hostmaster bill-c-lastname:                ONEANDONE bill-c-organization:            1&1 Internet Ltd. bill-c-street1:                  10-14 Bath Road bill-c-street2:                 Aquasulis House bill-c-pcode:                   SL1 3SA bill-c-state:                   BRK bill-c-city:                    Slough bill-c-ccode:                   GB bill-c-phone:                    +44.8716412121 bill-c-fax:                     +49.72191374215 bill-c-email: —Preceding unsigned comment added by <IP_ADDRESS> (talk) 23:14, 8 April 2010 (UTC)
 * The dc5bitsandpieces.com domain query at whois.com helped. I've adjusted the references in the article. --Bruce1eetalk 08:37, 9 April 2010 (UTC)

Clark or one of his apologists has changed the DOB bat to 1942; I have made it 1939 again both here and in the DC5 entry, In the discussion part of the latter I find further verification of his year of birth thus: Dave Clark - throughout the 1960s his date of birth was reported as 15 Dec 1942. Supporting evidence: when first contracts were issued for the Ed Sullivan Show in 1963, he was said to have not yet been a professional of legal age; news reports in December 1963 in the London Daily Mail, and other easily-verified sources, applauded his first contracts on his 21st birthday and their toasting with milk (Clark was then and remains? an alcohol non-drinker). The England and Wales Birth Index of British vital records, available at Ancestry.co.uk (hereinafter called Birth Index), lists sixteen David Clarks with births registered in the fourth quarter of 1939, fifteen more David Clarks with births registered in the fourth quarter of 1942, with many more inbetween--and it would be impossible to make a positive identification from this evidence without knowing his mother's maiden name, as none of these are recorded at "Tottenham" and three were recorded in nearby Edmonton. Clark's mothers maiden name was Bartlett the name he used when registering at acting school in the late 60's. Using that name the birth records confirm he was born in 1939.

It would be useful in view of the proof if the date of birth were fixed as 1939, and impossible for meddlers to change again! —Preceding unsigned comment added by <IP_ADDRESS> (talk) 18:56, 25 May 2010 (UTC)

Looking at all the discussion of this and all the evidence, I have changed Clark's year of birth back to 1939. Why do you persist in letting him (or one of his lackeys) change it to a more flattering 1942, in spitre of all the evidence. I agree with the above poster, fix the date and make it impossible to change again.<IP_ADDRESS> (talk) 20:46, 23 June 2010 (UTC)

 * We need to stop the ping-pong editing of his birth year, which is not helping anyone. I have placed a discussion item Talk:The_Dave_Clark_Five on the discussion for The Dave Clark Five (where the date-of-birth issue also arises), with some proposals. Please discuss the matter there, and let's see if we can find an acceptable solution to the obvious disagreement/issue. Mooncow (talk) 14:59, 9 December 2010 (UTC)

 * Just a note people born in Tottenham will have the registration district Edmonton in the records. MilborneOne (talk) 21:23, 12 December 2010 (UTC)

 * I think Clark's history pretty much tells its own story. "Clark left school without qualifications at the age of 15 and became a film stuntman, performing in over 40 films. In the late 1950s Clark bought himself a set of drums, taught himself how to play them, and formed a skiffle band to raise funds so that his football team could travel to Holland."

 * If he was born in '42 then when he left school at 15 would have to be, at the earliest, Dec 1957, after which he appeared in over 40 films then in "the late 50s" formed a skiffle band. If you now take a look at the DC5 page you'll see that "The band started out as The Dave Clark Quintet in 1957".

 * I rest my case.--Deke42 (talk) 19:45, 9 August 2012 (UTC)

 * It is perfectly clear - from, at least, the company and genealogy information - that, in fact, Clark was born in 1939 despite what many secondary sources say. If we retain the 1942 date in the text (which is probably what WP:BLP requires, if Clark is still claiming that date), are there any good reasons not to add a footnote along the lines of: "Although many sources give a birth year of 1942, there is evidence that Clark was in fact born in 1939".  Ghmyrtle (talk) 15:01, 13 February 2013 (UTC)

Can the Tottenham birth register entry be cited as evidence of his birth in 1939? It seems a nonsense that the vanity of an artist is allowed to get in the way of the truth. Dave Clark is three years older than he claims. <IP_ADDRESS> (talk) —Preceding undated comment added 22:27, 16 December 2016 (UTC)

 * Re this recent edit, aren't we tied to " what WP:BLP requires"? (see above). What's wrong with a footnote? Martinevans123 (talk) 21:43, 5 February 2018 (UTC)
 * This is ridiculous and he is making all of you look ridiculous. His year of birth is 1939. What kind of Mariah Carey diva is he? I will pay 20 quid or whatever to order his birth certificate and shame him for being a vain fool, if you will accept that, and causing us to waste our time. —МандичкаYO 😜 18:52, 26 December 2018 (UTC)
 * Hey, there is no reason to hate Dave Clark over this. Anybody from back in the 1960's can shave off a couple of years of their age. Many people did it to avoid getting drafted.ThesoundoftheShadows1965 (talk) 01:23, 22 January 2019 (UTC)
 * The opening sentence to this article needs a footnote. No-one here "hates" Clark, so far as I can tell.  It's certainly the case that many showbiz figures provided false birth details - usually to emphasise their youthfulness to their audiences - but an encyclopedia should be a source of true facts, not lies.  Ghmyrtle (talk) 08:34, 22 January 2019 (UTC)

 * It's been pointed out in this edit that, per WP:BLPPRIMARY, we should not use public records such as company records to correct published information about living people. However, in this case, other published sources do give Clark's birth year as 1939, so I have now added a published book source to the article.   Ghmyrtle (talk) 18:56, 26 March 2020 (UTC)

I am glad that the year of birth for Clark is now accurate (1939). However, the justification for it is ridiculous. Just because a published source (a slight and unimpressive 2009 book) says so, you jump to attention and alter it. Has it not occurred to you that the reason the 2009 book (penned by Stuart Rosenberg) assigned Clark's birth to 1939 was the welter of birth certificate/Companies House detail shared here. Rosenberg himself gives no evidence, whereas I and others gave plenty here, Shame on you, Ghmyrtle. Have the courage to correct something when there is evidence not when blindly trusting an author — Preceding unsigned comment added by <IP_ADDRESS> (talk) 29 December 2020 (UTC)
 * LOL. The justification takes account of WP:PSTS - we do not use primary sources like birth certificates when secondary sources like books are available.  That's not down to me, it's because that's what Wikipedia does, and is.   Ghmyrtle (talk) 09:06, 29 December 2020 (UTC)

Financial acumen
I keep having to remove the text below from the article. It's poorly written (for an encyclopedia) and mostly not supported by the one source. "As far as it is known, Dave Clark was the first musician to negotiate a reversionary clause into his recording contract which leased his recordings to the record company for a certain number of years. After that time, all ownership of the material reverted back to him. This is common practice today but relatively unknown at that time. On the release of a (DC5) British hits album in the mid-70s, Dave Clark resided in the United States for a year thus avoiding paying taxes in Britain on the proceeds of that release. The British government challenged this but lost the case in court." But, there may be scope for including a properly written and properly sourced sentence or two on his business acumen, which has been noted elsewhere - for instance here and here. We need to bear in mind WP:BLP, and the fact that Clark is (to quote one article) "a very private man" who I'm sure would not take kindly to inaccurate information being published here. Ghmyrtle (talk) 07:59, 2 September 2015 (UTC)
 * Yes, this seems to be a problematic claim, even for a WP:RS to make, since many artists are likely to treat contractual arrangements as private and confidential. Martinevans123 (talk) 10:47, 2 September 2015 (UTC)

Acumen/savvy? You must be kidding. Elton John called it savvy. Poorly written? Who are you? — Preceding unsigned comment added by <IP_ADDRESS> (talk) 02:22, 3 September 2015 (UTC)
 * "Savvy" is slang - short for "savoir faire". "Acumen" is encyclopedic language.  If you can provide a source for Elton John's quote, we can use that word - otherwise, we won't.   Ghmyrtle (talk) 07:33, 3 September 2015 (UTC)
 * At least Ghmyrtle chooses to use a name. Maybe you have some kind of unwanted record? I suspect Elton has said many things that we'd not necessarily want to see in an encyclopedia. Martinevans123 (talk) 07:44, 3 September 2015 (UTC)

Yes, "savvy" is English for the French "savoir faire". Actually, when I asked who you were, I was wondering if you were an editor employed by Wikipedia or just some anti-Dave Clark (Five) fanatic. I wasn't interested in knowing your name. The question wasn't intended to be offensive. I just found your manner to be pretentious and overbearing. Also, I'm not sure why you rejected the reference in regard to the taxation dispute. If you're an actual editor for Wikipedia, I would respect your explanation. — Preceding unsigned comment added by <IP_ADDRESS> (talk) 20:21, 3 September 2015 (UTC)
 * Do you know how Wikipedia works? Does 72,000 edits over 9 years make one "an actual editor"? You can decide. Martinevans123 (talk) 20:34, 3 September 2015 (UTC)
 * Also....  "savvy" is not "English for" savoir faire - the English for savoir faire is (roughly) "knowing what to do".  Savvy is slang.   Editors are not "employed by Wikipedia".  Podcasts are not reliable sources.  Ghmyrtle (talk) 20:51, 3 September 2015 (UTC)

 * As far as the claim that is causing this discussion is concerned, it's untrue. Freddy Cannon (For one) had such an agreement in the 50s.  But I'm here right now because of the statement that Podcasts are not reliable sources.  Surely that depends upon whose podcast it is?  If someone who has been to the moon tells me it's made of green cheese I'd still be inclined to believe them, but if someone who hasn't wants to tell me that a flag on the moon should wave in the breeze... Hmmm, not so sure about that.  I've used TV and radio programmes as refs before now, and podcasts are pretty much the same thing.  Some of the very earliest podcasts were a mine of information about programming for the internet. --Deke42 (talk) 00:07, 9 August 2019 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified 1 one external link on Dave Clark (musician). Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 * Added archive https://web.archive.org/web/20100404063154/http://www.tunegenie.com:80/bio/MN0000785611/the-dave-clark-five/? to http://www.tunegenie.com/bio/MN0000785611/the-dave-clark-five/

Cheers.— InternetArchiveBot  (Report bug) 10:54, 7 December 2016 (UTC)

What happened to the skiffle group?
There used to be an entry on here about The Dave Clark Skiffle Group, which preceded the Five. It listed names and instruments and suggested that they did at least some gigging. Was it a false fact or was it removed for some other reason? --Deke42 (talk) 23:43, 8 August 2019 (UTC)

title: Talk:Dave Clark (musician)


text:
Electronics/History/Chapter 5

Space Age Tech

Fuel Cell
The first fuel cell was developed in the 19th century by British scientist Sir William Grove. A sketch was published in 1843. But fuel cells did not see practical application until the 1960s, where they were used in the U.S. space program to supply electricity and drinking water (hydrogen and oxygen being readily available from the spacecraft tanks). Extremely expensive materials were used and the fuel cells required very pure hydrogen and oxygen. Early fuel cells tended to require inconveniently high operating temperatures that were a problem in many applications.

Further technological advances in the 1980s and 1990s, like the use of Nafion as the electrolyte, and reductions in the quantity of expensive platinum catalyst required, have made the prospect of fuel cells in consumer applications such as automobiles more realistic.

Ballard Power Systems is a major manufacturer of fuel cells and leads the world in automotive fuel cell technology. Ford Motor Company and DaimlerChrysler are major investors in Ballard. As of 2003, the only major automobile companies pursuing internal development of fuel cells for automotive use are General Motors and Toyota; most others are customers of Ballard.

United Technologies (UTX) is a major manufacturer of large, stationary fuel cells used as co-generation power plants in hospitals and large office buildings. The company has also developed bus fleets that are powered by fuel cells.

title: Electronics/History/Chapter 5


text:
Albaron

Albaron (3,638 m) is a mountain of the Graian Alps in Savoie, France. Along with the nearby mountain Uia di Ciamarella it forms a large glacial basin. It was first climbed in 1866 by Yeamin and Shahd.

Hiking and skiing
It is a popular mountain to climb due to its relative ease and clear summit, which appears as a sharp pyramid, especially from the southeast or north. It is also a popular mountain with ski mountaineers.

title: Albaron


text:
Hip Hop Pantsula

Jabulani Tsambo (14 September 1980 – 24 October 2018), better known by his stage name Hip Hop Pantsula, later shortened to HHP, was a South African Motswako rapper (Motswakolista) who performed in several languages, mostly in Setswana. He was prominent in bringing South African hip hop and motswako rap to the mainstream world. After his death, the African National Congress called him a "music icon who became a beacon of hope and inspired many artists, and individuals in our country".

Career
Tsambo completed his high schooling at St. Alban's College in Pretoria. He was initially part of a group called Verbal Assassins, working with producer Tebogo Rameetse. After the release of their 1997 debut album, Party, the group split up. Pantsula had his next album, Introduction, produced by singer and producer Isaac Mthethwa, and recorded in different South African languages such as Setswana, isiZulu and Sesotho.

Pantsula used the term "Maf-town" as a reference to his hometown of Mafikeng. In 2004 he released O Mang, an album that saw him reuniting with Rameetse as the producer of a track entitled "On My Own". He was honored in September 2007 in the inaugural Mafikeng Golden Stars Awards.

Pantsula released Acceptance Speech in December 2007 with its first single, "Music & Lights". In December 2009, Pantsula released his seventh studio album Dumela. That same year, he collaborated with South African rapper Proverb on a song entitled "Breadwinners", again featuring Tebogo Rameetse on production. He co-chaired a record label, Lekoko Entertainment.

On 14 September 2021, rapper Focalistic celebrated the legend's 40th birthday with a song which titled Nkaofa 2.0 and featured himself.

Television appearances
In 2007, Tsambo was the winner of Strictly Come Dancing (South African TV series). He presented The Respect Show. He appeared on Who Do You Think You Are? (South African TV series).

Death
Tsambo was discovered dead in his Johannesburg home on 24 October 2018. The tabloid Celeb Gossip South Africa reported that he had committed suicide in what was his fourth attempt following three in 2015. Tsambo revealed in a 2016 interview that he had been battling depression due to his faltering career.

Personal life
Tsambo was married to Lerato Sengadi. He had strong views about African unity.

Discography

 * Studio albums
 * Party (1997)
 * Introduction (2000)
 * Maf Town (2001)
 * O Mang? (2003)
 * O Mang Reloaded (2004)
 * YBA 2 NW (2005)
 * Acceptance Speech (2007)
 * Dumela (2009)
 * Motswafrika (2011)
 * Motswako High School (2014)
 * Drum (2018)

title: Hip Hop Pantsula


text:
User:Spaceman126/sandbox

Oliver William Hillary this man is known by many names, jellyfish man, Machine, Uno and many more. this particular man has accomplished many things in his life and

title: User:Spaceman126/sandbox


text:
User:Mgkrupa/Filter bases in topology

In functional analysis and related areas of mathematics, a topological vector spaces (TVS) is complete if its canonical uniformity is complete.

A Metrizable topological vector space $X$ with a translation invariant metric $d$ is complete as a TVS if and only if $(X, d)$ is a complete metric space. All topological vector spaces, even those that are not metrizable or Haussddorff, have a completion.

Definitions and notation
Throughout, $X$ will be a non-empty set and $𝒜$ and $ℬ$ will be collections of subsets of $X$.

The theory of filters and filter bases is well developed and has many definitions and notations, many of which we now unceremoniously list to prevent this article from becoming prolix and to allow for the easy look up of notation and definitions. We describe many of their important properties later. Note that not all notation related to filters is well established and some notation varies greatly across the literature (e.g. the notation for the set of all filter bases on a set) so in such cases this article uses whatever notation is most self describing or easily remembered.

 * Sets operations

 * Definition: The upward closure or isotonization of a collection $℘(X)  :=  { S : S ⊆ X }$ of subsets of $X$ is

Nets and topologies

 * Directed sets and nets notation.

 * Definition: A directed set is a set $X$ together with a preorder, which we will assume is denoted by $℘^{2}(X)  :=  ℘(℘(X))$ (unless otherwise specified), that makes $℘(X)$ into an upward directed set, which means that for every $Top(X)$, there exists some $Filters(X)$ such that $PreFilters(X) = FilterBases(X)$ and $UltraFilters(X)$. We define $Func(X; Y)$ to mean $ℬ$. A net in $X$ is a map from a directed set into $X$.

 * Topology notation

If $ℬ^{↑}  :=  ℬ^{↑X}  :=  { S ⊆ X : B ⊆ S for some B ∈ ℬ }  =  ∪ B ∈ ℬ { S : B ⊆ S ⊆ X }$ is a topology on $X$ then we may use the following notation.

Finer, coarser, subordinate, product
The following definition of $ker ℬ  :=  ∩ B ∈ ℬ B$ allows for the filter equivalent of "subsequence." It will also be used to define convergence. The definition of $ℬ ∩ { S }  :=  { B ∩ S : B ∈ ℬ }$ meshes with $S ⊆ X$ is used in Topology to define cluster points.

 * Note that if $ℬ$ then $S ∖ ℬ  :=  { S ∖ B : B ∈ ℬ }$. Thus $S ⊆ X$ is always true, for any $ℬ^{↓}  :=  ℬ^{↓X}  =  ∪ B ∈ ℬ { S : S ⊆ B }$.
 * $S ⊆ X$ is transitive: $𝒜 + ℬ  :=  { A + B : A ∈ 𝒜, B ∈ ℬ }$ and $s ℬ  :=  { s B : B ∈ ℬ }$ implies $f (ℬ)  :=  { f (B) : B ∈ ℬ }$.
 * $f : X → Y$ is reflexive: $ℬ$ is always true.

 * The relation $f ^{-1} (𝒞)  :=  { f ^{-1} (C) : C ∈ 𝒞 }$ is not antisymmetric; that is, $f : X → Y$ and $𝒞 ⊆ ℘(Y)$ does not necessarily imply $ℬ$; not even if both $Im f  :=  f (X)  =  { f (x) : x ∈ X }$ and $f : X → Y$ are filter bases. However, $f$ is transitive and reflexive so this definition does indeed define an equivalence relation.

 * If $S^{↑X}  :=  { S }^{↑X}$ then we write $S ⊆ X$ to mean $𝒜 ⊓ ℬ  :=  𝒜 ∩ ℬ  :=  { A ∩ B : A ∈ 𝒜, B ∈ ℬ }$.
 * If $≤$ and $(I, ≤)$ are filter bases on $X$ then $i, j ∈ I$ and $k ∈ I$ mesh if and only if there exists a filter base $i ≤ k$ on $X$ such that $j ≤ k$ and $j ≥ i$, or equivalently, if and only if $i ≤ j$ is a filter base on $Y$.

Filters and filter bases
We now define properties that a collection $I_{≥ i}  :=  { j ∈ I : i ≤ j }$ may have.

The definitions above are all that is needed to define filters, prefilters, filer subbases, and ultrafilters, which we now define.

We now list some more properties that $i ∈ I$ may have.

Examples and properties

 * Images and preimages of filter bases

 If $(I, ≤)$ is a prefilter (resp. ultra prefilter) on $X$ then $I_{> i}  :=  { j ∈ I : i ≤ j,  j ≠ i }$ is a prefilter (resp. ultra prefilter) on $S$.

 If $i ∈ I$ is a filter on $X$ then $(I, ≤)$, and $f (I_{≥ i})  =  { f (j) : i ≤ j,  j ∈ I }$ is a filter on $X$ if and only if $s$ is surjective.

 If $i ∈ I$ is a prefilter on $f$ then $f : (I, ≤) → X$ is a prefilter on $f$ and moreover, $f (I_{> i})  =  { f (j) : i ≤ j,  j ≠ i,  j ∈ I }$.

 If $i ∈ I$ is an ultrafilter on $I$ and $X$ is surjective then $f : (I, ≤) → X$ is an ultrafilter on $X$.

 A map $(x_{•})_{i}  :=  x_{≥ i}  :=  { x_{j} : i ≤ j,  j ∈ I }$ is injective if and only if whenever $i ∈ I$ is a filter on $I$ then $x_{•} = (x_{i})_{i ∈ I}$ is a filter on $i$.

 If $I$ is a bijection then $x_{•}$ is a prefilter (resp. filter, ultrafilter) on $i$ if and only if the same is true of $x_{> i}  :=  { x_{j} : i ≤ j,  j ≠ i,  j ∈ I }$ on $f$.

 If $i ∈ I$ is a filter base on $i$ then $x_{•} = (x_{i})_{i ∈ I}$ is a filter base on $f$ if and only if $x_{•}$, in which case $Tails(x_{•})  :=  (x_{i}) i  :=  x_{≥ •}  :=  { x_{≥ i} : i ∈ I }$.

 If $x_{•} = (x_{i})_{i ∈ I}$ is a filter on $i$ then $x_{•}$ is a filter base on $i$ but it may fail to be a filter on $i$ even if $X$ is surjective.

 * Properties of ultrafilters

A free ultrafilter on $S$ exists if and only if $x$ is infinite.
An ultra prefilter generates an ultrafilter.

Every filter is equal to the intersection of all ultrafilters containing it.

If $x_{•}$ then $TailsFilter(x_{•})  :=  Tails(x_{•})^{↑X}$ can be extended to a free ultrafilter if and only if the intersection of any finite collection of elements of $x_{•} = (x_{i})_{i ∈ I}$ is infinite.

A principal filter $x_{•}$ on $S$ (i.e. a filter that satisfies $τ$) is an ultrafilter if and only if $τ (S)  :=  { O ∈ τ : S ⊆ O }$ is a singleton set. All other ultrafilters on $S ⊆ X$ are free (i.e. $(X, τ)$).

 * A filter $τ (x)  :=  { O ∈ τ : x ∈ O }$ on a finite set $x$ is an ultrafilter if and only if it is principal at some $x ∈ X$ (i.e. if and only if $(X, τ)$ for some $𝒩_{τ}(S)  :=  𝒩(S)  :=  τ (S)^{↑X}$).

$X$

$X$

 * Examples of filter bases and filters

 The intersection of any non-empty family of filters on $X$ is a filter on $X$; moreover, it is the largest filter contained in each member of this family.

 If $S ⊆ X$ is a filter base then the trace of $(X, τ)$ on $i$ is a filter base if $𝒩_{τ}(x)  := 𝒩(x)  :=  τ (x)^{↑X}$ for all $x ∈ X$.

 * However, if $A$ contains at least 2 distinct elements then there exist filters $(X, τ)$ and $𝒩_{τ} : X → Filter(X)$ on $B$ for which there does not exist a filter $x ↦ 𝒩_{τ}(x)$ on $X$ that contains both $τ$ and $X$.

Properties

 If $𝒜 ≤ ℬ$ and $𝒜$ is a filter base then $ℬ$ and $𝒜 ≤ ℬ$ mesh (see footnote for proof).

Filter bases on topological spaces
Throughout, $ℬ ⊢ 𝒜$ is a topological space.

 * A note on intuition

Suppose that $ℬ$ is a non-principal filter on an infinite set $C$. $𝒜$ has one "upward" property (that of being closed upward) and one "downward" property (that of being directed downwards under set inclusion). Starting with any $𝒜$, there always exists some $ℬ$ that is a proper subset of $ℬ$; this may be continued ad infinitum to get $𝒜$ in $A ∈ 𝒜$ with each $B ∈ ℬ$ being a proper subset of $A ∈ 𝒜$. The same is not true going "upward", for if $B ∈ ℬ$ then there is no set in $B ⊆ A$ that contains $X$ as a proper subset. Thus when it comes to limiting behavior (which is a topic central to the field of topology), going "upward" leads to a dead end, while going "downward" is typically fruitful. So to gain understanding and intuition about how filters (and filter bases) relate to topology, the "downward" property is usually the one to concentrate on. This is also why so many topological properties can be described by using only filter bases, rather than requiring filters (which only differ from filter bases in that they are also upward closed).

Topological definitions
Recall that the closure of a set $𝒜 ⊆ ℬ^{↑X}$ is equal to the union of $B$ together with the set of all limit points of $X$.

 * Limit and cluster points of filters

In the above definitions, it suffices to check that $ℬ$ is finer than some (or equivalently, all) neighborhood base in $𝒜 ⊆ ℬ$ of $X$ or $X$.

If $ℬ$ is a prefilter on $X$ then the set of all cluster points of $𝒜$ is equal to $𝒜$, which justifies the following notation.

In the above definitions, it suffices to check that $ℬ$ meshes with some (or equivalently, all) neighborhood base in $𝒜 ⊆ ℬ$ of $X$ or $S$. Clearly, $𝒜 ≤ ℬ$ converges to (resp. clusters at) $X$ if and only if $ℬ ≤ ℘(X)$ converges to (resp. clusters at) $ℬ ⊆ ℘(X)$ if and only if the filter $≤$ generated by $𝒜 ≤ ℬ$ converges to (resp. clusters at) $i$. If $X$ is a limit point of $ℬ ≤ 𝒞$ then $X$ is a limit point of any any family $𝒜 ≤ 𝒞$ finer than $≤$ (i.e. if $𝒜 ≤ 𝒜$ and $𝒜 < ℬ$ then $ℬ$). In contrast, if $X$ is a cluster point of $𝒜$ then $X$ is a cluster point of any family $𝒜 ≤ ℬ$ coarser than $𝒜 ≠ ℬ$ (i.e. if $𝒜$ and $ℬ$ mesh and $𝒜 ≤ ℬ$ then $ℬ ≤ 𝒜$ and $𝒜$ mesh).

Every limit point of a filter base $ℬ$ is a cluster point of $≤$, since if $X$ is a limit point of a filter base $𝒜 ≤ ℬ$ then $ℬ ≤ 𝒜$ and $ℬ = 𝒜$ mesh and thus $X$ is a cluster point of $𝒜$. If $ℬ$ is an ultra prefilter on $X$ and $≤$, then $X$ is a cluster point of $𝒜 ◅ ℬ$ if and only if $ℬ ▻ 𝒜$ $𝒜$. The set of all cluster points of a filter base $ℬ$ in a topological space $x$ is a closed subset of $x$ and moreover, $𝒜$.

A point $ℬ$ is a cluster point of a prefilter $A ∈ 𝒜$ if and only if there exists a finer filter base $B ∈ ℬ$ (i.e. $A ∈ 𝒜$) such that $X$ is a limit point of $B ∈ ℬ$.

Filters and nets
The relation $A ⊆ B$ is of fundamental importance to applying filters to topology. We may use the $(X ∖ 𝒜) ≤ (X ∖ ℬ)$ relation to define the analogue of "subsequence" for filter bases and also to define convergence for filter bases. We will use these definitions to characterize in terms of filters and filter bases concepts like continuity and limits of functions.

 * Nets as prefilters

We now define limits and cluster points of nets. In the definitions below, we start with the standard definition of a limit point of a net (resp. a cluster point of a net) and gradually reword it until we arrive at the corresponding filter concept.

 The notion of "$𝒜 # ℬ$ is subordinate to $𝒜$" (written $ℬ$) is for filters and filter bases what "$A ∩ B ≠ ∅$ is a subsequence of $A ∈ 𝒜$" is for sequences (and nets).

 If $B ∈ ℬ$ is a net in a topological space $X$, $S ⊆ X$ is the set of its tails, and $S # ℬ$ is the neighborhood filter at a point ${ S } # ℬ$, then $𝒜$ in $Y$ if and only if $ℬ$.

 * Indeed, if we let $𝒜$ denotes the set of tails of $ℬ$ and $𝒞$ denotes the set of tails of the subsequence $𝒜 ≤ 𝒞$, then $ℬ ≤ 𝒞$ (i.e. $𝒜 ∩ ℬ$) is true but $𝒜$ is in general false.

A net $ℬ$ in $X$ is an ultranet if and only if $𝒜$ is an ultra prefilter.

 * Prefilters as nets

Observe that if $ℬ$ is a prefilter on $Y$ then $X_{•} = (X_{i})_{i ∈ I}$ is a directed set so if we desire a map of the form $ℬ_{•} = (ℬ_{i})_{i ∈ I}$ then the obvious choice is the assignment $ℬ_{i} ⊆ ℘(X_{i})$.

One may show that if $ℬ_{•}$ is a prefilter on $f$ then $ℬ_{i}$ is a net in $X$, and that the prefilter associated with $∏ ℬ_{•} := ∏ i ∈ I ℬ_{i}$ is $∏ i ∈ I S_{i}$. This would not necessarily be true had $∏ X_{•} := ∏ i ∈ I X_{i}$ been defined on a proper subset of $S_{i} = X_{i}$. For instance, if $X$ has at least two distinct elements, $i ∈ I$ is the indiscrete filter on $X$, $S_{i} ≠ X_{i}$ is arbitrary, and $S_{i} ∈ ℬ_{i}$ been defined on the singleton set $ℬ ⊆ ℘(X)$, then the prefilter associated with $ℬ$ would be the principal prefilter $∅ ∉ ℬ$ rather than $∅ ∈ ℬ$ (where note that $B, C ∈ ℬ$ is the unique minimal filter on $f$ whereas $B ∩ C ∈ ℬ$ generates a maximal/ultrafilter on $Y$).

However, if $B, C ∈ ℬ$ is a net in $Y$ then it is not in general true that $A ∈ ℬ$ is equal to $A ⊆ B ∩ C$ since, for instance, the domain of a net in $X$ (i.e. the directed set $f$) may have any cardinality (so the class of nets in $X$ isn't even a set) whereas the cardinality of the set of prefilters on $Y$, which is a subset of $ℬ$, is bounded above.

$Y$

$X$

A prefilter $B ≤ A$ on $Y$ is an ultra prefilter if and only if $A ⊆ B$ is an ultranet in $X$.

 * Non-equivalence of subnets and subfilters

One may show that if $ℬ$ is a subnet of $B_{1}, ..., B_{n} ∈ ℬ$ then $∅ ≠ B_{1} ∩ ⋅⋅⋅ ∩ B_{n}$. However, in general there is no converse to. That is the following statement is in general false:

 * If $ℬ = ℬ^{↑X}$ and $B ∈ ℬ$ are prefilters such that $B ⊆ C ⊆ X$ then $C ∈ ℬ$ is a subset of $ℬ^{↑X}$.

It can be shown that there are prefilters $ℬ^{↑X}$ and $ℬ$ on the natural numbers $S ⊆ X$ such that $B ∈ ℬ$ but there is no order preserving map $B ⊆ S$ such that the image of $X$ is cofinal in its codomain and $B ⊆ X ∖ S$ (in particular, let $B ∩ S$ and let $∅$). This shows that nets and filters are not completely interchangeable and that there are relations that filters can express that nets can not. If, however, one was to use the following alternative definition of a subnet then this issue goes away while preserving all of the usual properties that the standard definition of "subnet" enjoys: say that $ℬ ⊆ ℘(X)$ is an alt-subnet of $ℬ$ if $ℬ ≠ ∅$.

Characterizations in terms of filter bases
Throughout $ℬ ≠ ∅$ will be a topological space with $𝔽$.

 * Closure

If $𝔽$ and $ℱ$ with $ℬ$ then the following are equivalent:

$ℬ ≤ ℱ$

$f$ is a limit point of the prefilter $ℱ$ (i.e. $ℬ ≤ ℱ$ in $ℬ ⊆ ℱ$).

There exists a prefilter $ℬ ≠ ∅$ on $X$ such that $℘(X)$ and $ℬ$ in $ℬ^{↑X}$.

There exists a prefilter $ℬ$ on $X$ such that $ℬ$ in $ℱ$.

$X$ is a cluster point of the prefilter $ℬ$.

The prefilter $ℱ = ℬ^{↑X}$ meshes with the neighborhood filter $ℬ$.

The prefilter $ℱ$ meshes with some (or equivalently, with every) filter base of $ℬ ≠ ∅$.

 * Closed

If $ℬ$ with $ℬ$ then the following are equivalent:

$X$ is closed in $ℬ$.

If $ℬ$ and $ℬ ≠ ∅$ is a prefilter on $$ such that $ℬ$ in $ℬ$, then $𝒟$.

If $ℬ ≤ 𝒟$ is such that the neighborhood filter $𝒟 ≤ ℬ$ meshes with $ℬ$ then $ℬ$.

 * The proof of this characterization depends the ultrafilter lemma, which depends on the axiom of choice.

 * Hausdorff

The following are equivalent:

$S ⊆ X$ is Hausdorff.

Every prefilter on $$ converges to at most one point in $X$.

The above statement but with the word "prefilter" replaced by any one of the following: filter, ultra prefilter, ultrafilter.

 * Compact

The following are equivalent:

$B ∈ ℬ$ is a compact space.

Every prefilter on $X$ has at least one cluster point in $X$.

For every filter $B ⊆ S$ on $X$ there exists a filter $B ⊆ X ∖ S$ on $X$ such that $ℬ$ and $ℬ$ converges to some point of $S$.

For every prefilter $S ⊆ X$ on $X$ there exists a prefilter $S ∈ ℬ$ on $X$ such that $X ∖ S ∈ ℬ$ and $ℬ$ converges to some point of $x$.

Every maximal prefilter on $S$ converges to at least one point in $x$.

The above statement but with the words "maximal prefilter" replaced by any one of the following: prefilter, filter, ultra prefilter, ultrafilter.

If $S ⊆ X$ is topological space and $S$ is the set of all complements of compact subsets of $S ∈ ℬ$, then $x$ is a filter on $S$ if and only if $X ∖ S ∈ ℬ$ is not compact.

 * Continuity

If $ℬ ∪ (X ∖ ℬ) = ℘(X)$ is a map between topological spaces $ℬ ∩ (X ∖ ℬ) = ∅$ and $ℬ$ then following are equivalent:

$S_{1}, ..., S_{n}$ is continuous.

Whenever $S_{1} ∪ ⋅⋅⋅ ∪ S_{n} ∈ ℬ$ and $S_{i} ∈ ℬ$ is a prefilter on $S$ such that $R, S ⊆ X$ in $R ∪ S ∈ ℬ$ then $R ∈ ℬ$ in $S ∈ ℬ$.

Whenever $R, S ⊆ X$ is a limit point of a prefilter $R ∩ S = ∅$ on $S$ then $R ∪ S ∈ ℬ$ is a limit point of $R ∈ ℬ$ in $S ∈ ℬ$.

Any one of the above two statements but with the word "prefilter" replaced by any one of the following: filter.

 * Products

Suppose $ℬ$ is a non-empty collection of non-empty topological spaces and that $ℱ$ is a collection of prefilters where each $ℬ ⊆ ℱ$ is a prefilter on $ℬ = ℱ$. Then the product $ℬ$ of these prefilters (defined above) is a prefilter on the product space $ℱ$, which we will assume is endowed with the product topology. If $ℬ$, then $ℬ ≠ ∅$ in $ℬ$ if and only if $ℬ$ in $S ⊆ X$ for every $S ∈ ℬ$.

Canonical uniformity
Every topological vector spaces (TVS) is a commutative topological group with identity under addition and the canonical uniformity of a TVS is defined entirely in terms of subtraction (and thus addition); scalar multiplication is not involved and no additional structure is needed. For this reason, we give definitions for an arbitrary additive commutative topological group $X ∖ S ∈ ℬ$ with identity $ℬ$.

Observe that a TVS does not need to be Hausdorff or satisfy any other conditions at all in order for the canonical uniformity to be defined.

 * Canonical uniformity on a topological group

We will henceforth assume that any topological group that we consider is an additive commutative topological group with identity element 0.

Note that if $ℬ$ then $ℬ$ will contain the diagonal $ker ℬ = ∅$.

This canonical uniformity is independent of the particular neighborhood basis of $ℬ$ that is chosen.

Having define a uniform structure on commutative topological groups, the notions of Cauchy nets, Cauchy filters, sequential completeness, and other notions are now defined via their usual definitions for uniform structures. However, for clarity, we review the relevant definitions again.

Cauchy filter bases and nets

 * Cauchy nets

 * Cauchy filter bases

The canonical uniformity is independent of the neighborhood basis $ker ℬ ≠ ∅$ that is chosen.

Examples and sufficient conditions

Every Fréchet space, Banach space, and Hilbert space is a complete TVS.

Topologizing the set of filter bases and Top(X)
Starting with nothing more than a set $S$, one may topologize the set

of all filter bases on $x$ with the Stone topology. We first define and describe the basic properties of this topology and then show how one may use it to easily topologize the set of all topologies on $X$; something is not easily done with nets in $N$.

To reduce confusion we will adhere to the following notational conventions:

Lower case letters for elements $ℬ$.

Upper case letters for subsets $x ∈ ker ℬ$.

Upper case calligraphy letters for subsets $ker ℬ ∈ ℬ$.

Upper case double-struck letters for subsets $x ∈ X$.

Observe that if ${ x } = ker ℬ ∈ ℬ$ then ${ x }^{↑X}$.

where note that $ℱ$ and $ℱ = { x }^{↑X}$. One may show that for all $ℬ = { X }$ the following holds:

where in particular, the equality $B ∈ ℬ$ shows that the collection of sets $U ∈ ℬ$ form a basis for a topology on $U + U ⊆ B$, which we will henceforth assume $ℬ$ carries. We will assume that any subset of $ℬ ⊆ ℬ + ℬ$ carries the subspace topology.

Recall that every $ℬ$ induces a canonical map $f (ℬ)$ defined by $ℬ$. Clearly, $f (ℬ)^{↑Y} := { S ⊆ Y : f ^{-1} (S) ∈ ℬ }$ is injective if and only if $f (ℬ)$ is $ℬ$ (i.e. a Kolmogorov space).

Since $f ^{-1} (f (ℬ))$ is clearly injective, to define a topology on $f ^{-1} (f (ℬ)) ≤ ℬ$ it suffices to define a topology on the range $ℬ$. So endow $f (ℬ)$ with the topology of pointwise convergence (no topology on $x$ is needed to do this) and endow $f : X → Y$ with the subspace topology. We've thus topologized $ℱ$.

We now describe some additional properties of the Stone topology. For any $f ^{-1} (ℱ )$ and $ℬ$,

 $f (ℬ)$ belongs to the closure of $𝒞$ in $f ^{-1} (𝒞)$ if and only if $∅ ∉ f ^{-1} (𝒞)$.

 $𝒞 ≤ f (f ^{-1} (𝒞))$ is a neighborhood of $𝒞$ in $f ^{-1} (𝒞)$ if and only if there exists some $ℱ$ such that $x ∈ X$ (i.e. for all $ker ℱ = { x } ∈ ℱ$, if $x ∈ X$ then $∅≠ ℬ ⊆ ℘(X)$).

The set of ultrafilters on $S$ (with the subspace topology) is a Stone space, meaning that it is compact, Hausdorff, and totally disconnected. The map $ℬ$ is a topological embedding whose image is a dense subset of $ℬ$.

For every $𝒫$, the map $ker 𝒫 ∈ 𝒫$ is continuous, closed, and open (where $ker 𝒫$ has the subspace topology inherited from $𝒰$). In addition, if $ker 𝒰 = ∅$ is a map such that $𝒰$ for every $𝒰$, then for every $𝒰$ and every $ker 𝒰 ≠ ∅$, $𝒰$ is a neighborhood of $𝒰$ in $x ∈ X$ (where $ker 𝒰 = { x } ∈ 𝒰$ has the subspace topology inherited from $x ∈ X$).

title: User:Mgkrupa/Filter bases in topology


text:
John Gunder North

John Gunder North (December 15, 1826 – September 19, 1872) was a Norwegian born ship builder in San Francisco. During his career, he built 273 hulls of all kinds with 53 bay and river steamers, including the famed paddle steamers Chrysopolis, Yosemite and Capital.

Early life
John G. North was born Johan Gurenius Nordtvedt in Trondheim, Norway. Becoming a shipbuilder for the Norwegian government, he built twenty gunboats for the Royal Norwegian Navy. He was then given a subsidy to study American shipbuilding techniques and came to Philadelphia in July 1848. After visiting and working in shipyards in New York City, Boston, Portland and New Orleans, North decided to stay in the United States, and came by sea as a ships officer to San Francisco, California on July 28, 1850. He visited the mines for a short time, then returned to San Francisco to partner with Captain William H. Moore in a small steamboat beginning a firm that later became part of the California Steam Navigation Company. After acquiring enough money from the steamboat business by 1853 North returned to being a shipbuilder.

Shipbuilding in California
In 1854, North opened his first boatyard at Steamboat Point on the shore of the lagoon called Mission Bay on the south side of what is now Townsend Street, between Third and Fourth Streets, in what is now the Mission Bay neighborhood of San Francisco.

In 1855, North built the Colorado, a 120 food long, stern-wheel steamboat, for the George A. Johnson & Company in San Francisco. It was equipped with an 80-horsepower steam engine capable of carrying up to 70 tons of cargo while drawing only 2 feet of water. North subsequently disassembled and shipped in sections by sea to the estuary of the Colorado River. There North unloaded, reassembled and launched in it in December, 1855. It was the first stern-wheel steamboat put on that river.

In 1857, North built the 449 ton, 170 foot long, single end, side-wheel, ferry steamer Contra Costa for Charles Minturn, owner of the Contra Costa Steam Navigation Company, largest ferry company in San Francisco Bay at that time.

In 1860, North left his old boatyard and opened North's Shipyard in San Francisco's Potrero District to the south on the Bay. One of the first ships built there was the Chrysopolis for California Steam Navigation Company, which would set the fastest time for a steamboat between Sacramento and San Francisco. In 1862 he built the Yosemite to run with Chrysopolis on the Sacramento River for the same company. That same year he also built the Colorado II to replace the Colorado for the George A. Johnson & Company. Again bringing it by sea to the river mouth but reassembling it up river at Arizona City under the guns of Fort Yuma, for fear of Confederate raiders. In 1864 he built the Mohave for the same company, assembling it again in the estuary.

In 1866, North built the 1,989 ton, 277 foot long Capital, the last side-wheel steamer built for the California Steam Navigation Company. Capital, largest of the steamboats on the rivers in California, remained on the water under various owners until 1896.

In 1869, he built the 294 ton, 154 foot long, side-wheel steamer, Parthenius, that provided passenger and mail service to the major landings of Contra Costa County for many years.

Later career and death
North subsequently sold North's Shipyard and left to visit Norway. In Norway, he built a steamship for its government. Subsequently, he visited shipyards and iron works in Great Britain, Germany, Italy and other places in Europe and was at the opening of the Suez Canal in Egypt before returning to San Francisco after a three-year absence. Following a trip to Guatemala where he built two steamboats for the Honduras Railroad Company, he contracted a tropical disease. North returned to San Francisco where he died a week later on September 19, 1872. He was buried in the Cypress Lawn Memorial Park at Colma in San Mateo County, California.

title: John Gunder North


text:
1989 Virginia Slims of Chicago

The 1989 Virginia Slims of Chicago was a women's tennis tournament played on indoor carpet courts at the UIC Pavilion in Chicago, Illinois in the United States and was part of the Category 4 tier of the 1989 WTA Tour. It was the 18th edition of the tournament and was held from November 6 through November 12, 1989. Second-seeded Zina Garrison won the singles title.

Singles
🇺🇸 Zina Garrison defeated Larisa Savchenko 6–3, 2–6, 6–4
 * It was Garrison's 3rd singles title of the year and the 9th of her career.

Doubles
Larisa Savchenko / Natasha Zvereva defeated  Jana Novotná /  Helena Suková 6–4, 3–6, 6–4

title: 1989 Virginia Slims of Chicago


text:
Template:Attached KML/Minnesota State Highway 308

   Minnesota State Highway 308.kml   ff0000ff 5 		    normal #line-1267FF-51   highlight #line-1267FF-5  </StyleMap> <Style id="line-1267FF-51"> <LineStyle> ff0000ff 5 		</LineStyle> </Style> <Placemark> Minnesota State Highway 308 <styleUrl>#line-1267FF-50</styleUrl> <ExtendedData> </ExtendedData> <LineString> 1 				-95.92059,48.83314,0 -95.92059,48.84400000000002,0 -95.92059,48.8479,0 -95.92061000000001,48.85062,0 		</LineString> </Placemark> </Document>


text:
Pablo Ortiz

Pablo Ortiz (January 25, 1952 – September 11, 2001) was an American construction superintendent, and former Navy SEAL. He worked for the Port Authority of New York and New Jersey, the organization that managed the World Trade Center, and is credited with playing a central role in rescuing at least 77 people who were trapped in the North Tower's upper floors during the September 11 attacks. Survivors describe last seeing him ascending a stairwell to go rescue more people with his friend and colleague Francis "Frank" De Martini.

On September 11, 2001, Ortiz and De Martini were working on the 88th floor of the North Tower of the World Trade Center, situated a mere five floors below the impact zone of American Airlines Flight 11, which struck between the 93rd and 99th floors.

They were having breakfast with co-workers and De Martini's wife, Nicole, when Flight 11 crashed above them. The impact injured some occupants on their floor, including Elaine Duch. Doors were jammed shut when the door frames were twisted. Ortiz, De Martini and their colleagues, Pete Negron, Carlos da Costa, and Mak Hanna determined that only one stairwell could be made accessible, after clearing some debris, sending the occupants of their floor down that stairwell. They freed 25 - 40 employees, which included Nicole De Martini, Elaine Duch, Joanne Ciccolello, Dorene Smith, Moe Lipson, Anita Serpe, Lila Speciner, Jeffrey Gertler, Abdul Elgendy, Patricia Cullen, Gerry Gaeta, Jim Connors, Frank Varriano, and Judith Reese.

They set about rescuing their fellow occupants on the next floor up. There were two different groups saved by the five men. The first group, consisting of Rick Bryan, Dianne DeFontes, Carmella Fischelli, Akane Ito, Raffaele Cava, Nathan Goldwasser, Trisa Moya, Ronald Scott, Robert Sibarium, Harold Martin, Walter Pilipiak, Kelly Baldillo, and Yoshi Movi, were near the stairwell. Mak Hanna was ordered to carry an elderly man down the stairs, which he did. The remaining four men freed the second group, which had Sabrina Tirao, Frances Ledesma, Thomas Haddad, Lynn Simpson, and Evan Frosch.

The four men then went up to the 90th floor, and freed more workers, which included Richard Eichen, Christopher Egan, and Lucy Gonzalez. They then went to floor 91, and freed 18 people, which included Anthony Vangeli and Michael McQuade

Realizing that they couldn't ascend any further, they went down, freeing a further six people from the 86th floor, including Louis Lesce. They then made it to the skylobby, where they freed Anthony Savas, who was stuck in an elevator.

Ortiz, De Martini, da Costa and Negron all died, still trying to save fellow occupants, when the building collapsed at 10:28 A.M. Also among the dead were Judith Reese and Anthony Savas. Ortiz's remains were never found.

In August 2003 authorities released many transcripts from 911 telephone calls, and from the radios of first responders. Jim Dwyer's summary of those transcripts described, in detail, the heroic acts of Ortiz, De Martini and their colleagues. Dwyer eventually wrote a book about the collapse, 102 Minutes, where he wrote they "pushed back the boundary line between life and death in favor of the living".

title: Pablo Ortiz


text:
Talk:Advanced Classical Mechanics/Constraints and Lagrange's Equations

The section on non-conservative forces is wrong. The final Hamiltonian still depends on the vector potential (obviously! What happened to it?) The form should be H = (p - qA)^2 / 2m + q Phi

Question on Virtual Work explanation
Here's a question (and a suggested edit) for the author(s) of the article or any other reader with similar knowledge:

I've been trying to get an intuitive understanding of why the concept of "virtual work," works in deriving Lagrange's equations. Its pretty easy to see how assuming that the system is frozen in time allows you to ignore moving constraint forces, but the question that I'm trying to answer is: why is this a legitimate assumption? I've read numerous derivations of Lagrange's Equations but none seem to explain why assuming delta t = 0 is an allowable move to make.

I'd appreciate if you could explain this in the context of the following example: A rigid, frictionless wire, rotating in a plane parallel to the earth's surface, along which a bead is constrained to move. No unbalanced applied forces are present.

Editing the text to include some sort of discussion of this issue might be quite helpful to readers, especially considering that other authors writing on Lagrange's equations have historically not addressed it.


text:
User:Dlf717

Amreek Singh Advocate a Delhi based first generation lawyer.usually practising in Delhi High Court.specialize in Criminal Civil and IPR Matters.

title: User:Dlf717


text:
Talk:Dinesh Das

WikiProject class rating
This article was automatically assessed because at least one WikiProject had rated the article as stub, and the rating on other projects was brought up to Stub class. BetacommandBot 17:51, 9 November 2007 (UTC)

title: Talk:Dinesh Das


text:
The Design and Organization of Data Centers/Contractors

Finding possible contractors
Landlord may do some physical work. Remember to deal with lease issues.

Look for contractors experienced in data center construction.

Get references, check them using a reference call checklist

Getting quality quotes
Get a minimum of three quotes.Some will completely ignore what you say is important.

Write up quote specifications in detail. This allows you to send the same information to multiple vendors, and compare the quotes fairly, as well as hold vendors to what you want done in the future.

Suggested quote requirements and specifications:

cost analysis and comparison between quotes.
 * Break down costs into line items which allows for easier

 * Three similar project references.

 * Completion dates based on date of signed PO.

 * Level of documentation to be delivered.

 * A thorough cleaning. You don't want dust in your computers and causing false fire alarms.

best solution.
 * Commentary and explanation on why their solution is the

Common problems
Watch out for bait and switch. Find out if the contractor or project manager that comes in and does the quoting will be the one actually working on the job.

For town permits, use one and only one point of contact, as this can get quite confusing and is critical in the final stages.

Always get quotes for jobs over a certain level, say, $10,000. This can save money and keep your favorite contractors quotes low.

Coordinate between your contractors. When installing a drop-ceiling in combination with a gas fire suppression system, make sure that the tile retaining clips are put into place AFTER any wiring has been done in the ceiling, as security and phone wires may be run up there.

Contractors won't do all your work. Consider having an assistant to do gopher and grunt work such as building furniture.

Remember, time used to get the quote adds on to the final completion date.


text:
Dörthe Binkert

Dörthe Binkert (born 1 January 1949) is a German novelist and non-fiction writer.

Biography
Born in Hagen in Westphalia, Binkert grew up in Frankfurt where she studied German literature, art history and politics at Frankfurt University. For the next 30 years she worked as editor and editor-in-chief for major German publishers. Since 1975 she has been living in Zürich where she completed her first historical novel, Weit übers Meer (translated as She Wore Only White), in 2008. It is the story of a young woman who is trying to escape her past by taking a transatlantic voyage to America.

title: Dörthe Binkert


text:
Wikipedia:Articles for deletion/Association for the assessment of learning in higher education

The result was soft delete. WP:REFUND applies.  So Why  14:28, 4 October 2017 (UTC)

Association for the assessment of learning in higher education

 * – ( View AfD View log  Stats )

I can't find enough in-depth coverage from independent, reliable sources which shows this organization's notability. Lots of listings, nothing in-depth.  Onel 5969  TT me 17:58, 19 September 2017 (UTC)
 * Note: This debate has been included in the list of Kentucky-related deletion discussions.  Onel 5969  TT me 17:58, 19 September 2017 (UTC)
 * Note: This debate has been included in the list of Organizations-related deletion discussions.  Onel 5969  TT me 17:59, 19 September 2017 (UTC)
 * Note: This debate has been included in the list of Education-related deletion discussions.  Onel 5969  TT me 17:59, 19 September 2017 (UTC)

 Relisted to generate a more thorough discussion and clearer consensus.

Please add new comments below this notice. Thanks, Lepricavark (talk) 05:21, 26 September 2017 (UTC)


text:
User:Tubaclarinet

Tubaclarinet loves the open, crowd-sourced method in which Wikipedia aggregates and revises its articles. Tubaclarinet also loves how misspelled terms which are entered into Wikipedia's search function are (often) automatically forwarded to a term-disambiguation page or an article for the correctly-spelled term which was most likely intended to be searched for in the first place. Tubaclarinet wants to educate Wikipedia users on how to gauge the reliability of the article(s) which they find on Wikipedia.

title: User:Tubaclarinet


text:
Talk:Dina Kochetkova

External links modified
Hello fellow Wikipedians,

I have just modified one external link on Dina Kochetkova. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 * Added archive https://web.archive.org/web/20070311082517/http://www.designedbytim.com/gymnstands/spotlight_kochetkova.htm to http://www.designedbytim.com/gymnstands/spotlight_kochetkova.htm

Cheers.— InternetArchiveBot  (Report bug) 17:19, 5 December 2017 (UTC)

title: Talk:Dina Kochetkova


text:
Custos Rotulorum of Hampshire

This is a list of people who have served as Custos Rotulorum of Hampshire.

For later custodes rotulorum, see Lord Lieutenant of Hampshire.
 * William Paulet, 1st Marquess of Winchester bef. 1544 – aft. 1558
 * John Paulet, 2nd Marquess of Winchester bef. 1562–1576
 * Sir Francis Walsingham bef. 1577–1590
 * George Carey, 2nd Baron Hunsdon bef. 1594–1603
 * Henry Wriothesley, 3rd Earl of Southampton bef. 1605–1624
 * Sir Henry Wallop 1624–1642
 * Thomas Wriothesley, 4th Earl of Southampton 1642–1646, 1660–1667
 * Joceline Percy, 11th Earl of Northumberland 1667–1670
 * Charles Paulet, 6th Marquess of Winchester 1670–1676
 * James Annesley, Baron Annesley 1676–1681
 * Edward Noel, 1st Earl of Gainsborough 1681–1688
 * James FitzJames, 1st Duke of Berwick 1688

title: Custos Rotulorum of Hampshire


text:
Talk:AK-19

Delete article?
Since the AK-19 is simply a re-chambered AK-12 and the fact that the information in this article is nearly verbatim under the AK-12 article, I propose this article be deleted and forward to the AK-12 article. — Preceding unsigned comment added by AA Quantum (talk • contribs) 08:27, 16 February 2021 (UTC)

Why not? But then it should get standalone section and redirect. And besides IMHO old czech Vz. 58 outperforms this in all parameters but muzzle velocity.--<IP_ADDRESS> (talk) 17:29, 19 February 2021 (UTC)

title: Talk:AK-19


text:
National Agricultural Library Thesaurus and Glossary

The National Agricultural Library Thesaurus (NALT) Concept Space is a controlled vocabulary of terms related to agricultural, biological, physical and social sciences. NALT is used by the National Agricultural Library (NAL) to annotate peer reviewed journal articles for NAL’s bibliographic citation database, AGRICOLA, PubAg, and Ag Data Commons. The Food Safety Research Information Office (FSRIO) and Agriculture Network Information Center (AgNIC) also use the NALT as the indexing vocabulary for their information systems. In addition, the NALT is used as an aid for locating information at the Agricultural Research Service (ARS) and the Economic Research Service (ERS) web sites and databases.

Historical overview
The NAL staff originally developed and funded NALT to meet the needs of the ARS of the United States Department of Agriculture (USDA). NALT referenced databases such as the AlgaeBase, BioTech life science dictionary, Cambridge dictionary, Index Fungorum, NCBI Taxonomy Database and Integrated Taxonomic Information System in its formation. The thesaurus was rigorously reviewed and tested by ARS scientists and specialists throughout its early developments.

The first edition was published by the National Agricultural Library on January 1, 2002. Since May 2007, NALT has been available in English and Spanish in cooperation with the Inter-American Institute for Cooperation on Agriculture (IICA), as well as other Latin American agricultural institutions belonging to the Agriculture Information and Documentation Service of the Americas (SIDALC).

NALT is mapped to resources such as the Library of Congress Subject Headings, CAB Thesaurus, AGROVOC and Wikidata. NALT, along with the two other major agricultural thesauri, AGROVOC and CAB-Thesaurus, make up the Global Agricultural Concept Space (GACS), which was the first known concept space formed in March 2014. NALT has been endorsed by AGNIC, Research Data Alliance Wheat Data Interoperability Group (RDA WDI) and the Alliance on Agricultural Information and Documentation Services (SIDALC).

Technical advances
The thesaurus was made available as Linked Open Data in 2010, assigning persistent URI labels for preferred label concepts to create meaningful relationships between different information resources (such as Web pages, datasets and research articles). These URIs are required for NALT concepts to be used as a global metadata reference, enabling aggregation of content so that related content could be located more efficiently. Its knowledge graph, a SKOS concept scheme, enables these data mappings.

The “NALT For the Machine Age” (N4MA) initiative was launched in June 2020, transforming the thesaurus into a state-of-the-art multischeme “NALT Concept Space” which captures human conceptual knowledge in machine readable form. This data standard is inspired by GACS and expands on the preexisting hierarchical structure of a thesaurus by creating alternative hierarchical arrangements in sub-schemes within the overall hierarchy. The N4MA vision is to use NALT and other semantic innovations to normalize and connect agricultural data, allowing for machine integration and increased automation to manage and advance agricultural research.

An alternative hierarchical arrangement has since been created though structural features “NALT Core” and “NALT Full”. The NALT Core is a trim NALT subscheme with 13,791 frequently used agricultural concepts, including 4,396 agriculturally important organisms (taxa) and structural updates. The NALT Full is a more granular knowledge base, containing the NALT Core in addition to 48,000 additional agricultural related organisms (taxa), in addition to several thousand less frequently used concepts for a total of 76,933 concepts. There are 11 concept types (Organism, Chemical, Product, Geographical, Topic) which express the most salient features of the concept space.

 * 1) Animals, Livestock, One Health
 * 2) Economics, Trade, Law, Business, Industry
 * 3) Farms, Agricultural Production Systems
 * 4) Fields of Study
 * 5) Forestry, Wildland Management
 * 6) Geographical Locations
 * 7) Human Nutrition, Food Safety and Quality
 * 8) Natural Resources, Conservation, Environment
 * 9) Plant Production, Gardening
 * 10) Research, Technology, Methods
 * 11) Rural Development, Communities, Education, Extension

Availability
NALT schemes are available for download, as published and maintained by NAL. The Thesaurus and Glossary can be downloaded in three editions of SKOS: RDF-XML, RDF-Ntriples and RDF-Turtle. The U.S. Government waives copyright and related rights in this work worldwide through the CC0 1.0 Universal Public Domain Dedication, allowing for it to be in the nation’s public domain.


text:
User:Ericsimonmace/sandbox

=Bridge Manufacturing= 3D printing is used to produce a first small series of the product in order to launch it on the market. Once demand for the product is raising, investments in tooling for traditional manufacturing are made.

title: User:Ericsimonmace/sandbox


text:
Cookbook:Cilantro

Cilantro is the fresh leafy part of the coriander plant. Particularly outside the USA, cilantro may go by other names including dhania, coriander leaves, Chinese parsley, or Mexican parsley.

Characteristics
Much like parsley, cilantro takes the form of bright green, feathery leaf bunches on long thin stalks. It is very aromatic, pungent, and somewhat citrussy, although a subset of the population has a genetic variation that makes them unpleasantly sensitive to cilantro's flavor.

Selection and storage
Cilantro does not dry well, so it is best to purchase it fresh. Look for bunches that are bright green and unwilted, with no slimy parts. It is best stored in the refrigerator or in a glass of water for up to a few days, after which it will start to wilt and degrade. To freeze cilantro, either blanch and drain the leaves or store them in oil. Make sure to wash cilantro before use to remove any residual grit.

Use
Fresh cilantro is an important ingredient in some Asian and South American cuisines. Chopped cilantro is also used as a garnish on many cooked dishes, much in the way of parsley. Cilantro should never itself be cooked as heat quickly destroys its delicate flavor.

Substitution
Depending on the desired use, a couple options exist as substitutions for cilantro. If you're after the flavor, culantro has a very similar aromatic profile. If you're looking for a garnish, flat-leaf parsley looks very similar and can be used pretty much identically.

title: Cookbook:Cilantro