Search results

From Maths
Jump to: navigation, search

Page title matches

Page text matches

  • This is a subgroup, and is Abelian (for finite groups - not sure about infinite)
    580 B (94 words) - 14:12, 12 May 2015
  • Using the [[Well-ordered principle]] (given the set of divisors is a finite set, the set has a maximum element, and the maximum is the same as the {{M|
    1 KB (252 words) - 08:33, 21 May 2015
  • It is very important that only finite linear combinations are in the span. ===Span of a finite set of vectors===
    1,013 B (173 words) - 17:09, 28 May 2015
  • ===Finite=== Given a ''finite'' family of [[Vector space|vector spaces]] ''over the same [[Field|field]]
    3 KB (613 words) - 13:12, 9 June 2015
  • | All finite sums from the union of the family of subspaces (inline with Lang's sum) | {{M|\boxplus}} (finite)
    3 KB (489 words) - 20:27, 1 June 2015
  • There are two. First of all is an arbitrary (finite?) operation {{M|\otimes}} where we define:
    2 KB (460 words) - 10:08, 12 June 2015
  • * "Continuous AA" - means finite no. discontinuities * "Continuous AA" - means finite no. discontinuities
    954 B (158 words) - 22:18, 11 July 2015
  • ...teq B\big]}}</ref> and {{MSeq|b_i|i|1|n|in=\mathbb{R}|pre=b:=}} be two ''[[finite]]'' {{plural|sequence|s}} of the same length (namely {{M|n\in\mathbb{N} }})
    4 KB (680 words) - 00:23, 20 August 2016
  • ...the ''adjective in the property'', for example: {{Sigma|finite}} is under "finite". ...information, so {{Sigma|finite}} is under finite, but specifically {{Sigma|finite}}
    2 KB (360 words) - 20:43, 15 June 2015
  • ...eck my books - I'm sure it's more general than this (this statement is for finite)}}
    364 B (69 words) - 13:14, 16 June 2015
  • ...n of subsets is a sigma-algebra iff it is a Dynkin system and closed under finite intersections]]
    5 KB (645 words) - 11:40, 21 August 2016
  • {{Todo|Be bothered, note the significance of the finite-ness of {{M|A}} - see [[Extended real value]]}}
    1 KB (201 words) - 22:30, 30 March 2016
  • ...n of subsets is a sigma-algebra iff it is a Dynkin system and closed under finite intersections|A Dynkin system, {{M|\mathcal{D} }} is a {{sigma|algebra}} ''
    782 B (123 words) - 22:56, 2 August 2015
  • ...n of subsets is a sigma-algebra iff it is a Dynkin system and closed under finite intersections|A collection of subsets of {{M|X}}, {{M|\mathcal{A} }} is a {
    538 B (84 words) - 15:32, 28 August 2015
  • * ''Atomic constants'': a sequence of expressions again, that may also be finite or empty
    4 KB (832 words) - 21:22, 11 August 2015
  • * Every [[Covering|cover]] by sets open in {{M|X}} has a finite subcover. }} ...every covering consisting of open sets of {{M|(X,\mathcal{J})}} contains a finite subcover.
    7 KB (1,411 words) - 19:44, 15 August 2015
  • Suppose that {{MSeq|A_i|i|1|n|in=\mathcal{R} }} is a finite [[sequence]], in this case we shall consider the ''[[countably infinite]]'' ...rove the statement for infinite sequences (as we implicitly associate each finite sequence with the corresponding infinite sequence by the above construction
    4 KB (688 words) - 21:03, 31 July 2016
  • ...ubsets of {{M|X}}, {{M|P\subseteq\mathcal{P}(X)}} where it is closed under finite intersections<ref name="PAS"/>, that is to say: ...n of subsets is a sigma-algebra iff it is a Dynkin system and closed under finite intersections|A collection of subsets of {{M|X}}, {{M|\mathcal{A} }} is a {
    960 B (158 words) - 15:43, 28 August 2015
  • .... You can do it in less, but 4 is a very natural number. Notice also it is finite. This means we can do it on a computer!
    10 KB (1,899 words) - 18:48, 23 September 2015
  • * For all finite sums {{M|\sum_i a_iv_i}} with ''distinct'' {{M|v_i\in S}} we have that {{M| * If for all finite sums {{M|\sum_i a_iv_i}} with {{M|v_i\in S}} we have that {{M|1=\sum_i a_iv
    3 KB (605 words) - 21:11, 2 November 2015

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)