Search results
From Maths
Create the page "C" on this wiki! See also the search results found.
Page title matches
- c: 41 54 push %r12 c: 55 push %rbp31 KB (3,827 words) - 14:42, 28 September 2015
- __TOC__{{DISPLAYTITLE:c-ring}} A ''c-ring'' is a [[ring#Properties|commutative ring]]<sup>[[ASN]]:</sup><ref>[[A426 B (52 words) - 04:30, 16 October 2016
- {{DISPLAYTITLE:{{M|C([0,1],X)}}}} ...{M|1=I:=[0,1]\subset\mathbb{R} }} - the [[closed unit interval]]. Then {{M|C(I,X)}} denotes the [[set of continuous functions]] between the interval, co1 KB (258 words) - 05:08, 3 November 2016
-
125 B (14 words) - 05:55, 1 January 2017
- ! [[C(X,Y)|{{M|C(X,Y)}}]] ...cial cases of what {{M|X}} and {{M|Y}} might be, for example: [[C(I,X)|{{M|C(I,X)}}]] - all {{link|path|topology|s}} in {{Top.|X|J}}. These sets often h958 B (151 words) - 06:13, 1 January 2017
- {{DISPLAYTITLE:{{M|A\cap (B-C)\eq(A\cap B)-C}}}} ...\ B}} and {{M|C}} be [[sets]]. Then we claim: {{M|A\cap (B-C)\eq (A\cap B)-C}}<ref name="Alec">Alec's own work</ref>424 B (71 words) - 15:07, 31 January 2017
- See: [[Notes:Ell^p(C) is complete for p between one and positive infinity inclusive]]153 B (26 words) - 18:12, 22 February 2017
- ...\subseteq\overline{\mathbb{R} } }} the space [[ell^p(C)|{{M|\ell^p(\mathbb{C})}}]] is [[complete metric space|complete]]. * Let {{M|(\mathbf{x}_n)_{n\in\mathbb{N} }\subseteq\ell^p(\mathbb{C})}} be given4 KB (664 words) - 18:56, 22 February 2017
- {{DISPLAYTITLE:The {{M|\ell^p(\mathbb{C})}} spaces are complete}} ...b{R} } }}]] be given and consider [[little-L^p(C) space|{{M|\ell^p(\mathbb{C})}}]] then we claim{{rFAVIDMH}}:1 KB (236 words) - 19:03, 18 March 2017
- {{DISPLAYTITLE:{{M|C([0,1],\mathbb{R})}} is not complete when considered with {{M|L^1}} norm}} Define {{M|(f_n)_{n\in\mathbb{N} }\subseteq C([0,1],\mathbb{R})}} as follows:2 KB (353 words) - 18:15, 23 April 2017
Page text matches
- ...Should be easy to flesh out, find some more references and demote to grade C once acceptable}}3 KB (543 words) - 09:28, 30 December 2016
- {{Requires references|grade=C|Need references for larger/smaller/stronger/weaker, Check Introduction To T2 KB (268 words) - 13:37, 20 April 2016
- ...ok (Vector Analysis and Cartesian Tensors - Third Edition - D E Borune & P C Kendall - which is a good book) distinguishbetween the <math>\nabla</math>s1 KB (245 words) - 18:35, 13 February 2015
- ** <math>U\cap V\subseteq C(Y)</math> and ...</math> such that: <math>A\subseteq U\cup V</math>, <math>U\cap V\subseteq C(A)</math>, <math>U\cap A\ne\emptyset</math> and <math>V\cap A\ne\emptyset</5 KB (866 words) - 01:52, 1 October 2016
- {{Requires proof|grade=C|msg=Really easy, hence low importance|easy=true}} {{Requires proof|grade=C|msg=Really easy, hence low importance|easy=true}}6 KB (1,146 words) - 23:04, 25 September 2016
- ...{{C|<nowiki>[[covering]]</nowiki>}} can be used, rather than the longer {{C|<nowiki>[[cover|covering]]</nowiki>}}190 B (24 words) - 15:15, 2 December 2015
- {{Requires references|grade=C|msg=Requires them, but is very widely known and borderline implicit!}}4 KB (814 words) - 22:16, 16 January 2017
- <math>\text{Int}(A)=\bigcup\{C\subset X|C\subset A\text{ and }C\text{ is open in }X\}</math>1 KB (210 words) - 00:20, 9 March 2015
- ...is a space with some useful property, this always means {{M|f:A\rightarrow C}}, for example: ...ent in {{M|B}} and maps these to a [[tuple]] whose first element is in {{M|C}}, second in {{M|D}} and third in {{M|E}}".4 KB (659 words) - 13:01, 19 February 2016
- | For any {{M|A}} and {{M|B}} there is a set {{M|C}} such that <math>x\in C\iff x=A\text{ or }x=B</math> | <math>\forall A\forall B\exists C\forall x(x\in C\leftrightarrow x=A\vee x=B)</math>3 KB (619 words) - 10:25, 11 March 2015
- ...sets{{rAPIKM}}<ref name="TAPL">Types and Programming Languages - Benjamin C. Peirce</ref>, that is:4 KB (762 words) - 20:07, 20 April 2016
- ! rowspan="2" | Blackboard<br/>{{C|\mathbb{letters} }} ! rowspan="2" | Text<br/>{{C|\text{letters} }}5 KB (759 words) - 18:48, 24 September 2016
- | <math>\forall a\in A\forall b\in A\forall c\in A([aRb\wedge bRc]\implies aRc)</math> ...=\mathbb{N} }} then <math>a\le b\wedge b\le c\iff a\le b\le c\implies a\le c</math>5 KB (1,006 words) - 13:21, 1 January 2016
- A relation {{M|R}} is transitive if for all {{M|a,b,c\in A}} we have {{M|aRb\text{ and }bRc\implies aRc}}3 KB (522 words) - 15:18, 12 February 2019
- ...'obvious' as if the image of {{M|\Vert\cdot\Vert}} could be in {{M|\mathbb{C} }} then the {{M|\Vert x\Vert\ge 0}} would make no sense. What ordering wou ...langle\cdot,\cdot\rangle:V\times V\rightarrow(\mathbb{R}\text{ or }\mathbb{C})}} induces a ''norm'' given by:6 KB (1,026 words) - 20:33, 9 April 2017
- ...<math>f:\mathbb{R}\rightarrow\mathbb{R}</math> give by <math>f(x)=ax^2+bx+c</math> We conclude from this that if a quadratic <math>ax^2+bx+c</math> is to be <math>\ge0</math> then <math>b^2-4ac\le 0</math>3 KB (609 words) - 13:04, 4 April 2017
- ...to {{M|\mathbb{R} }} - this is unlikely to be given any other way because "C" is for continuous. | {{M|\mathbb{S}^n}}, {{M|l_2}}, {{M|\mathcal{C}[a,b]}}9 KB (1,490 words) - 06:13, 1 January 2017
- Rather than working out the transform from {{M|C}} to {{M|S'}} or whatever we can simply notice: We will use <math>(x,y)''</math>to denote a point in {{M|C}}9 KB (1,525 words) - 16:30, 23 August 2015
- ||<math>\forall a,b,c\in G:[(a*b)*c=a*(b*c)]</math> ...*}} is [[Associative|associative]], because of this we may write <math>a*b*c</math> unambiguously.7 KB (1,332 words) - 07:17, 16 October 2016
- ...an still be injective, but would not be surjective if <math>\exists x(x\in C\wedge x\notin B)</math>, thus not bijective.<ref>p65 - Introduction to Set2 KB (327 words) - 10:25, 12 March 2015
