Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: Formal Proof Language Example - Human-Readable?
Replies: 39   Last Post: Jun 27, 2009 11:09 PM

 Messages: [ Previous | Next ]
 MeAmI.org Posts: 405 Registered: 6/14/09
Re: Formal Proof Language Example - Human-Readable?
Posted: Jun 25, 2009 1:01 AM

On Jun 24, 6:28 pm, Andrew Tomazos <and...@tomazos.com> wrote:
> On Jun 22, 4:01 am, Jan Burse <janbu...@fastmail.fm> wrote:
>

> > b*b = (c+a) * (c-a)
> > n*q*m*n*q*m = n*q*n * q*m*m (factorization of b, c+a, c-a sic!)

>
> In this step you have used:
>
> b = n*q*m
> c+a = q*n*n
> c-a = q*m*m
>
> How do you know that there exists n, q and m such that these three
> equalities hold?
> -Andrew.

We know by

NOTE: On Existence Theorems for Finite-Codimensional Subspaces in C(Q)
1
¼ C [ f1w : jwj ¼ 1g; C. 1. ðQ; *KÞ denotes the set of functions from
Q to ...

Let m; n 2 CðQÞ n. : Then there exists a countable set R mn an
existence set it is necessary and sufficient that there hold the
conditions (b) ... (a) by letting n ¼ m: To derive condition (b), we
must show that S m. =S n. &. S m ...

Reference:

Date Subject Author
6/21/09 Andrew Tomazos
6/21/09 Jan Burse
6/21/09 Andrew Tomazos
6/21/09 Jan Burse
6/21/09 Andrew Tomazos
6/21/09 Jan Burse
6/21/09 Jan Burse
6/21/09 Jan Burse
6/21/09 Andrew Tomazos
6/21/09 Jan Burse
6/21/09 Andrew Tomazos
6/21/09 Jan Burse
6/21/09 Jan Burse
6/24/09 Andrew Tomazos
6/25/09 MeAmI.org
6/25/09 Jan Burse
6/26/09 Andrew Tomazos
6/27/09 Jan Burse
6/27/09 Andrew Tomazos
6/27/09 Jan Burse
6/27/09 Andrew Tomazos
6/27/09 Joshua Cranmer
6/27/09 Andrew Tomazos
6/21/09 Marshall
6/21/09 Spiros Bousbouras
6/24/09 Tim Smith
6/21/09 Charlie-Boo
6/21/09 William Elliot
6/22/09 MeAmI.org
6/22/09 MeAmI.org
6/23/09 Slawomir
6/24/09 David Bernier
6/24/09 MeAmI.org
6/24/09 MeAmI.org
6/24/09 Andrew Tomazos
6/24/09 Andrew Tomazos
6/25/09 Slawomir